./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_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:08:39,578 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 22:08:39,579 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 22:08:39,585 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 22:08:39,585 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 22:08:39,586 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 22:08:39,586 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 22:08:39,587 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 22:08:39,588 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 22:08:39,588 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 22:08:39,589 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 22:08:39,589 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 22:08:39,589 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 22:08:39,590 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 22:08:39,590 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 22:08:39,591 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 22:08:39,591 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 22:08:39,592 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 22:08:39,593 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 22:08:39,593 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 22:08:39,594 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 22:08:39,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 22:08:39,596 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 22:08:39,596 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 22:08:39,596 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 22:08:39,596 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 22:08:39,597 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 22:08:39,597 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 22:08:39,598 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 22:08:39,598 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 22:08:39,598 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 22:08:39,599 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 22:08:39,599 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 22:08:39,599 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 22:08:39,599 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 22:08:39,600 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 22:08:39,600 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 22:08:39,607 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 22:08:39,607 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 22:08:39,608 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 22:08:39,608 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 22:08:39,608 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 22:08:39,608 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 22:08:39,608 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 22:08:39,608 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 22:08:39,609 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 22:08:39,609 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 22:08:39,609 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 22:08:39,609 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 22:08:39,609 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 22:08:39,609 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 22:08:39,610 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 22:08:39,610 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 22:08:39,610 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 22:08:39,610 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 22:08:39,610 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 22:08:39,610 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 22:08:39,610 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 22:08:39,610 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 22:08:39,611 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 22:08:39,611 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 22:08:39,611 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 22:08:39,611 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 22:08:39,611 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 22:08:39,611 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 22:08:39,611 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 22:08:39,612 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 22:08:39,612 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 22:08:39,612 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 22:08:39,612 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 22:08:39,612 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 22:08:39,612 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 22:08:39,612 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 22:08:39,612 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_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:08:39,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 22:08:39,636 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 22:08:39,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 22:08:39,639 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 22:08:39,639 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 22:08:39,640 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-12-02 22:08:39,676 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/data/5ae38caca/e5727c33d1574dcfb12c7990e5e49c2e/FLAGb43e92adb [2018-12-02 22:08:40,146 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 22:08:40,147 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-12-02 22:08:40,157 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/data/5ae38caca/e5727c33d1574dcfb12c7990e5e49c2e/FLAGb43e92adb [2018-12-02 22:08:40,168 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/data/5ae38caca/e5727c33d1574dcfb12c7990e5e49c2e [2018-12-02 22:08:40,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 22:08:40,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 22:08:40,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 22:08:40,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 22:08:40,173 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 22:08:40,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:08:40" (1/1) ... [2018-12-02 22:08:40,175 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 02.12 10:08:40, skipping insertion in model container [2018-12-02 22:08:40,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:08:40" (1/1) ... [2018-12-02 22:08:40,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 22:08:40,208 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 22:08:40,441 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:08:40,450 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 22:08:40,481 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:08:40,512 INFO L195 MainTranslator]: Completed translation [2018-12-02 22:08:40,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:08:40 WrapperNode [2018-12-02 22:08:40,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 22:08:40,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 22:08:40,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 22:08:40,513 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 22:08:40,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:08:40" (1/1) ... [2018-12-02 22:08:40,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:08:40" (1/1) ... [2018-12-02 22:08:40,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 22:08:40,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 22:08:40,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 22:08:40,535 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 22:08:40,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:08:40" (1/1) ... [2018-12-02 22:08:40,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:08:40" (1/1) ... [2018-12-02 22:08:40,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:08:40" (1/1) ... [2018-12-02 22:08:40,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:08:40" (1/1) ... [2018-12-02 22:08:40,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:08:40" (1/1) ... [2018-12-02 22:08:40,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:08:40" (1/1) ... [2018-12-02 22:08:40,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:08:40" (1/1) ... [2018-12-02 22:08:40,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 22:08:40,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 22:08:40,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 22:08:40,554 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 22:08:40,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:08:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 22:08:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 22:08:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-02 22:08:40,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-02 22:08:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 22:08:40,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 22:08:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 22:08:40,587 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 22:08:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 22:08:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 22:08:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-12-02 22:08:40,587 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-12-02 22:08:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 22:08:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 22:08:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure free_17 [2018-12-02 22:08:40,588 INFO L138 BoogieDeclarations]: Found implementation of procedure free_17 [2018-12-02 22:08:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-02 22:08:40,588 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-02 22:08:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 22:08:40,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 22:08:40,777 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 22:08:40,777 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-02 22:08:40,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:08:40 BoogieIcfgContainer [2018-12-02 22:08:40,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 22:08:40,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 22:08:40,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 22:08:40,780 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 22:08:40,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:08:40" (1/3) ... [2018-12-02 22:08:40,781 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 02.12 10:08:40, skipping insertion in model container [2018-12-02 22:08:40,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:08:40" (2/3) ... [2018-12-02 22:08:40,781 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 02.12 10:08:40, skipping insertion in model container [2018-12-02 22:08:40,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:08:40" (3/3) ... [2018-12-02 22:08:40,782 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-12-02 22:08:40,788 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 22:08:40,792 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-02 22:08:40,801 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-02 22:08:40,815 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 22:08:40,816 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 22:08:40,816 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 22:08:40,816 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 22:08:40,816 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 22:08:40,816 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 22:08:40,816 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 22:08:40,816 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 22:08:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2018-12-02 22:08:40,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 22:08:40,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:40,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:08:40,832 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-02 22:08:40,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:40,835 INFO L82 PathProgramCache]: Analyzing trace with hash -688468012, now seen corresponding path program 1 times [2018-12-02 22:08:40,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:40,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:40,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:40,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:40,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:08:40,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:08:40,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 22:08:40,955 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:08:40,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:08:40,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:08:40,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:08:40,968 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 5 states. [2018-12-02 22:08:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:41,058 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2018-12-02 22:08:41,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 22:08:41,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-02 22:08:41,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:41,065 INFO L225 Difference]: With dead ends: 77 [2018-12-02 22:08:41,065 INFO L226 Difference]: Without dead ends: 74 [2018-12-02 22:08:41,066 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-02 22:08:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-02 22:08:41,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-12-02 22:08:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-02 22:08:41,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2018-12-02 22:08:41,092 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 16 [2018-12-02 22:08:41,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:41,092 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2018-12-02 22:08:41,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:08:41,093 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2018-12-02 22:08:41,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 22:08:41,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:41,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:08:41,094 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-02 22:08:41,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:41,094 INFO L82 PathProgramCache]: Analyzing trace with hash -688468011, now seen corresponding path program 1 times [2018-12-02 22:08:41,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:41,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:41,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:41,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:41,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:08:41,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:08:41,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 22:08:41,215 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:08:41,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 22:08:41,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 22:08:41,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 22:08:41,217 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 8 states. [2018-12-02 22:08:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:41,328 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2018-12-02 22:08:41,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 22:08:41,329 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-02 22:08:41,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:41,330 INFO L225 Difference]: With dead ends: 80 [2018-12-02 22:08:41,330 INFO L226 Difference]: Without dead ends: 80 [2018-12-02 22:08:41,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 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-02 22:08:41,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-02 22:08:41,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2018-12-02 22:08:41,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 22:08:41,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2018-12-02 22:08:41,335 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 16 [2018-12-02 22:08:41,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:41,336 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2018-12-02 22:08:41,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 22:08:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2018-12-02 22:08:41,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 22:08:41,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:41,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:08:41,337 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-02 22:08:41,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:41,337 INFO L82 PathProgramCache]: Analyzing trace with hash 199035669, now seen corresponding path program 1 times [2018-12-02 22:08:41,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:41,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:41,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:41,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:41,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:08:41,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:08:41,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:08:41,365 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:08:41,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:08:41,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:08:41,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:08:41,366 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 5 states. [2018-12-02 22:08:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:41,380 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-12-02 22:08:41,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 22:08:41,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-02 22:08:41,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:41,381 INFO L225 Difference]: With dead ends: 71 [2018-12-02 22:08:41,381 INFO L226 Difference]: Without dead ends: 71 [2018-12-02 22:08:41,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:08:41,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-02 22:08:41,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-12-02 22:08:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-02 22:08:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-12-02 22:08:41,385 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 16 [2018-12-02 22:08:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:41,385 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2018-12-02 22:08:41,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:08:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-12-02 22:08:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 22:08:41,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:41,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:08:41,386 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-02 22:08:41,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:41,386 INFO L82 PathProgramCache]: Analyzing trace with hash 132315783, now seen corresponding path program 1 times [2018-12-02 22:08:41,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:41,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:41,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:41,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:41,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:08:41,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:08:41,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:08:41,409 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:08:41,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:08:41,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:08:41,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:08:41,410 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 5 states. [2018-12-02 22:08:41,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:41,426 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2018-12-02 22:08:41,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 22:08:41,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-02 22:08:41,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:41,427 INFO L225 Difference]: With dead ends: 71 [2018-12-02 22:08:41,427 INFO L226 Difference]: Without dead ends: 71 [2018-12-02 22:08:41,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:08:41,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-02 22:08:41,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-12-02 22:08:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-02 22:08:41,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2018-12-02 22:08:41,431 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 17 [2018-12-02 22:08:41,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:41,431 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2018-12-02 22:08:41,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:08:41,432 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2018-12-02 22:08:41,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 22:08:41,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:41,432 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:08:41,432 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-02 22:08:41,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:41,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1875126118, now seen corresponding path program 1 times [2018-12-02 22:08:41,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:41,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:41,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:41,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:41,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:08:41,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:08:41,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 22:08:41,450 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:08:41,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:08:41,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:08:41,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:08:41,450 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 3 states. [2018-12-02 22:08:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:41,497 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2018-12-02 22:08:41,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:08:41,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-02 22:08:41,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:41,498 INFO L225 Difference]: With dead ends: 102 [2018-12-02 22:08:41,498 INFO L226 Difference]: Without dead ends: 97 [2018-12-02 22:08:41,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:08:41,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-02 22:08:41,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2018-12-02 22:08:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 22:08:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-12-02 22:08:41,502 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 17 [2018-12-02 22:08:41,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:41,503 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-12-02 22:08:41,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:08:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-12-02 22:08:41,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 22:08:41,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:41,504 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-02 22:08:41,504 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-02 22:08:41,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:41,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1681682425, now seen corresponding path program 1 times [2018-12-02 22:08:41,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:41,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:41,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:41,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:41,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:41,595 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-02 22:08:41,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:41,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 22:08:41,596 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-02 22:08:41,597 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [6], [7], [36], [38], [42], [50], [51], [53], [55], [114], [115], [116], [118], [120], [121] [2018-12-02 22:08:41,621 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 22:08:41,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 22:08:41,735 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 22:08:41,736 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-02 22:08:41,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:41,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 22:08:41,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:41,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 22:08:41,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:41,749 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 22:08:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:41,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:08:41,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:08:41,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:08:41,815 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-02 22:08:41,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-02 22:08:41,910 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-02 22:08:41,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:08:42,100 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-02 22:08:42,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 22:08:42,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 21 [2018-12-02 22:08:42,114 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 22:08:42,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 22:08:42,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 22:08:42,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-12-02 22:08:42,115 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 14 states. [2018-12-02 22:08:42,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:42,352 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2018-12-02 22:08:42,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 22:08:42,353 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2018-12-02 22:08:42,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:42,353 INFO L225 Difference]: With dead ends: 72 [2018-12-02 22:08:42,353 INFO L226 Difference]: Without dead ends: 72 [2018-12-02 22:08:42,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2018-12-02 22:08:42,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-02 22:08:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-12-02 22:08:42,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 22:08:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-12-02 22:08:42,357 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 19 [2018-12-02 22:08:42,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:42,357 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-12-02 22:08:42,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 22:08:42,357 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-12-02 22:08:42,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 22:08:42,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:42,357 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:08:42,357 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-02 22:08:42,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:42,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1659408709, now seen corresponding path program 1 times [2018-12-02 22:08:42,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:42,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:42,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:42,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:42,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:42,411 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-02 22:08:42,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:08:42,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 22:08:42,411 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:08:42,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 22:08:42,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 22:08:42,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 22:08:42,412 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 7 states. [2018-12-02 22:08:42,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:42,477 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2018-12-02 22:08:42,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 22:08:42,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-12-02 22:08:42,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:42,477 INFO L225 Difference]: With dead ends: 90 [2018-12-02 22:08:42,477 INFO L226 Difference]: Without dead ends: 90 [2018-12-02 22:08:42,478 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-02 22:08:42,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-02 22:08:42,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 71. [2018-12-02 22:08:42,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-02 22:08:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2018-12-02 22:08:42,481 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 27 [2018-12-02 22:08:42,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:42,481 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2018-12-02 22:08:42,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 22:08:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2018-12-02 22:08:42,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 22:08:42,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:42,482 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:08:42,482 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-02 22:08:42,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:42,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1659408708, now seen corresponding path program 1 times [2018-12-02 22:08:42,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:42,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:42,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:42,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:42,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:42,524 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-02 22:08:42,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:42,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 22:08:42,525 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-02 22:08:42,525 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-02 22:08:42,526 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 22:08:42,526 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 22:08:42,583 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 22:08:42,583 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-02 22:08:42,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:42,585 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 22:08:42,635 INFO L227 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 83.65% of their original sizes. [2018-12-02 22:08:42,635 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 22:08:42,688 INFO L418 sIntCurrentIteration]: We unified 26 AI predicates to 26 [2018-12-02 22:08:42,688 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 22:08:42,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 22:08:42,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-12-02 22:08:42,688 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:08:42,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 22:08:42,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 22:08:42,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 22:08:42,689 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand 11 states. [2018-12-02 22:08:43,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:43,017 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2018-12-02 22:08:43,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 22:08:43,017 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-12-02 22:08:43,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:43,017 INFO L225 Difference]: With dead ends: 97 [2018-12-02 22:08:43,017 INFO L226 Difference]: Without dead ends: 95 [2018-12-02 22:08:43,018 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-02 22:08:43,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-02 22:08:43,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 73. [2018-12-02 22:08:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 22:08:43,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-12-02 22:08:43,021 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 27 [2018-12-02 22:08:43,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:43,021 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-12-02 22:08:43,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 22:08:43,021 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-12-02 22:08:43,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 22:08:43,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:43,021 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-02 22:08:43,022 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-02 22:08:43,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:43,022 INFO L82 PathProgramCache]: Analyzing trace with hash 772215704, now seen corresponding path program 1 times [2018-12-02 22:08:43,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:43,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:43,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:43,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:43,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:43,056 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-02 22:08:43,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:43,057 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 22:08:43,057 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-12-02 22:08:43,057 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-02 22:08:43,058 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 22:08:43,058 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 22:08:43,086 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 22:08:43,086 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-02 22:08:43,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:43,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 22:08:43,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:43,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 22:08:43,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:43,094 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 22:08:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:43,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:08:43,156 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-02 22:08:43,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:08:43,179 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-02 22:08:43,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 22:08:43,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-12-02 22:08:43,194 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 22:08:43,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 22:08:43,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 22:08:43,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2018-12-02 22:08:43,195 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 9 states. [2018-12-02 22:08:43,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:43,221 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-12-02 22:08:43,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 22:08:43,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-12-02 22:08:43,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:43,222 INFO L225 Difference]: With dead ends: 78 [2018-12-02 22:08:43,222 INFO L226 Difference]: Without dead ends: 78 [2018-12-02 22:08:43,222 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-02 22:08:43,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-02 22:08:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-12-02 22:08:43,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-02 22:08:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-12-02 22:08:43,225 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 32 [2018-12-02 22:08:43,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:43,225 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-12-02 22:08:43,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 22:08:43,225 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-12-02 22:08:43,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 22:08:43,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:43,226 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-02 22:08:43,226 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-02 22:08:43,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:43,226 INFO L82 PathProgramCache]: Analyzing trace with hash 42020810, now seen corresponding path program 2 times [2018-12-02 22:08:43,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:43,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:43,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:43,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:43,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:43,256 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-02 22:08:43,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:43,256 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 22:08:43,256 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 22:08:43,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 22:08:43,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:43,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 22:08:43,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 22:08:43,272 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 22:08:43,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-02 22:08:43,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 22:08:43,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:08:43,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:08:43,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:08:43,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:08:43,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 22:08:43,559 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-02 22:08:43,563 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-02 22:08:43,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:08:43,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 22:08:43,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-02 22:08:43,573 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-02 22:08:43,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:08:43,631 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-02 22:08:43,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 22:08:43,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 15 [2018-12-02 22:08:43,646 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 22:08:43,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 22:08:43,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 22:08:43,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=150, Unknown=1, NotChecked=24, Total=210 [2018-12-02 22:08:43,646 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 14 states. [2018-12-02 22:08:44,157 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-02 22:08:44,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:44,374 INFO L93 Difference]: Finished difference Result 127 states and 145 transitions. [2018-12-02 22:08:44,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 22:08:44,374 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-12-02 22:08:44,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:44,375 INFO L225 Difference]: With dead ends: 127 [2018-12-02 22:08:44,375 INFO L226 Difference]: Without dead ends: 127 [2018-12-02 22:08:44,375 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-02 22:08:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-02 22:08:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 87. [2018-12-02 22:08:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-02 22:08:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-12-02 22:08:44,378 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 35 [2018-12-02 22:08:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:44,378 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-12-02 22:08:44,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 22:08:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-12-02 22:08:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 22:08:44,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:44,379 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-02 22:08:44,379 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-02 22:08:44,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:44,379 INFO L82 PathProgramCache]: Analyzing trace with hash 815287897, now seen corresponding path program 1 times [2018-12-02 22:08:44,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:44,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:44,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:08:44,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:44,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:44,428 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-02 22:08:44,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:44,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 22:08:44,429 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-12-02 22:08:44,429 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-02 22:08:44,430 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 22:08:44,430 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 22:08:44,448 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 22:08:44,448 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-02 22:08:44,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:44,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 22:08:44,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:44,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 22:08:44,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:44,459 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 22:08:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:44,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:08:44,520 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-02 22:08:44,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:08:44,572 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-02 22:08:44,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 22:08:44,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-12-02 22:08:44,595 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 22:08:44,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 22:08:44,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 22:08:44,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2018-12-02 22:08:44,596 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 13 states. [2018-12-02 22:08:44,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:44,647 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-12-02 22:08:44,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 22:08:44,647 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-12-02 22:08:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:44,648 INFO L225 Difference]: With dead ends: 92 [2018-12-02 22:08:44,648 INFO L226 Difference]: Without dead ends: 92 [2018-12-02 22:08:44,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2018-12-02 22:08:44,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-02 22:08:44,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-12-02 22:08:44,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-02 22:08:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2018-12-02 22:08:44,652 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 38 [2018-12-02 22:08:44,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:44,652 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2018-12-02 22:08:44,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 22:08:44,652 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2018-12-02 22:08:44,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 22:08:44,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:44,653 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-02 22:08:44,653 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-02 22:08:44,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:44,654 INFO L82 PathProgramCache]: Analyzing trace with hash -989528821, now seen corresponding path program 2 times [2018-12-02 22:08:44,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:44,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:44,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:44,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:44,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:44,715 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-02 22:08:44,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:44,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 22:08:44,715 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 22:08:44,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 22:08:44,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:44,716 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 22:08:44,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 22:08:44,724 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 22:08:44,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-02 22:08:44,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 22:08:44,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:08:44,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:08:44,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:08:44,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:08:44,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:08:44,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:08:44,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-12-02 22:08:44,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:08:44,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 22:08:44,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:08:44,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:08:44,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:08:44,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 22:08:44,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:08:44,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 22:08:44,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:17 [2018-12-02 22:08:44,945 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-02 22:08:44,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:08:45,023 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-12-02 22:08:51,661 WARN L180 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 72 DAG size of output: 25 [2018-12-02 22:08:51,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-12-02 22:08:51,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-12-02 22:08:51,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:08:51,869 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 22:08:51,869 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 22:08:51,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:08:51,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-02 22:08:51,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 22:08:51,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:08:51,879 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:26, output treesize:5 [2018-12-02 22:08:52,861 WARN L180 SmtUtils]: Spent 938.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-12-02 22:08:52,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-02 22:08:52,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:08:52,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-12-02 22:08:52,911 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 22:08:52,911 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 22:08:52,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-12-02 22:08:52,912 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 22:08:52,915 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:08:52,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 22:08:52,919 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:31, output treesize:14 [2018-12-02 22:08:52,948 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-02 22:08:52,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 22:08:52,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 28 [2018-12-02 22:08:52,962 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 22:08:52,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 22:08:52,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 22:08:52,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=673, Unknown=1, NotChecked=0, Total=756 [2018-12-02 22:08:52,963 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand 18 states. [2018-12-02 22:08:55,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:55,500 INFO L93 Difference]: Finished difference Result 208 states and 240 transitions. [2018-12-02 22:08:55,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 22:08:55,500 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-12-02 22:08:55,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:55,501 INFO L225 Difference]: With dead ends: 208 [2018-12-02 22:08:55,502 INFO L226 Difference]: Without dead ends: 208 [2018-12-02 22:08:55,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=254, Invalid=1637, Unknown=1, NotChecked=0, Total=1892 [2018-12-02 22:08:55,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-02 22:08:55,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 97. [2018-12-02 22:08:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-02 22:08:55,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2018-12-02 22:08:55,507 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 41 [2018-12-02 22:08:55,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:55,507 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2018-12-02 22:08:55,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 22:08:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2018-12-02 22:08:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 22:08:55,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:55,508 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-02 22:08:55,508 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-02 22:08:55,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:55,509 INFO L82 PathProgramCache]: Analyzing trace with hash 29872388, now seen corresponding path program 1 times [2018-12-02 22:08:55,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:55,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:55,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:08:55,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:55,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:55,536 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-02 22:08:55,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:08:55,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:08:55,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:08:55,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:08:55,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:08:55,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:08:55,537 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 5 states. [2018-12-02 22:08:55,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:55,550 INFO L93 Difference]: Finished difference Result 129 states and 148 transitions. [2018-12-02 22:08:55,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 22:08:55,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 22:08:55,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:55,551 INFO L225 Difference]: With dead ends: 129 [2018-12-02 22:08:55,551 INFO L226 Difference]: Without dead ends: 129 [2018-12-02 22:08:55,551 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-02 22:08:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-02 22:08:55,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2018-12-02 22:08:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 22:08:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-12-02 22:08:55,553 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 46 [2018-12-02 22:08:55,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:55,554 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-12-02 22:08:55,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:08:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-12-02 22:08:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 22:08:55,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:55,554 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-02 22:08:55,554 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-02 22:08:55,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:55,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1772682723, now seen corresponding path program 1 times [2018-12-02 22:08:55,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:55,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:55,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:55,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:55,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:55,605 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-02 22:08:55,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:55,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 22:08:55,606 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-12-02 22:08:55,606 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-02 22:08:55,607 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 22:08:55,607 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 22:08:55,644 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 22:08:55,644 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-02 22:08:55,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:55,646 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 22:08:55,675 INFO L227 lantSequenceWeakener]: Weakened 43 states. On average, predicates are now at 80.37% of their original sizes. [2018-12-02 22:08:55,675 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 22:08:55,748 INFO L418 sIntCurrentIteration]: We unified 45 AI predicates to 45 [2018-12-02 22:08:55,748 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 22:08:55,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 22:08:55,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [10] total 24 [2018-12-02 22:08:55,748 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:08:55,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 22:08:55,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 22:08:55,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-12-02 22:08:55,749 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 16 states. [2018-12-02 22:08:56,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:56,193 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2018-12-02 22:08:56,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 22:08:56,193 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-12-02 22:08:56,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:56,194 INFO L225 Difference]: With dead ends: 109 [2018-12-02 22:08:56,194 INFO L226 Difference]: Without dead ends: 109 [2018-12-02 22:08:56,194 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-02 22:08:56,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-02 22:08:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-12-02 22:08:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-02 22:08:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2018-12-02 22:08:56,197 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 46 [2018-12-02 22:08:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:56,198 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2018-12-02 22:08:56,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 22:08:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2018-12-02 22:08:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 22:08:56,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:56,198 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-02 22:08:56,198 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-02 22:08:56,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:56,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1890768075, now seen corresponding path program 1 times [2018-12-02 22:08:56,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:56,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:56,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:56,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:56,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:56,269 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-02 22:08:56,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:56,269 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 22:08:56,269 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-12-02 22:08:56,270 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-02 22:08:56,271 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 22:08:56,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 22:08:56,325 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 22:08:56,325 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-02 22:08:56,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:56,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 22:08:56,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:56,326 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 22:08:56,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:56,332 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 22:08:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:56,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:08:56,439 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-02 22:08:56,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:08:56,534 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-02 22:08:56,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 22:08:56,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2018-12-02 22:08:56,549 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 22:08:56,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 22:08:56,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 22:08:56,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2018-12-02 22:08:56,550 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 19 states. [2018-12-02 22:08:56,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:56,758 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2018-12-02 22:08:56,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 22:08:56,758 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-12-02 22:08:56,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:56,759 INFO L225 Difference]: With dead ends: 127 [2018-12-02 22:08:56,759 INFO L226 Difference]: Without dead ends: 127 [2018-12-02 22:08:56,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=354, Invalid=1452, Unknown=0, NotChecked=0, Total=1806 [2018-12-02 22:08:56,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-02 22:08:56,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2018-12-02 22:08:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-02 22:08:56,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2018-12-02 22:08:56,763 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 49 [2018-12-02 22:08:56,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:56,763 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2018-12-02 22:08:56,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 22:08:56,764 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2018-12-02 22:08:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 22:08:56,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:56,765 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-02 22:08:56,765 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-02 22:08:56,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:56,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1840615610, now seen corresponding path program 1 times [2018-12-02 22:08:56,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:56,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:56,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:56,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:56,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:56,821 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-02 22:08:56,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:56,822 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 22:08:56,822 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-12-02 22:08:56,822 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-02 22:08:56,823 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 22:08:56,823 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 22:08:56,861 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 22:08:56,861 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-02 22:08:56,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:56,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 22:08:56,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:56,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 22:08:56,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:56,871 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 22:08:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:56,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:08:56,961 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-02 22:08:56,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:08:57,012 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-02 22:08:57,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 22:08:57,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-02 22:08:57,027 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 22:08:57,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 22:08:57,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 22:08:57,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=270, Unknown=0, NotChecked=0, Total=462 [2018-12-02 22:08:57,028 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 19 states. [2018-12-02 22:08:57,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:57,072 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2018-12-02 22:08:57,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 22:08:57,073 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-12-02 22:08:57,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:57,073 INFO L225 Difference]: With dead ends: 116 [2018-12-02 22:08:57,073 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 22:08:57,073 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-02 22:08:57,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 22:08:57,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-12-02 22:08:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-02 22:08:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2018-12-02 22:08:57,076 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 53 [2018-12-02 22:08:57,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:57,076 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2018-12-02 22:08:57,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 22:08:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2018-12-02 22:08:57,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 22:08:57,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:57,076 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-02 22:08:57,076 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-02 22:08:57,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:57,077 INFO L82 PathProgramCache]: Analyzing trace with hash 345523796, now seen corresponding path program 2 times [2018-12-02 22:08:57,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:57,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:57,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:57,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:57,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:57,131 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-02 22:08:57,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:57,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 22:08:57,132 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 22:08:57,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 22:08:57,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:57,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:08:57,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 22:08:57,140 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 22:08:57,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 22:08:57,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 22:08:57,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:08:57,178 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-02 22:08:57,179 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-02 22:08:57,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:08:57,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:08:57,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:08:57,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-02 22:08:57,206 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-02 22:08:57,207 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-02 22:08:57,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:08:57,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:08:57,210 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-02 22:08:57,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2018-12-02 22:08:57,226 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-02 22:08:57,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:08:57,243 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-02 22:08:57,258 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 22:08:57,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [12] total 19 [2018-12-02 22:08:57,258 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:08:57,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 22:08:57,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 22:08:57,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-12-02 22:08:57,258 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand 9 states. [2018-12-02 22:08:57,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:57,422 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2018-12-02 22:08:57,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 22:08:57,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-12-02 22:08:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:57,423 INFO L225 Difference]: With dead ends: 122 [2018-12-02 22:08:57,423 INFO L226 Difference]: Without dead ends: 122 [2018-12-02 22:08:57,423 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-02 22:08:57,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-02 22:08:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 115. [2018-12-02 22:08:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-02 22:08:57,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2018-12-02 22:08:57,425 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 56 [2018-12-02 22:08:57,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:57,425 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2018-12-02 22:08:57,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 22:08:57,425 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2018-12-02 22:08:57,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 22:08:57,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:57,426 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-02 22:08:57,426 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-02 22:08:57,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:57,426 INFO L82 PathProgramCache]: Analyzing trace with hash 2121303220, now seen corresponding path program 1 times [2018-12-02 22:08:57,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:57,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:57,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:08:57,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:57,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:57,481 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-02 22:08:57,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:57,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 22:08:57,482 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-12-02 22:08:57,482 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-02 22:08:57,482 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 22:08:57,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 22:08:57,526 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 22:08:57,527 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-02 22:08:57,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:57,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 22:08:57,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:57,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:08:57,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:57,540 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 22:08:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:57,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:08:57,634 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-02 22:08:57,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:08:57,679 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-02 22:08:57,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 22:08:57,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-02 22:08:57,694 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 22:08:57,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 22:08:57,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 22:08:57,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=299, Unknown=0, NotChecked=0, Total=506 [2018-12-02 22:08:57,694 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand 21 states. [2018-12-02 22:08:57,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:57,754 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-12-02 22:08:57,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 22:08:57,754 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2018-12-02 22:08:57,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:57,755 INFO L225 Difference]: With dead ends: 120 [2018-12-02 22:08:57,755 INFO L226 Difference]: Without dead ends: 120 [2018-12-02 22:08:57,755 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-02 22:08:57,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-02 22:08:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-12-02 22:08:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-02 22:08:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2018-12-02 22:08:57,757 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 57 [2018-12-02 22:08:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:57,757 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2018-12-02 22:08:57,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 22:08:57,757 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2018-12-02 22:08:57,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 22:08:57,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:57,757 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-02 22:08:57,758 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-02 22:08:57,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:57,758 INFO L82 PathProgramCache]: Analyzing trace with hash -390060862, now seen corresponding path program 2 times [2018-12-02 22:08:57,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:57,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:57,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:57,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:57,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:57,836 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-02 22:08:57,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:57,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 22:08:57,837 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 22:08:57,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 22:08:57,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:57,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 22:08:57,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 22:08:57,843 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 22:08:57,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 22:08:57,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 22:08:57,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:08:57,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:08:57,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:08:57,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:08:57,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 22:08:57,894 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-02 22:08:57,895 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-02 22:08:57,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:08:57,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:08:57,899 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-02 22:08:57,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2018-12-02 22:08:57,934 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-02 22:08:57,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2018-12-02 22:08:57,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:08:57,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:08:57,937 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-02 22:08:57,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-12-02 22:08:57,950 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-02 22:08:57,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:08:57,969 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-02 22:08:57,986 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 22:08:57,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [13] total 20 [2018-12-02 22:08:57,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:08:57,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 22:08:57,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 22:08:57,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-12-02 22:08:57,987 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand 9 states. [2018-12-02 22:08:58,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:58,123 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-12-02 22:08:58,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 22:08:58,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-12-02 22:08:58,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:58,124 INFO L225 Difference]: With dead ends: 132 [2018-12-02 22:08:58,124 INFO L226 Difference]: Without dead ends: 132 [2018-12-02 22:08:58,124 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-02 22:08:58,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-02 22:08:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2018-12-02 22:08:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-02 22:08:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2018-12-02 22:08:58,126 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 60 [2018-12-02 22:08:58,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:58,126 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2018-12-02 22:08:58,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 22:08:58,126 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2018-12-02 22:08:58,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 22:08:58,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:58,127 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-02 22:08:58,127 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-02 22:08:58,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:58,127 INFO L82 PathProgramCache]: Analyzing trace with hash -683463869, now seen corresponding path program 1 times [2018-12-02 22:08:58,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:58,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:58,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:08:58,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:58,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:58,153 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-02 22:08:58,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:08:58,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:08:58,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:08:58,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:08:58,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:08:58,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:08:58,154 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand 5 states. [2018-12-02 22:08:58,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:58,165 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2018-12-02 22:08:58,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 22:08:58,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-12-02 22:08:58,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:58,166 INFO L225 Difference]: With dead ends: 134 [2018-12-02 22:08:58,167 INFO L226 Difference]: Without dead ends: 134 [2018-12-02 22:08:58,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:08:58,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-02 22:08:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 120. [2018-12-02 22:08:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-02 22:08:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2018-12-02 22:08:58,169 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 60 [2018-12-02 22:08:58,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:58,170 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2018-12-02 22:08:58,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:08:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2018-12-02 22:08:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 22:08:58,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:58,171 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-02 22:08:58,171 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-02 22:08:58,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:58,171 INFO L82 PathProgramCache]: Analyzing trace with hash -600623899, now seen corresponding path program 1 times [2018-12-02 22:08:58,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:58,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:58,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:58,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:58,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:58,223 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-02 22:08:58,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:58,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 22:08:58,224 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-12-02 22:08:58,224 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-02 22:08:58,225 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 22:08:58,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 22:08:58,250 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 22:08:58,250 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-02 22:08:58,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:58,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 22:08:58,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:58,252 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:08:58,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:58,262 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 22:08:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:58,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:08:58,410 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-02 22:08:58,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:08:58,506 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-02 22:08:58,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 22:08:58,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 29 [2018-12-02 22:08:58,530 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 22:08:58,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 22:08:58,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 22:08:58,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2018-12-02 22:08:58,530 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand 19 states. [2018-12-02 22:08:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:08:58,781 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2018-12-02 22:08:58,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 22:08:58,781 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-12-02 22:08:58,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:08:58,782 INFO L225 Difference]: With dead ends: 149 [2018-12-02 22:08:58,782 INFO L226 Difference]: Without dead ends: 149 [2018-12-02 22:08:58,782 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-02 22:08:58,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-02 22:08:58,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 133. [2018-12-02 22:08:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-02 22:08:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2018-12-02 22:08:58,785 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 62 [2018-12-02 22:08:58,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:08:58,786 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2018-12-02 22:08:58,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 22:08:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2018-12-02 22:08:58,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 22:08:58,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:08:58,786 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-02 22:08:58,786 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-02 22:08:58,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:58,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1433703016, now seen corresponding path program 1 times [2018-12-02 22:08:58,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:08:58,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:58,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:58,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:08:58,787 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:08:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:58,865 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-02 22:08:58,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:58,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 22:08:58,865 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-12-02 22:08:58,866 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-02 22:08:58,867 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 22:08:58,867 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 22:08:58,900 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 22:08:58,900 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-02 22:08:58,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:08:58,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 22:08:58,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:08:58,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 22:08:58,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:08:58,912 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 22:08:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:08:58,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:08:58,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:08:58,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:08:58,954 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-02 22:08:58,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-02 22:08:59,103 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-02 22:08:59,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:08:59,388 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 22:08:59,388 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 71389 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-02 22:08:59,390 INFO L168 Benchmark]: Toolchain (without parser) took 19220.35 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.4 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -241.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:08:59,391 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:08:59,391 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -158.3 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-12-02 22:08:59,391 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.54 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 22:08:59,392 INFO L168 Benchmark]: Boogie Preprocessor took 19.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 22:08:59,392 INFO L168 Benchmark]: RCFGBuilder took 223.44 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: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2018-12-02 22:08:59,392 INFO L168 Benchmark]: TraceAbstraction took 18611.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 105.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -113.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:08:59,395 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -158.3 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.54 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 223.44 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: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18611.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 105.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -113.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 71389 column 11: unknown constant v_prenex_14 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 71389 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-02 22:09:00,678 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 22:09:00,679 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 22:09:00,686 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 22:09:00,687 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 22:09:00,687 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 22:09:00,688 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 22:09:00,689 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 22:09:00,690 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 22:09:00,691 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 22:09:00,691 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 22:09:00,691 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 22:09:00,692 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 22:09:00,693 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 22:09:00,693 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 22:09:00,694 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 22:09:00,694 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 22:09:00,695 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 22:09:00,697 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 22:09:00,698 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 22:09:00,698 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 22:09:00,699 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 22:09:00,701 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 22:09:00,701 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 22:09:00,701 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 22:09:00,702 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 22:09:00,702 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 22:09:00,703 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 22:09:00,703 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 22:09:00,704 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 22:09:00,704 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 22:09:00,705 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 22:09:00,705 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 22:09:00,705 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 22:09:00,705 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 22:09:00,706 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 22:09:00,706 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-02 22:09:00,715 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 22:09:00,715 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 22:09:00,716 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 22:09:00,716 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 22:09:00,716 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 22:09:00,716 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 22:09:00,716 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 22:09:00,716 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 22:09:00,716 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 22:09:00,716 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 22:09:00,717 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 22:09:00,717 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 22:09:00,717 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 22:09:00,717 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 22:09:00,717 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 22:09:00,717 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 22:09:00,717 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 22:09:00,717 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 22:09:00,718 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 22:09:00,718 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 22:09:00,718 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 22:09:00,718 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 22:09:00,718 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 22:09:00,718 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 22:09:00,718 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 22:09:00,718 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 22:09:00,718 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 22:09:00,718 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 22:09:00,718 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 22:09:00,719 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 22:09:00,719 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 22:09:00,719 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 22:09:00,719 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 22:09:00,719 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 22:09:00,719 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 22:09:00,719 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 22:09:00,719 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_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:09:00,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 22:09:00,750 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 22:09:00,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 22:09:00,754 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 22:09:00,754 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 22:09:00,755 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-12-02 22:09:00,797 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/data/2e42670b1/cbb694ce9fae4d36aa57c33c6dbe805d/FLAG666218760 [2018-12-02 22:09:01,214 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 22:09:01,214 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-12-02 22:09:01,222 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/data/2e42670b1/cbb694ce9fae4d36aa57c33c6dbe805d/FLAG666218760 [2018-12-02 22:09:01,576 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/data/2e42670b1/cbb694ce9fae4d36aa57c33c6dbe805d [2018-12-02 22:09:01,579 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 22:09:01,581 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 22:09:01,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 22:09:01,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 22:09:01,586 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 22:09:01,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:09:01" (1/1) ... [2018-12-02 22:09:01,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@752a000b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:09:01, skipping insertion in model container [2018-12-02 22:09:01,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:09:01" (1/1) ... [2018-12-02 22:09:01,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 22:09:01,620 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 22:09:01,818 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:09:01,831 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 22:09:01,911 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:09:01,945 INFO L195 MainTranslator]: Completed translation [2018-12-02 22:09:01,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:09:01 WrapperNode [2018-12-02 22:09:01,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 22:09:01,946 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 22:09:01,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 22:09:01,946 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 22:09:01,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:09:01" (1/1) ... [2018-12-02 22:09:01,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:09:01" (1/1) ... [2018-12-02 22:09:01,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 22:09:01,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 22:09:01,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 22:09:01,968 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 22:09:01,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:09:01" (1/1) ... [2018-12-02 22:09:01,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:09:01" (1/1) ... [2018-12-02 22:09:01,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:09:01" (1/1) ... [2018-12-02 22:09:01,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:09:01" (1/1) ... [2018-12-02 22:09:01,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:09:01" (1/1) ... [2018-12-02 22:09:01,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:09:01" (1/1) ... [2018-12-02 22:09:01,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:09:01" (1/1) ... [2018-12-02 22:09:01,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 22:09:01,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 22:09:01,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 22:09:01,988 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 22:09:01,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:09:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 22:09:02,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 22:09:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-02 22:09:02,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-02 22:09:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 22:09:02,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 22:09:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 22:09:02,019 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 22:09:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 22:09:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 22:09:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-12-02 22:09:02,019 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-12-02 22:09:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 22:09:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 22:09:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure free_17 [2018-12-02 22:09:02,020 INFO L138 BoogieDeclarations]: Found implementation of procedure free_17 [2018-12-02 22:09:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-02 22:09:02,020 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-02 22:09:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 22:09:02,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 22:09:02,242 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 22:09:02,242 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-02 22:09:02,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:09:02 BoogieIcfgContainer [2018-12-02 22:09:02,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 22:09:02,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 22:09:02,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 22:09:02,245 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 22:09:02,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:09:01" (1/3) ... [2018-12-02 22:09:02,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee19728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:09:02, skipping insertion in model container [2018-12-02 22:09:02,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:09:01" (2/3) ... [2018-12-02 22:09:02,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee19728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:09:02, skipping insertion in model container [2018-12-02 22:09:02,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:09:02" (3/3) ... [2018-12-02 22:09:02,247 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-12-02 22:09:02,252 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 22:09:02,257 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-02 22:09:02,265 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-02 22:09:02,279 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 22:09:02,279 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 22:09:02,280 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 22:09:02,280 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 22:09:02,280 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 22:09:02,280 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 22:09:02,280 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 22:09:02,280 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 22:09:02,280 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 22:09:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2018-12-02 22:09:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 22:09:02,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:09:02,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:09:02,295 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:09:02,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:09:02,298 INFO L82 PathProgramCache]: Analyzing trace with hash -688468012, now seen corresponding path program 1 times [2018-12-02 22:09:02,301 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:09:02,301 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 22:09:02,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:09:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:09:02,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:09:02,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:09:02,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:09:02,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:09:02,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 22:09:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:09:02,423 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 22:09:02,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:09:02,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 22:09:02,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:09:02,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:09:02,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:09:02,438 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 5 states. [2018-12-02 22:09:02,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:09:02,596 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2018-12-02 22:09:02,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 22:09:02,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-02 22:09:02,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:09:02,604 INFO L225 Difference]: With dead ends: 77 [2018-12-02 22:09:02,604 INFO L226 Difference]: Without dead ends: 74 [2018-12-02 22:09:02,605 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-02 22:09:02,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-02 22:09:02,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-12-02 22:09:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-02 22:09:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2018-12-02 22:09:02,631 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 16 [2018-12-02 22:09:02,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:09:02,631 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2018-12-02 22:09:02,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:09:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2018-12-02 22:09:02,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 22:09:02,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:09:02,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:09:02,633 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:09:02,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:09:02,633 INFO L82 PathProgramCache]: Analyzing trace with hash -688468011, now seen corresponding path program 1 times [2018-12-02 22:09:02,633 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:09:02,634 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 22:09:02,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:09:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:09:02,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:09:02,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:09:02,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:09:02,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:09:02,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:09:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:09:02,786 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 22:09:02,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:09:02,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 22:09:02,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 22:09:02,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 22:09:02,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 22:09:02,789 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 8 states. [2018-12-02 22:09:03,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:09:03,054 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2018-12-02 22:09:03,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 22:09:03,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-02 22:09:03,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:09:03,056 INFO L225 Difference]: With dead ends: 80 [2018-12-02 22:09:03,056 INFO L226 Difference]: Without dead ends: 80 [2018-12-02 22:09:03,057 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-02 22:09:03,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-02 22:09:03,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2018-12-02 22:09:03,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 22:09:03,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2018-12-02 22:09:03,061 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 16 [2018-12-02 22:09:03,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:09:03,062 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2018-12-02 22:09:03,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 22:09:03,062 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2018-12-02 22:09:03,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 22:09:03,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:09:03,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:09:03,063 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:09:03,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:09:03,063 INFO L82 PathProgramCache]: Analyzing trace with hash 199035669, now seen corresponding path program 1 times [2018-12-02 22:09:03,063 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:09:03,063 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 22:09:03,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:09:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:09:03,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:09:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:09:03,134 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 22:09:03,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:09:03,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:09:03,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:09:03,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:09:03,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:09:03,136 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 5 states. [2018-12-02 22:09:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:09:03,164 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-12-02 22:09:03,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 22:09:03,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-02 22:09:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:09:03,165 INFO L225 Difference]: With dead ends: 71 [2018-12-02 22:09:03,165 INFO L226 Difference]: Without dead ends: 71 [2018-12-02 22:09:03,165 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-02 22:09:03,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-02 22:09:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-12-02 22:09:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-02 22:09:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-12-02 22:09:03,169 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 16 [2018-12-02 22:09:03,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:09:03,170 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2018-12-02 22:09:03,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:09:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-12-02 22:09:03,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 22:09:03,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:09:03,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:09:03,170 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:09:03,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:09:03,171 INFO L82 PathProgramCache]: Analyzing trace with hash 132315783, now seen corresponding path program 1 times [2018-12-02 22:09:03,171 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:09:03,171 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 22:09:03,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:09:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:09:03,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:09:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:09:03,212 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 22:09:03,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:09:03,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:09:03,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:09:03,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:09:03,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:09:03,213 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 5 states. [2018-12-02 22:09:03,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:09:03,256 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2018-12-02 22:09:03,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 22:09:03,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-02 22:09:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:09:03,257 INFO L225 Difference]: With dead ends: 71 [2018-12-02 22:09:03,257 INFO L226 Difference]: Without dead ends: 71 [2018-12-02 22:09:03,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:09:03,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-02 22:09:03,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-12-02 22:09:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-02 22:09:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2018-12-02 22:09:03,261 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 17 [2018-12-02 22:09:03,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:09:03,262 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2018-12-02 22:09:03,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:09:03,262 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2018-12-02 22:09:03,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 22:09:03,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:09:03,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:09:03,263 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:09:03,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:09:03,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1875126118, now seen corresponding path program 1 times [2018-12-02 22:09:03,263 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:09:03,263 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:09:03,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:09:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:09:03,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:09:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:09:03,301 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 22:09:03,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:09:03,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 22:09:03,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:09:03,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:09:03,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:09:03,303 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 3 states. [2018-12-02 22:09:03,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:09:03,392 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2018-12-02 22:09:03,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:09:03,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-02 22:09:03,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:09:03,393 INFO L225 Difference]: With dead ends: 102 [2018-12-02 22:09:03,393 INFO L226 Difference]: Without dead ends: 97 [2018-12-02 22:09:03,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:09:03,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-02 22:09:03,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2018-12-02 22:09:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 22:09:03,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-12-02 22:09:03,399 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 17 [2018-12-02 22:09:03,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:09:03,399 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-12-02 22:09:03,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:09:03,399 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-12-02 22:09:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 22:09:03,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:09:03,400 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-02 22:09:03,400 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:09:03,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:09:03,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1681682425, now seen corresponding path program 1 times [2018-12-02 22:09:03,401 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:09:03,401 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 22:09:03,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:09:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:09:03,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:09:03,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:09:03,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:09:03,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:09:03,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:09:03,576 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-02 22:09:03,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:09:04,440 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-12-02 22:09:04,663 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-02 22:09:04,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:09:04,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 22:09:04,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:09:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:09:04,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:09:04,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:09:04,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:09:04,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:09:04,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:09:04,701 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-02 22:09:04,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:09:05,349 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-02 22:09:05,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 22:09:05,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 8] total 21 [2018-12-02 22:09:05,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 22:09:05,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 22:09:05,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2018-12-02 22:09:05,365 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 22 states. [2018-12-02 22:09:06,657 WARN L180 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-02 22:09:07,328 WARN L180 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-12-02 22:09:07,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:09:07,842 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2018-12-02 22:09:07,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 22:09:07,843 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 19 [2018-12-02 22:09:07,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:09:07,844 INFO L225 Difference]: With dead ends: 80 [2018-12-02 22:09:07,844 INFO L226 Difference]: Without dead ends: 80 [2018-12-02 22:09:07,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2018-12-02 22:09:07,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-02 22:09:07,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2018-12-02 22:09:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-02 22:09:07,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2018-12-02 22:09:07,847 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 19 [2018-12-02 22:09:07,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:09:07,848 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2018-12-02 22:09:07,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 22:09:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2018-12-02 22:09:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 22:09:07,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:09:07,849 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:09:07,849 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:09:07,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:09:07,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1659408709, now seen corresponding path program 1 times [2018-12-02 22:09:07,849 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:09:07,849 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 22:09:07,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:09:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:09:07,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:09:07,938 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-02 22:09:07,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:09:07,989 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-02 22:09:07,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:09:07,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:09:07,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:09:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:09:08,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:09:08,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:09:08,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:09:08,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:09:08,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 22:09:08,071 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-02 22:09:08,071 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 22:09:08,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 22:09:08,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 15 [2018-12-02 22:09:08,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 22:09:08,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 22:09:08,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-12-02 22:09:08,086 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 15 states. [2018-12-02 22:09:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:09:08,704 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2018-12-02 22:09:08,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 22:09:08,705 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2018-12-02 22:09:08,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:09:08,706 INFO L225 Difference]: With dead ends: 104 [2018-12-02 22:09:08,706 INFO L226 Difference]: Without dead ends: 104 [2018-12-02 22:09:08,706 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-02 22:09:08,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-02 22:09:08,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2018-12-02 22:09:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-02 22:09:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-12-02 22:09:08,712 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 27 [2018-12-02 22:09:08,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:09:08,712 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-12-02 22:09:08,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 22:09:08,712 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-12-02 22:09:08,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 22:09:08,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:09:08,713 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-02 22:09:08,713 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:09:08,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:09:08,713 INFO L82 PathProgramCache]: Analyzing trace with hash 334312789, now seen corresponding path program 2 times [2018-12-02 22:09:08,713 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:09:08,713 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:09:08,735 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 22:09:08,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 22:09:08,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 22:09:08,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:09:08,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:09:08,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:09:08,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:09:08,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:09:08,938 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-02 22:09:08,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:09:10,163 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-02 22:09:10,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:09:10,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:09:10,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 22:09:10,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 22:09:10,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 22:09:10,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:09:10,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 6 treesize of output 5 [2018-12-02 22:09:10,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:09:10,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:09:10,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:09:10,252 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-02 22:09:10,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:09:12,770 WARN L180 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-12-02 22:09:13,142 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-02 22:09:13,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 22:09:13,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 13] total 31 [2018-12-02 22:09:13,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-02 22:09:13,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-02 22:09:13,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2018-12-02 22:09:13,159 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 32 states. [2018-12-02 22:09:16,595 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2018-12-02 22:09:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:09:17,093 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2018-12-02 22:09:17,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 22:09:17,094 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 28 [2018-12-02 22:09:17,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:09:17,094 INFO L225 Difference]: With dead ends: 103 [2018-12-02 22:09:17,094 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 22:09:17,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=416, Invalid=1840, Unknown=0, NotChecked=0, Total=2256 [2018-12-02 22:09:17,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 22:09:17,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2018-12-02 22:09:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-02 22:09:17,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2018-12-02 22:09:17,098 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 28 [2018-12-02 22:09:17,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:09:17,099 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2018-12-02 22:09:17,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-02 22:09:17,099 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2018-12-02 22:09:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 22:09:17,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:09:17,100 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-02 22:09:17,100 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:09:17,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:09:17,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1183672004, now seen corresponding path program 1 times [2018-12-02 22:09:17,100 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:09:17,100 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:09:17,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:09:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:09:17,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:09:17,264 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-02 22:09:17,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:09:17,436 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-02 22:09:17,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:09:17,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:09:17,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:09:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:09:17,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:09:17,505 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-02 22:09:17,505 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 22:09:17,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 22:09:17,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 10] total 20 [2018-12-02 22:09:17,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 22:09:17,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 22:09:17,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-12-02 22:09:17,521 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 20 states. [2018-12-02 22:09:18,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:09:18,225 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-12-02 22:09:18,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 22:09:18,226 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2018-12-02 22:09:18,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:09:18,226 INFO L225 Difference]: With dead ends: 112 [2018-12-02 22:09:18,226 INFO L226 Difference]: Without dead ends: 112 [2018-12-02 22:09:18,227 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-02 22:09:18,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-02 22:09:18,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2018-12-02 22:09:18,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 22:09:18,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-12-02 22:09:18,230 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 39 [2018-12-02 22:09:18,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:09:18,230 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-12-02 22:09:18,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 22:09:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-12-02 22:09:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 22:09:18,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:09:18,231 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-02 22:09:18,231 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:09:18,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:09:18,232 INFO L82 PathProgramCache]: Analyzing trace with hash 419550613, now seen corresponding path program 3 times [2018-12-02 22:09:18,232 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:09:18,232 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:09:18,245 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-02 22:09:18,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-02 22:09:18,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 22:09:18,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:09:18,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:09:18,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:09:18,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:09:18,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:09:18,882 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-02 22:09:18,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:09:19,377 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2018-12-02 22:09:20,839 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-12-02 22:09:25,273 WARN L180 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-12-02 22:09:25,835 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-02 22:09:25,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:09:25,838 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:09:25,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 22:10:07,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-02 22:10:07,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 22:10:07,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:07,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:10:07,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:07,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:07,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:10:07,524 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-02 22:10:07,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:10:12,257 WARN L180 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-12-02 22:10:12,809 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-02 22:10:12,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 22:10:12,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 18, 19] total 48 [2018-12-02 22:10:12,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-02 22:10:12,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-02 22:10:12,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=1810, Unknown=0, NotChecked=0, Total=2256 [2018-12-02 22:10:12,832 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 48 states. [2018-12-02 22:10:13,573 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-12-02 22:10:14,187 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-02 22:10:17,665 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 154 [2018-12-02 22:10:19,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:10:19,905 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2018-12-02 22:10:19,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 22:10:19,907 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 46 [2018-12-02 22:10:19,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:10:19,907 INFO L225 Difference]: With dead ends: 103 [2018-12-02 22:10:19,907 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 22:10:19,908 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-02 22:10:19,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 22:10:19,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-12-02 22:10:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 22:10:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2018-12-02 22:10:19,911 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 46 [2018-12-02 22:10:19,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:10:19,911 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2018-12-02 22:10:19,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-02 22:10:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2018-12-02 22:10:19,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 22:10:19,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:10:19,913 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-02 22:10:19,913 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:10:19,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:10:19,913 INFO L82 PathProgramCache]: Analyzing trace with hash 361864856, now seen corresponding path program 1 times [2018-12-02 22:10:19,913 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:10:19,914 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:10:19,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:10:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:20,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:20,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:10:20,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:20,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:20,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 22:10:22,148 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 22:10:22,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:22,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:22,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 22:10:22,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:22,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 22:10:22,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-02 22:10:22,179 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-02 22:10:22,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:10:22,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:10:22,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:10:22,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:10:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:22,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:22,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:10:22,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:22,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:22,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 22:10:22,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:22,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:22,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 22:10:22,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:22,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 22:10:22,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-02 22:10:22,286 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-02 22:10:22,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:10:22,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 22:10:22,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-02 22:10:22,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 22:10:22,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 22:10:22,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=71, Unknown=1, NotChecked=16, Total=110 [2018-12-02 22:10:22,333 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand 10 states. [2018-12-02 22:10:24,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:10:24,760 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2018-12-02 22:10:24,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 22:10:24,761 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-12-02 22:10:24,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:10:24,761 INFO L225 Difference]: With dead ends: 150 [2018-12-02 22:10:24,761 INFO L226 Difference]: Without dead ends: 150 [2018-12-02 22:10:24,761 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-02 22:10:24,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-02 22:10:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 109. [2018-12-02 22:10:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-02 22:10:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2018-12-02 22:10:24,766 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 56 [2018-12-02 22:10:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:10:24,766 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2018-12-02 22:10:24,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 22:10:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2018-12-02 22:10:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 22:10:24,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:10:24,768 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-02 22:10:24,768 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:10:24,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:10:24,768 INFO L82 PathProgramCache]: Analyzing trace with hash 361864857, now seen corresponding path program 1 times [2018-12-02 22:10:24,768 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:10:24,769 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:10:24,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:10:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:25,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:25,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:10:25,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:25,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:10:25,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:25,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:25,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 22:10:26,309 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 22:10:26,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:26,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:26,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 22:10:26,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:26,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 22:10:26,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:26,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:26,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 22:10:26,360 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-02 22:10:26,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:10:26,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:10:26,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:10:26,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:10:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:26,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:26,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:10:26,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:26,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:10:26,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:26,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:26,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 22:10:26,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:26,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:26,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 22:10:26,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:26,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 22:10:26,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:26,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:26,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 22:10:26,794 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-02 22:10:26,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:10:26,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 22:10:26,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-02 22:10:26,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 22:10:26,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 22:10:26,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=130, Unknown=1, NotChecked=22, Total=182 [2018-12-02 22:10:26,988 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand 12 states. [2018-12-02 22:10:27,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:10:27,852 INFO L93 Difference]: Finished difference Result 152 states and 175 transitions. [2018-12-02 22:10:27,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 22:10:27,853 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-12-02 22:10:27,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:10:27,854 INFO L225 Difference]: With dead ends: 152 [2018-12-02 22:10:27,854 INFO L226 Difference]: Without dead ends: 152 [2018-12-02 22:10:27,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=62, Invalid=321, Unknown=1, NotChecked=36, Total=420 [2018-12-02 22:10:27,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-02 22:10:27,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 129. [2018-12-02 22:10:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-02 22:10:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 153 transitions. [2018-12-02 22:10:27,858 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 153 transitions. Word has length 56 [2018-12-02 22:10:27,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:10:27,859 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 153 transitions. [2018-12-02 22:10:27,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 22:10:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 153 transitions. [2018-12-02 22:10:27,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 22:10:27,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:10:27,860 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-02 22:10:27,860 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:10:27,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:10:27,861 INFO L82 PathProgramCache]: Analyzing trace with hash 437176094, now seen corresponding path program 1 times [2018-12-02 22:10:27,861 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:10:27,861 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:10:27,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:10:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:28,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:28,019 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-02 22:10:28,019 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 22:10:28,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:10:28,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:10:28,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:10:28,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:10:28,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:10:28,023 INFO L87 Difference]: Start difference. First operand 129 states and 153 transitions. Second operand 5 states. [2018-12-02 22:10:28,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:10:28,086 INFO L93 Difference]: Finished difference Result 142 states and 165 transitions. [2018-12-02 22:10:28,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 22:10:28,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-12-02 22:10:28,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:10:28,087 INFO L225 Difference]: With dead ends: 142 [2018-12-02 22:10:28,087 INFO L226 Difference]: Without dead ends: 137 [2018-12-02 22:10:28,087 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-02 22:10:28,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-02 22:10:28,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2018-12-02 22:10:28,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-02 22:10:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2018-12-02 22:10:28,090 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 58 [2018-12-02 22:10:28,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:10:28,090 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2018-12-02 22:10:28,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:10:28,090 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2018-12-02 22:10:28,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 22:10:28,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:10:28,091 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-02 22:10:28,091 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:10:28,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:10:28,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1633252789, now seen corresponding path program 1 times [2018-12-02 22:10:28,092 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:10:28,092 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 22:10:28,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:10:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:28,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:28,271 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-02 22:10:28,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:10:28,315 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-02 22:10:28,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:10:28,318 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 22:10:28,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:10:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:28,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:28,365 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-02 22:10:28,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:10:28,375 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-02 22:10:28,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 22:10:28,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 10 [2018-12-02 22:10:28,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 22:10:28,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 22:10:28,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-02 22:10:28,392 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 10 states. [2018-12-02 22:10:28,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:10:28,568 INFO L93 Difference]: Finished difference Result 234 states and 283 transitions. [2018-12-02 22:10:28,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 22:10:28,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-12-02 22:10:28,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:10:28,570 INFO L225 Difference]: With dead ends: 234 [2018-12-02 22:10:28,570 INFO L226 Difference]: Without dead ends: 234 [2018-12-02 22:10:28,570 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-02 22:10:28,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-02 22:10:28,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2018-12-02 22:10:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-02 22:10:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 196 transitions. [2018-12-02 22:10:28,574 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 196 transitions. Word has length 61 [2018-12-02 22:10:28,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:10:28,574 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 196 transitions. [2018-12-02 22:10:28,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 22:10:28,574 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 196 transitions. [2018-12-02 22:10:28,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 22:10:28,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:10:28,575 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-02 22:10:28,575 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:10:28,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:10:28,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1353712470, now seen corresponding path program 1 times [2018-12-02 22:10:28,575 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:10:28,575 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 22:10:28,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:10:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:28,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:28,641 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-02 22:10:28,641 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 22:10:28,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:10:28,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:10:28,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:10:28,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:10:28,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:10:28,643 INFO L87 Difference]: Start difference. First operand 157 states and 196 transitions. Second operand 5 states. [2018-12-02 22:10:28,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:10:28,681 INFO L93 Difference]: Finished difference Result 196 states and 244 transitions. [2018-12-02 22:10:28,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 22:10:28,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-02 22:10:28,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:10:28,683 INFO L225 Difference]: With dead ends: 196 [2018-12-02 22:10:28,683 INFO L226 Difference]: Without dead ends: 196 [2018-12-02 22:10:28,683 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-02 22:10:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-02 22:10:28,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 161. [2018-12-02 22:10:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-02 22:10:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 199 transitions. [2018-12-02 22:10:28,688 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 199 transitions. Word has length 65 [2018-12-02 22:10:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:10:28,688 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 199 transitions. [2018-12-02 22:10:28,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:10:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2018-12-02 22:10:28,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 22:10:28,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:10:28,689 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-02 22:10:28,689 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:10:28,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:10:28,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1433703017, now seen corresponding path program 1 times [2018-12-02 22:10:28,690 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:10:28,690 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:10:28,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:10:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:28,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:28,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:10:28,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:28,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:28,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 22:10:28,882 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-02 22:10:28,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:10:28,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:10:28,929 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:10:28,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:10:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:28,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:28,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:10:28,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:28,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:28,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 22:10:28,979 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-02 22:10:28,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:10:29,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 22:10:29,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-02 22:10:29,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 22:10:29,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 22:10:29,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=50, Unknown=6, NotChecked=0, Total=72 [2018-12-02 22:10:29,048 INFO L87 Difference]: Start difference. First operand 161 states and 199 transitions. Second operand 8 states. [2018-12-02 22:10:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:10:29,359 INFO L93 Difference]: Finished difference Result 186 states and 223 transitions. [2018-12-02 22:10:29,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 22:10:29,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-12-02 22:10:29,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:10:29,360 INFO L225 Difference]: With dead ends: 186 [2018-12-02 22:10:29,360 INFO L226 Difference]: Without dead ends: 186 [2018-12-02 22:10:29,360 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-02 22:10:29,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-02 22:10:29,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 166. [2018-12-02 22:10:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-02 22:10:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 205 transitions. [2018-12-02 22:10:29,364 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 205 transitions. Word has length 65 [2018-12-02 22:10:29,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:10:29,364 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 205 transitions. [2018-12-02 22:10:29,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 22:10:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 205 transitions. [2018-12-02 22:10:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 22:10:29,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:10:29,365 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-02 22:10:29,365 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:10:29,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:10:29,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1433703016, now seen corresponding path program 1 times [2018-12-02 22:10:29,365 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:10:29,365 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:10:29,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:10:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:29,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:29,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:10:29,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:29,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:29,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:10:29,623 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-02 22:10:29,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:10:29,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:10:29,866 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:10:29,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:10:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:29,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:29,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:10:29,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:29,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:29,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:10:29,924 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-02 22:10:29,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:10:30,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 22:10:30,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-02 22:10:30,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 22:10:30,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 22:10:30,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-02 22:10:30,392 INFO L87 Difference]: Start difference. First operand 166 states and 205 transitions. Second operand 10 states. [2018-12-02 22:10:30,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:10:30,968 INFO L93 Difference]: Finished difference Result 210 states and 251 transitions. [2018-12-02 22:10:30,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 22:10:30,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-12-02 22:10:30,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:10:30,969 INFO L225 Difference]: With dead ends: 210 [2018-12-02 22:10:30,969 INFO L226 Difference]: Without dead ends: 210 [2018-12-02 22:10:30,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-12-02 22:10:30,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-02 22:10:30,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 190. [2018-12-02 22:10:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-02 22:10:30,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 241 transitions. [2018-12-02 22:10:30,973 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 241 transitions. Word has length 65 [2018-12-02 22:10:30,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:10:30,973 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 241 transitions. [2018-12-02 22:10:30,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 22:10:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 241 transitions. [2018-12-02 22:10:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 22:10:30,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:10:30,973 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-02 22:10:30,974 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:10:30,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:10:30,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1459650496, now seen corresponding path program 1 times [2018-12-02 22:10:30,974 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:10:30,974 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:10:30,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:10:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:31,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:31,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:10:31,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:31,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:10:31,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:31,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:31,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 22:10:32,962 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 22:10:32,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:32,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:32,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 22:10:32,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:32,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 22:10:32,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:32,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:32,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 22:10:33,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:33,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:33,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 22:10:33,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:33,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 22:10:33,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:33,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:33,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 22:10:33,088 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-02 22:10:33,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:10:33,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:10:33,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:10:33,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:10:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:33,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:33,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:10:33,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:33,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:10:33,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:33,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:33,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 22:10:33,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:33,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 22:10:33,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:33,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:33,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:33,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 22:10:33,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:33,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:33,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 22:10:33,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:33,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 22:10:33,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:33,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:33,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:33,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 22:10:33,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:33,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:33,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 22:10:33,611 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-02 22:10:33,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:10:33,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 22:10:33,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-12-02 22:10:33,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 22:10:33,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 22:10:33,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2018-12-02 22:10:33,827 INFO L87 Difference]: Start difference. First operand 190 states and 241 transitions. Second operand 14 states. [2018-12-02 22:10:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:10:34,957 INFO L93 Difference]: Finished difference Result 248 states and 305 transitions. [2018-12-02 22:10:34,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 22:10:34,957 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2018-12-02 22:10:34,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:10:34,958 INFO L225 Difference]: With dead ends: 248 [2018-12-02 22:10:34,959 INFO L226 Difference]: Without dead ends: 248 [2018-12-02 22:10:34,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=79, Invalid=430, Unknown=1, NotChecked=42, Total=552 [2018-12-02 22:10:34,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-12-02 22:10:34,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 190. [2018-12-02 22:10:34,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-02 22:10:34,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 239 transitions. [2018-12-02 22:10:34,964 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 239 transitions. Word has length 66 [2018-12-02 22:10:34,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:10:34,965 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 239 transitions. [2018-12-02 22:10:34,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 22:10:34,965 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 239 transitions. [2018-12-02 22:10:34,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 22:10:34,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:10:34,965 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-02 22:10:34,966 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:10:34,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:10:34,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1495120572, now seen corresponding path program 1 times [2018-12-02 22:10:34,966 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:10:34,966 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:10:34,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:10:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:35,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:35,178 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-02 22:10:35,180 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-02 22:10:35,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-02 22:10:35,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02 22:10:35,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-02 22:10:35,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-02 22:10:35,270 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-02 22:10:35,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,275 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-02 22:10:35,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-12-02 22:10:35,343 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-02 22:10:35,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,351 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-02 22:10:35,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-12-02 22:10:35,443 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-02 22:10:35,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,460 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-02 22:10:35,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-12-02 22:10:35,585 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-02 22:10:35,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,615 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-02 22:10:35,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:61 [2018-12-02 22:10:35,769 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-02 22:10:35,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:35,820 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-02 22:10:35,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:35,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2018-12-02 22:10:36,009 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-02 22:10:36,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,093 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-02 22:10:36,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:36,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:36,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:36,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:79 [2018-12-02 22:10:36,317 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-02 22:10:36,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,444 INFO L303 Elim1Store]: Index analysis took 126 ms [2018-12-02 22:10:36,445 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-02 22:10:36,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:36,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:36,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:36,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:92, output treesize:88 [2018-12-02 22:10:36,697 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-02 22:10:36,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:36,727 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-02 22:10:36,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:36,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:36,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:36,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:96, output treesize:92 [2018-12-02 22:10:37,103 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-02 22:10:37,106 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-02 22:10:37,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:37,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:37,108 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-02 22:10:37,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:3 [2018-12-02 22:10:37,151 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-02 22:10:37,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:10:37,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:10:37,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:10:37,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:10:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:37,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:37,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:10:37,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:37,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:37,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:10:37,690 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-02 22:10:37,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 12 treesize of output 11 [2018-12-02 22:10:37,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:37,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:37,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:37,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-02 22:10:37,838 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-02 22:10:37,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:37,842 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-02 22:10:37,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:37,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:37,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:37,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-12-02 22:10:38,026 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-02 22:10:38,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:38,059 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-02 22:10:38,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,071 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-02 22:10:38,071 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:38,084 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:38,097 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-02 22:10:38,097 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:29 [2018-12-02 22:10:38,235 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-02 22:10:38,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,244 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-02 22:10:38,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:38,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:38,269 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-02 22:10:38,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-02 22:10:38,369 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-02 22:10:38,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02 22:10:38,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:38,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:38,408 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-02 22:10:38,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-02 22:10:38,512 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-02 22:10:38,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,520 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-02 22:10:38,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:38,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:38,545 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-02 22:10:38,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-02 22:10:38,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 41 treesize of output 32 [2018-12-02 22:10:38,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,656 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-02 22:10:38,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:38,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:38,683 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-02 22:10:38,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-02 22:10:38,778 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-02 22:10:38,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,790 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-02 22:10:38,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:38,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:38,814 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-02 22:10:38,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-02 22:10:38,913 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-02 22:10:38,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:38,926 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-02 22:10:38,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:38,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:38,950 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-02 22:10:38,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-02 22:10:39,046 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-02 22:10:39,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:39,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:39,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:39,059 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-02 22:10:39,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:39,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:39,084 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-02 22:10:39,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-02 22:10:39,300 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-02 22:10:39,302 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-02 22:10:39,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:39,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:39,304 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-02 22:10:39,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:3 [2018-12-02 22:10:39,311 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-02 22:10:39,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:10:39,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 22:10:39,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16] total 41 [2018-12-02 22:10:39,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-02 22:10:39,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-02 22:10:39,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1883, Unknown=0, NotChecked=0, Total=2070 [2018-12-02 22:10:39,391 INFO L87 Difference]: Start difference. First operand 190 states and 239 transitions. Second operand 42 states. [2018-12-02 22:10:45,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:10:45,347 INFO L93 Difference]: Finished difference Result 221 states and 271 transitions. [2018-12-02 22:10:45,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-02 22:10:45,348 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 66 [2018-12-02 22:10:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:10:45,349 INFO L225 Difference]: With dead ends: 221 [2018-12-02 22:10:45,349 INFO L226 Difference]: Without dead ends: 221 [2018-12-02 22:10:45,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 109 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2033 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=507, Invalid=5813, Unknown=0, NotChecked=0, Total=6320 [2018-12-02 22:10:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-12-02 22:10:45,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 205. [2018-12-02 22:10:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-02 22:10:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 259 transitions. [2018-12-02 22:10:45,353 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 259 transitions. Word has length 66 [2018-12-02 22:10:45,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:10:45,354 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 259 transitions. [2018-12-02 22:10:45,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-02 22:10:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 259 transitions. [2018-12-02 22:10:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 22:10:45,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:10:45,354 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-02 22:10:45,354 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:10:45,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:10:45,355 INFO L82 PathProgramCache]: Analyzing trace with hash 895902583, now seen corresponding path program 1 times [2018-12-02 22:10:45,355 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:10:45,355 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:10:45,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:10:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:45,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:45,584 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-02 22:10:45,586 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-02 22:10:45,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:45,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:45,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:45,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-02 22:10:45,622 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-02 22:10:45,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,625 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-02 22:10:45,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:45,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:45,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:45,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-02 22:10:45,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, 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-02 22:10:45,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,683 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-02 22:10:45,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:45,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:45,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:45,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-12-02 22:10:45,751 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-02 22:10:45,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,757 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-02 22:10:45,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:45,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:45,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:45,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-12-02 22:10:45,846 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-02 22:10:45,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,854 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-02 22:10:45,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:45,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:45,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:45,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-12-02 22:10:45,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 59 treesize of output 46 [2018-12-02 22:10:45,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:45,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,003 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-02 22:10:46,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:46,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:46,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:46,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:61 [2018-12-02 22:10:46,137 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-02 22:10:46,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,153 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-02 22:10:46,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:46,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:46,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:46,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2018-12-02 22:10:46,332 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-02 22:10:46,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,413 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-02 22:10:46,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:46,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:46,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:46,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:79 [2018-12-02 22:10:46,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 86 treesize of output 67 [2018-12-02 22:10:46,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:46,744 INFO L303 Elim1Store]: Index analysis took 122 ms [2018-12-02 22:10:46,745 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-02 22:10:46,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:46,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:46,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:46,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:92, output treesize:88 [2018-12-02 22:10:47,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, 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-02 22:10:47,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:47,044 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-02 22:10:47,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:47,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:47,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:47,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:96, output treesize:92 [2018-12-02 22:10:47,441 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-02 22:10:47,444 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-02 22:10:47,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:47,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:47,458 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-02 22:10:47,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:3 [2018-12-02 22:10:47,510 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-02 22:10:47,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:10:47,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:10:47,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:10:47,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:10:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:47,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:47,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:10:47,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:47,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:47,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:10:48,044 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-02 22:10:48,046 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-02 22:10:48,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:48,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:48,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:48,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-02 22:10:48,197 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-02 22:10:48,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:48,200 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-02 22:10:48,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:48,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:48,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:48,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-12-02 22:10:48,411 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-02 22:10:48,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:48,436 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-02 22:10:48,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:48,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:48,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:48,443 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-02 22:10:48,443 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:48,450 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:48,457 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-02 22:10:48,457 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:29 [2018-12-02 22:10:48,527 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-02 22:10:48,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:48,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:48,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:48,534 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-02 22:10:48,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:48,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:48,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-02 22:10:48,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-02 22:10:48,654 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-02 22:10:48,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:48,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:48,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:48,662 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-02 22:10:48,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:48,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:48,686 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-02 22:10:48,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-02 22:10:48,788 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-02 22:10:48,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:48,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:48,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:48,796 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-02 22:10:48,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:48,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:48,821 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-02 22:10:48,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-02 22:10:48,933 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-02 22:10:48,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:48,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:48,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:48,941 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-02 22:10:48,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:48,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:48,966 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-02 22:10:48,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-02 22:10:49,070 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-02 22:10:49,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:49,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:49,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:49,078 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-02 22:10:49,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:49,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:49,106 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-02 22:10:49,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-02 22:10:49,237 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-02 22:10:49,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:49,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:49,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:49,247 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-02 22:10:49,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:49,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:49,281 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-02 22:10:49,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-02 22:10:49,392 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-02 22:10:49,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:49,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:49,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:10:49,399 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-02 22:10:49,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:49,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:49,428 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-02 22:10:49,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-02 22:10:49,694 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-02 22:10:49,695 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-02 22:10:49,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:10:49,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:10:49,697 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-02 22:10:49,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:3 [2018-12-02 22:10:49,704 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-02 22:10:49,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:10:49,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 22:10:49,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16] total 41 [2018-12-02 22:10:49,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-02 22:10:49,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-02 22:10:49,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1883, Unknown=0, NotChecked=0, Total=2070 [2018-12-02 22:10:49,783 INFO L87 Difference]: Start difference. First operand 205 states and 259 transitions. Second operand 42 states. [2018-12-02 22:10:55,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:10:55,911 INFO L93 Difference]: Finished difference Result 218 states and 268 transitions. [2018-12-02 22:10:55,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-02 22:10:55,912 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 67 [2018-12-02 22:10:55,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:10:55,912 INFO L225 Difference]: With dead ends: 218 [2018-12-02 22:10:55,912 INFO L226 Difference]: Without dead ends: 218 [2018-12-02 22:10:55,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 113 SyntacticMatches, 8 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1908 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=490, Invalid=5516, Unknown=0, NotChecked=0, Total=6006 [2018-12-02 22:10:55,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-02 22:10:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 206. [2018-12-02 22:10:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-02 22:10:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 260 transitions. [2018-12-02 22:10:55,917 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 260 transitions. Word has length 67 [2018-12-02 22:10:55,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:10:55,917 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 260 transitions. [2018-12-02 22:10:55,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-02 22:10:55,917 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 260 transitions. [2018-12-02 22:10:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 22:10:55,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:10:55,918 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-02 22:10:55,918 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:10:55,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:10:55,918 INFO L82 PathProgramCache]: Analyzing trace with hash -822028470, now seen corresponding path program 1 times [2018-12-02 22:10:55,918 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:10:55,918 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:10:55,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:10:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:56,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:56,232 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-02 22:10:56,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:10:56,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-02 22:10:56,580 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-02 22:10:56,627 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-02 22:10:56,628 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-02 22:10:56,659 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-02 22:10:56,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2018-12-02 22:10:57,115 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-02 22:10:57,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:10:57,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:10:57,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:10:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:10:57,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:10:57,191 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-02 22:10:57,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:10:59,934 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-02 22:10:59,935 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-02 22:10:59,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 22:10:59,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-02 22:11:00,495 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-02 22:11:00,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 22:11:00,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10] total 25 [2018-12-02 22:11:00,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 22:11:00,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 22:11:00,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=572, Unknown=1, NotChecked=0, Total=650 [2018-12-02 22:11:00,511 INFO L87 Difference]: Start difference. First operand 206 states and 260 transitions. Second operand 26 states. [2018-12-02 22:11:03,783 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-02 22:11:04,007 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-12-02 22:11:04,588 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-12-02 22:11:04,968 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-12-02 22:11:05,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:11:05,952 INFO L93 Difference]: Finished difference Result 305 states and 361 transitions. [2018-12-02 22:11:05,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 22:11:05,953 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 68 [2018-12-02 22:11:05,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:11:05,954 INFO L225 Difference]: With dead ends: 305 [2018-12-02 22:11:05,954 INFO L226 Difference]: Without dead ends: 305 [2018-12-02 22:11:05,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=457, Invalid=2194, Unknown=1, NotChecked=0, Total=2652 [2018-12-02 22:11:05,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-02 22:11:05,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 210. [2018-12-02 22:11:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-02 22:11:05,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 262 transitions. [2018-12-02 22:11:05,960 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 262 transitions. Word has length 68 [2018-12-02 22:11:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:11:05,960 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 262 transitions. [2018-12-02 22:11:05,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 22:11:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 262 transitions. [2018-12-02 22:11:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 22:11:05,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:11:05,961 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-02 22:11:05,961 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:11:05,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:11:05,962 INFO L82 PathProgramCache]: Analyzing trace with hash 286921247, now seen corresponding path program 1 times [2018-12-02 22:11:05,962 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:11:05,962 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:11:05,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:11:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:11:06,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:11:06,193 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-02 22:11:06,194 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-02 22:11:06,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:06,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:06,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:06,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-02 22:11:06,269 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-02 22:11:06,270 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-02 22:11:06,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:06,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:06,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:06,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-02 22:11:06,286 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-02 22:11:06,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:11:06,428 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-02 22:11:06,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:11:06,430 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:11:06,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:11:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:11:06,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:11:06,487 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-02 22:11:06,489 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-02 22:11:06,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:06,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:06,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:06,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-02 22:11:06,530 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-02 22:11:06,531 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-02 22:11:06,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:06,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:06,533 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-02 22:11:06,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-02 22:11:06,536 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-02 22:11:06,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:11:06,568 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-02 22:11:06,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 22:11:06,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 13, 8] total 18 [2018-12-02 22:11:06,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 22:11:06,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 22:11:06,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-12-02 22:11:06,584 INFO L87 Difference]: Start difference. First operand 210 states and 262 transitions. Second operand 19 states. [2018-12-02 22:11:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:11:07,772 INFO L93 Difference]: Finished difference Result 246 states and 306 transitions. [2018-12-02 22:11:07,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 22:11:07,773 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2018-12-02 22:11:07,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:11:07,774 INFO L225 Difference]: With dead ends: 246 [2018-12-02 22:11:07,774 INFO L226 Difference]: Without dead ends: 246 [2018-12-02 22:11:07,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 257 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=1253, Unknown=0, NotChecked=0, Total=1482 [2018-12-02 22:11:07,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-12-02 22:11:07,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 212. [2018-12-02 22:11:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-12-02 22:11:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 264 transitions. [2018-12-02 22:11:07,779 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 264 transitions. Word has length 69 [2018-12-02 22:11:07,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:11:07,779 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 264 transitions. [2018-12-02 22:11:07,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 22:11:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 264 transitions. [2018-12-02 22:11:07,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 22:11:07,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:11:07,780 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-02 22:11:07,780 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:11:07,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:11:07,780 INFO L82 PathProgramCache]: Analyzing trace with hash 304624201, now seen corresponding path program 1 times [2018-12-02 22:11:07,781 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:11:07,781 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:11:07,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:11:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:11:07,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:11:07,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:11:07,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:07,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:07,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 22:11:08,021 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-02 22:11:08,022 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-02 22:11:08,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:08,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:08,033 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-02 22:11:08,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:20 [2018-12-02 22:11:08,071 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-02 22:11:08,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:08,072 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-02 22:11:08,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-02 22:11:08,104 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-02 22:11:08,105 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-02 22:11:08,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:08,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:08,108 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-02 22:11:08,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-12-02 22:11:08,124 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-02 22:11:08,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:11:08,435 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-02 22:11:08,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:11:08,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:11:08,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:11:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:11:08,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:11:08,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:11:08,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:08,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:08,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 22:11:08,513 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-02 22:11:08,515 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-02 22:11:08,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:08,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:08,525 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-02 22:11:08,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:20 [2018-12-02 22:11:08,527 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-02 22:11:08,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:08,528 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-02 22:11:08,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:3 [2018-12-02 22:11:08,531 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-02 22:11:08,533 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-02 22:11:08,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:08,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:08,535 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-02 22:11:08,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-12-02 22:11:08,539 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-02 22:11:08,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:11:12,639 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-02 22:11:12,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 22:11:12,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 14, 9] total 21 [2018-12-02 22:11:12,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 22:11:12,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 22:11:12,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=409, Unknown=2, NotChecked=0, Total=462 [2018-12-02 22:11:12,655 INFO L87 Difference]: Start difference. First operand 212 states and 264 transitions. Second operand 22 states. [2018-12-02 22:11:36,218 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 55 [2018-12-02 22:11:38,466 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2018-12-02 22:11:51,932 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2018-12-02 22:11:56,265 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 67 [2018-12-02 22:11:56,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:11:56,427 INFO L93 Difference]: Finished difference Result 299 states and 371 transitions. [2018-12-02 22:11:56,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-02 22:11:56,428 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 70 [2018-12-02 22:11:56,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:11:56,428 INFO L225 Difference]: With dead ends: 299 [2018-12-02 22:11:56,428 INFO L226 Difference]: Without dead ends: 299 [2018-12-02 22:11:56,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=321, Invalid=2537, Unknown=4, NotChecked=0, Total=2862 [2018-12-02 22:11:56,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-12-02 22:11:56,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 232. [2018-12-02 22:11:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-02 22:11:56,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 294 transitions. [2018-12-02 22:11:56,433 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 294 transitions. Word has length 70 [2018-12-02 22:11:56,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:11:56,433 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 294 transitions. [2018-12-02 22:11:56,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 22:11:56,434 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 294 transitions. [2018-12-02 22:11:56,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 22:11:56,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:11:56,434 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-02 22:11:56,434 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:11:56,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:11:56,434 INFO L82 PathProgramCache]: Analyzing trace with hash 907133097, now seen corresponding path program 1 times [2018-12-02 22:11:56,435 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:11:56,435 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:11:56,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:11:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:11:56,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:11:56,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02 22:11:56,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:56,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:56,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-12-02 22:11:56,831 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-02 22:11:56,833 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-02 22:11:56,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:56,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:56,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:56,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-02 22:11:56,879 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-02 22:11:56,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:56,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-02 22:11:56,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:56,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:56,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:56,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-12-02 22:11:56,946 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-02 22:11:56,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:56,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:56,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:56,950 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-02 22:11:56,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:56,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:56,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:56,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-12-02 22:11:57,031 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-02 22:11:57,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,042 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-02 22:11:57,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:57,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:57,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:57,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2018-12-02 22:11:57,151 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-02 22:11:57,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,160 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-02 22:11:57,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:57,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:57,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:57,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2018-12-02 22:11:57,298 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-02 22:11:57,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,312 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-02 22:11:57,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:57,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:57,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:57,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:76, output treesize:72 [2018-12-02 22:11:57,476 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-02 22:11:57,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,491 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-02 22:11:57,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:57,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:57,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:57,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:81 [2018-12-02 22:11:57,685 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-02 22:11:57,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,707 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-02 22:11:57,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:57,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:57,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:57,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:94, output treesize:90 [2018-12-02 22:11:57,934 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-02 22:11:57,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:57,962 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-02 22:11:57,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:58,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:58,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:58,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:103, output treesize:99 [2018-12-02 22:11:58,244 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-02 22:11:58,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,408 INFO L303 Elim1Store]: Index analysis took 162 ms [2018-12-02 22:11:58,408 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-02 22:11:58,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:58,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:58,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:58,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:112, output treesize:101 [2018-12-02 22:11:58,865 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-02 22:11:58,869 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-02 22:11:58,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:58,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:58,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:58,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:15 [2018-12-02 22:11:58,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:58,914 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-02 22:11:58,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:58,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:58,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-02 22:11:58,975 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-02 22:11:58,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:11:59,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:11:59,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:11:59,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:11:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:11:59,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:11:59,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, 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-02 22:11:59,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:59,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:59,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-12-02 22:11:59,759 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-02 22:11:59,761 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-02 22:11:59,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:59,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:59,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:59,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-02 22:11:59,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-02 22:11:59,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:11:59,912 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-02 22:11:59,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:11:59,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:59,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:11:59,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-12-02 22:12:00,087 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-02 22:12:00,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:00,120 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-02 22:12:00,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:00,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:00,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:00,124 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-02 22:12:00,124 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:00,132 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:00,144 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-02 22:12:00,144 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:66, output treesize:38 [2018-12-02 22:12:00,451 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-02 22:12:00,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:00,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:00,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:00,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:00,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:00,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:00,458 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-02 22:12:00,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:00,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:00,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:00,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-12-02 22:12:00,693 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-02 22:12:00,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:00,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:00,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:00,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:00,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:00,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:00,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:00,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:00,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:00,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:00,702 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-02 22:12:00,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:00,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:00,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:00,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-12-02 22:12:01,000 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-02 22:12:01,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,035 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-02 22:12:01,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:01,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:01,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:01,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:64, output treesize:60 [2018-12-02 22:12:01,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, 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-02 22:12:01,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,381 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-02 22:12:01,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:01,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:01,439 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-02 22:12:01,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:71 [2018-12-02 22:12:01,584 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-02 22:12:01,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,604 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-02 22:12:01,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:01,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:01,664 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-02 22:12:01,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:71 [2018-12-02 22:12:01,805 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-02 22:12:01,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:01,825 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-02 22:12:01,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:01,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:01,877 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-02 22:12:01,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:71 [2018-12-02 22:12:02,015 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-02 22:12:02,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:02,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:02,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:02,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:02,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:02,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:02,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:02,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:02,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:02,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:02,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:02,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:02,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:02,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:02,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:02,035 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-02 22:12:02,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:02,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:02,095 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-02 22:12:02,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:71 [2018-12-02 22:12:02,672 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-02 22:12:02,674 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-02 22:12:02,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:02,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:02,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:02,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:13 [2018-12-02 22:12:02,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:02,719 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-02 22:12:02,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:02,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:02,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-02 22:12:02,736 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-02 22:12:02,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:12:02,758 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-02 22:12:02,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:02,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:02,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:12 [2018-12-02 22:12:03,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 22:12:03,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23] total 50 [2018-12-02 22:12:03,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-02 22:12:03,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-02 22:12:03,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3408, Unknown=6, NotChecked=0, Total=3660 [2018-12-02 22:12:03,172 INFO L87 Difference]: Start difference. First operand 232 states and 294 transitions. Second operand 51 states. [2018-12-02 22:12:10,997 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2018-12-02 22:12:12,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:12:12,870 INFO L93 Difference]: Finished difference Result 269 states and 329 transitions. [2018-12-02 22:12:12,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-02 22:12:12,870 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 70 [2018-12-02 22:12:12,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:12:12,871 INFO L225 Difference]: With dead ends: 269 [2018-12-02 22:12:12,871 INFO L226 Difference]: Without dead ends: 269 [2018-12-02 22:12:12,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 113 SyntacticMatches, 5 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2716 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=636, Invalid=8478, Unknown=6, NotChecked=0, Total=9120 [2018-12-02 22:12:12,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-12-02 22:12:12,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 235. [2018-12-02 22:12:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-12-02 22:12:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 299 transitions. [2018-12-02 22:12:12,875 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 299 transitions. Word has length 70 [2018-12-02 22:12:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:12:12,875 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 299 transitions. [2018-12-02 22:12:12,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-02 22:12:12,875 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 299 transitions. [2018-12-02 22:12:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 22:12:12,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:12:12,876 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-02 22:12:12,876 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:12:12,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:12,876 INFO L82 PathProgramCache]: Analyzing trace with hash 907133098, now seen corresponding path program 1 times [2018-12-02 22:12:12,876 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:12:12,876 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:12,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:12:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:13,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:13,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:12:13,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:13,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:13,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:12:13,190 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-02 22:12:13,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:12:16,014 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 58 [2018-12-02 22:12:16,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:12:16,036 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:16,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:12:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:16,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:16,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:12:16,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:16,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:16,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:12:16,098 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-02 22:12:16,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:12:16,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 22:12:16,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-12-02 22:12:16,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 22:12:16,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 22:12:16,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-12-02 22:12:16,873 INFO L87 Difference]: Start difference. First operand 235 states and 299 transitions. Second operand 11 states. [2018-12-02 22:12:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:12:17,735 INFO L93 Difference]: Finished difference Result 272 states and 329 transitions. [2018-12-02 22:12:17,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 22:12:17,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2018-12-02 22:12:17,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:12:17,736 INFO L225 Difference]: With dead ends: 272 [2018-12-02 22:12:17,736 INFO L226 Difference]: Without dead ends: 272 [2018-12-02 22:12:17,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2018-12-02 22:12:17,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-02 22:12:17,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 240. [2018-12-02 22:12:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-12-02 22:12:17,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 307 transitions. [2018-12-02 22:12:17,741 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 307 transitions. Word has length 70 [2018-12-02 22:12:17,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:12:17,742 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 307 transitions. [2018-12-02 22:12:17,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 22:12:17,742 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 307 transitions. [2018-12-02 22:12:17,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 22:12:17,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:12:17,742 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-02 22:12:17,743 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:12:17,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:17,743 INFO L82 PathProgramCache]: Analyzing trace with hash -104200024, now seen corresponding path program 2 times [2018-12-02 22:12:17,743 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:12:17,743 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:17,759 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 22:12:17,925 ERROR L235 seRefinementStrategy]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2018-12-02 22:12:17,925 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 22:12:17,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:17,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 22:12:17,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 22:12:17,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 22:12:17,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:17,997 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-02 22:12:17,998 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 22:12:18,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:12:18,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:12:18,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:12:18,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:12:18,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:12:18,014 INFO L87 Difference]: Start difference. First operand 240 states and 307 transitions. Second operand 5 states. [2018-12-02 22:12:18,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:12:18,033 INFO L93 Difference]: Finished difference Result 177 states and 201 transitions. [2018-12-02 22:12:18,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 22:12:18,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-02 22:12:18,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:12:18,034 INFO L225 Difference]: With dead ends: 177 [2018-12-02 22:12:18,034 INFO L226 Difference]: Without dead ends: 177 [2018-12-02 22:12:18,034 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-02 22:12:18,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-02 22:12:18,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 155. [2018-12-02 22:12:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-02 22:12:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2018-12-02 22:12:18,036 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 177 transitions. Word has length 70 [2018-12-02 22:12:18,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:12:18,036 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 177 transitions. [2018-12-02 22:12:18,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:12:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2018-12-02 22:12:18,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 22:12:18,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:12:18,037 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-02 22:12:18,037 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:12:18,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:18,037 INFO L82 PathProgramCache]: Analyzing trace with hash -531041507, now seen corresponding path program 1 times [2018-12-02 22:12:18,037 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:12:18,038 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:18,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:12:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:18,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:18,218 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-02 22:12:18,218 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 22:12:18,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:12:18,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:12:18,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:12:18,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:12:18,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:12:18,221 INFO L87 Difference]: Start difference. First operand 155 states and 177 transitions. Second operand 5 states. [2018-12-02 22:12:18,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:12:18,265 INFO L93 Difference]: Finished difference Result 165 states and 184 transitions. [2018-12-02 22:12:18,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 22:12:18,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-02 22:12:18,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:12:18,266 INFO L225 Difference]: With dead ends: 165 [2018-12-02 22:12:18,266 INFO L226 Difference]: Without dead ends: 161 [2018-12-02 22:12:18,266 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-02 22:12:18,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-02 22:12:18,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2018-12-02 22:12:18,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-02 22:12:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 166 transitions. [2018-12-02 22:12:18,268 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 166 transitions. Word has length 71 [2018-12-02 22:12:18,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:12:18,268 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 166 transitions. [2018-12-02 22:12:18,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:12:18,269 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 166 transitions. [2018-12-02 22:12:18,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 22:12:18,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:12:18,269 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-02 22:12:18,269 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:12:18,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:18,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1943645070, now seen corresponding path program 1 times [2018-12-02 22:12:18,269 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:12:18,270 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:18,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:12:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:18,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:18,680 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-02 22:12:18,682 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-02 22:12:18,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:18,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:18,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:18,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-02 22:12:18,721 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-02 22:12:18,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:18,724 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-02 22:12:18,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:18,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:18,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:18,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-12-02 22:12:18,786 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-02 22:12:18,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:18,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:18,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:18,790 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-02 22:12:18,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:18,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:18,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:18,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-12-02 22:12:18,869 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-02 22:12:18,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:18,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:18,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:18,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:18,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:18,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:18,879 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-02 22:12:18,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:18,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:18,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:18,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-12-02 22:12:19,001 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-02 22:12:19,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,009 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-02 22:12:19,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:19,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:19,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:19,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2018-12-02 22:12:19,146 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-02 22:12:19,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,190 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-02 22:12:19,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:19,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:19,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:19,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2018-12-02 22:12:19,382 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-02 22:12:19,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,438 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-02 22:12:19,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:19,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:19,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:19,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:76, output treesize:72 [2018-12-02 22:12:19,645 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-02 22:12:19,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,732 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-02 22:12:19,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:19,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:19,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:19,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:81 [2018-12-02 22:12:19,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 67 [2018-12-02 22:12:19,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:19,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:20,019 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-02 22:12:20,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:20,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:20,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:20,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:85 [2018-12-02 22:12:20,448 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-02 22:12:20,451 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-02 22:12:20,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:20,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:20,454 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-02 22:12:20,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:3 [2018-12-02 22:12:20,498 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-02 22:12:20,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:12:20,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:12:20,804 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:20,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:12:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:20,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:20,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:12:20,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:20,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:20,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:12:21,246 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-02 22:12:21,248 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-02 22:12:21,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:21,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:21,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:21,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-02 22:12:21,428 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-02 22:12:21,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:21,463 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-02 22:12:21,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02 22:12:21,468 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:21,475 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:21,488 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-02 22:12:21,488 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:27 [2018-12-02 22:12:21,494 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-02 22:12:21,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,500 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-02 22:12:21,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:21,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:21,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:21,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-12-02 22:12:21,541 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-02 22:12:21,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,552 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-02 22:12:21,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:21,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:21,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:21,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-12-02 22:12:21,699 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-02 22:12:21,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,711 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-02 22:12:21,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:21,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:21,746 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-02 22:12:21,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2018-12-02 22:12:21,880 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-02 22:12:21,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:21,892 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-02 22:12:21,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:21,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:21,931 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-02 22:12:21,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2018-12-02 22:12:22,101 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-02 22:12:22,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:22,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:22,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:22,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:22,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:22,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:22,126 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-02 22:12:22,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:22,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:22,161 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-02 22:12:22,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2018-12-02 22:12:22,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 52 treesize of output 41 [2018-12-02 22:12:22,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:22,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:22,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:22,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:22,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:22,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:22,323 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-02 22:12:22,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:22,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:22,358 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-02 22:12:22,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2018-12-02 22:12:22,497 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-02 22:12:22,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:22,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:22,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:22,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:22,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:22,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:22,528 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-02 22:12:22,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:22,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:22,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-02 22:12:22,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2018-12-02 22:12:23,122 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-02 22:12:23,123 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-02 22:12:23,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:23,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:23,125 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-02 22:12:23,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:3 [2018-12-02 22:12:23,136 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-02 22:12:23,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:12:23,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 22:12:23,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20] total 41 [2018-12-02 22:12:23,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-02 22:12:23,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-02 22:12:23,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1983, Unknown=0, NotChecked=0, Total=2162 [2018-12-02 22:12:23,237 INFO L87 Difference]: Start difference. First operand 148 states and 166 transitions. Second operand 42 states. [2018-12-02 22:12:29,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:12:29,662 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2018-12-02 22:12:29,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-02 22:12:29,663 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 71 [2018-12-02 22:12:29,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:12:29,663 INFO L225 Difference]: With dead ends: 161 [2018-12-02 22:12:29,663 INFO L226 Difference]: Without dead ends: 161 [2018-12-02 22:12:29,664 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-02 22:12:29,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-02 22:12:29,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 149. [2018-12-02 22:12:29,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-02 22:12:29,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 167 transitions. [2018-12-02 22:12:29,667 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 167 transitions. Word has length 71 [2018-12-02 22:12:29,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:12:29,667 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 167 transitions. [2018-12-02 22:12:29,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-02 22:12:29,667 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 167 transitions. [2018-12-02 22:12:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 22:12:29,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:12:29,668 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-02 22:12:29,668 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:12:29,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:29,668 INFO L82 PathProgramCache]: Analyzing trace with hash -123454967, now seen corresponding path program 1 times [2018-12-02 22:12:29,668 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:12:29,668 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:29,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:12:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:30,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:30,080 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-02 22:12:30,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 22:12:30,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-02 22:12:30,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 23 treesize of output 18 [2018-12-02 22:12:30,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,128 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-02 22:12:30,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-02 22:12:30,180 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-02 22:12:30,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-12-02 22:12:30,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-12-02 22:12:30,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 41 treesize of output 32 [2018-12-02 22:12:30,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,267 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-02 22:12:30,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-12-02 22:12:30,364 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-02 22:12:30,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,384 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-02 22:12:30,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-12-02 22:12:30,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 59 treesize of output 46 [2018-12-02 22:12:30,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,543 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-02 22:12:30,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:61 [2018-12-02 22:12:30,687 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-02 22:12:30,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,716 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-02 22:12:30,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2018-12-02 22:12:30,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 77 treesize of output 60 [2018-12-02 22:12:30,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:30,932 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-02 22:12:30,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:30,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:31,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:31,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:79 [2018-12-02 22:12:31,185 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-02 22:12:31,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,213 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-02 22:12:31,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:31,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:31,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:31,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:92, output treesize:88 [2018-12-02 22:12:31,468 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-02 22:12:31,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:31,647 INFO L303 Elim1Store]: Index analysis took 177 ms [2018-12-02 22:12:31,647 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-02 22:12:31,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:31,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:31,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:31,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:96, output treesize:92 [2018-12-02 22:12:32,115 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-02 22:12:32,118 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-02 22:12:32,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:32,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:32,120 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-02 22:12:32,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:3 [2018-12-02 22:12:32,167 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-02 22:12:32,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:12:32,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:12:32,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:32,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:12:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:32,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:32,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:12:32,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:32,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:32,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:12:32,994 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-02 22:12:32,996 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-02 22:12:32,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:32,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:33,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:33,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-02 22:12:33,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-12-02 22:12:33,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:33,176 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-02 22:12:33,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:33,178 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-02 22:12:33,179 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:33,183 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:33,190 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-02 22:12:33,190 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:45, output treesize:22 [2018-12-02 22:12:33,262 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-02 22:12:33,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:33,267 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-02 22:12:33,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:33,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:33,285 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-02 22:12:33,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-12-02 22:12:33,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 34 treesize of output 27 [2018-12-02 22:12:33,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:33,390 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-02 22:12:33,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:33,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:33,409 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-02 22:12:33,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-12-02 22:12:33,513 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-02 22:12:33,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:33,519 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-02 22:12:33,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:33,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:33,541 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-02 22:12:33,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-12-02 22:12:33,652 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-02 22:12:33,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:33,658 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-02 22:12:33,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:33,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:33,676 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-02 22:12:33,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-12-02 22:12:33,773 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-02 22:12:33,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:33,781 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-02 22:12:33,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:33,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:33,799 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-02 22:12:33,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-12-02 22:12:33,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, 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-02 22:12:33,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:33,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-02 22:12:33,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:33,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:33,920 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-02 22:12:33,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-12-02 22:12:34,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 34 treesize of output 27 [2018-12-02 22:12:34,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:34,034 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-02 22:12:34,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:34,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:34,055 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-02 22:12:34,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-12-02 22:12:34,478 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-02 22:12:34,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-02 22:12:34,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:34,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:34,482 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-02 22:12:34,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-12-02 22:12:34,490 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-02 22:12:34,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:12:34,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 22:12:34,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 16] total 42 [2018-12-02 22:12:34,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-02 22:12:34,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-02 22:12:34,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2072, Unknown=0, NotChecked=0, Total=2256 [2018-12-02 22:12:34,591 INFO L87 Difference]: Start difference. First operand 149 states and 167 transitions. Second operand 43 states. [2018-12-02 22:12:41,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:12:41,929 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2018-12-02 22:12:41,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-02 22:12:41,930 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 72 [2018-12-02 22:12:41,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:12:41,931 INFO L225 Difference]: With dead ends: 160 [2018-12-02 22:12:41,931 INFO L226 Difference]: Without dead ends: 160 [2018-12-02 22:12:41,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 131 SyntacticMatches, 8 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2063 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=512, Invalid=6130, Unknown=0, NotChecked=0, Total=6642 [2018-12-02 22:12:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-02 22:12:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 150. [2018-12-02 22:12:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-02 22:12:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 168 transitions. [2018-12-02 22:12:41,934 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 168 transitions. Word has length 72 [2018-12-02 22:12:41,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:12:41,934 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 168 transitions. [2018-12-02 22:12:41,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-02 22:12:41,934 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 168 transitions. [2018-12-02 22:12:41,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 22:12:41,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:12:41,935 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-02 22:12:41,935 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:12:41,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:41,936 INFO L82 PathProgramCache]: Analyzing trace with hash -206187708, now seen corresponding path program 1 times [2018-12-02 22:12:41,936 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:12:41,936 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:41,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:12:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:42,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:42,152 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-02 22:12:42,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:12:42,200 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-02 22:12:42,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:12:42,203 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:42,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:12:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:42,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:42,256 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-02 22:12:42,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:12:42,330 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-02 22:12:42,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 22:12:42,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 7] total 13 [2018-12-02 22:12:42,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 22:12:42,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 22:12:42,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-12-02 22:12:42,355 INFO L87 Difference]: Start difference. First operand 150 states and 168 transitions. Second operand 13 states. [2018-12-02 22:12:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:12:42,502 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2018-12-02 22:12:42,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 22:12:42,503 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2018-12-02 22:12:42,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:12:42,503 INFO L225 Difference]: With dead ends: 158 [2018-12-02 22:12:42,504 INFO L226 Difference]: Without dead ends: 158 [2018-12-02 22:12:42,504 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-02 22:12:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-02 22:12:42,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2018-12-02 22:12:42,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-02 22:12:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2018-12-02 22:12:42,506 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 73 [2018-12-02 22:12:42,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:12:42,507 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2018-12-02 22:12:42,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 22:12:42,507 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2018-12-02 22:12:42,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 22:12:42,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:12:42,507 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-02 22:12:42,508 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:12:42,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:42,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1166492377, now seen corresponding path program 2 times [2018-12-02 22:12:42,508 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:12:42,508 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:42,530 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 22:12:42,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 22:12:42,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 22:12:42,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:42,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:12:42,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:42,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:12:42,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:42,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:42,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 22:12:43,960 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 22:12:43,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:43,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 22:12:43,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:43,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:43,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:43,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 22:12:43,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:43,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:43,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 22:12:44,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:44,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 22:12:44,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:44,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:44,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:44,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 22:12:44,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:44,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:44,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 22:12:44,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:44,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 22:12:44,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:44,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:44,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:44,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 22:12:44,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:44,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:44,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 22:12:44,198 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-02 22:12:44,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:12:44,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:12:44,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:44,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 22:12:44,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 22:12:44,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 22:12:44,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:44,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:12:44,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:44,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:12:44,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:44,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:44,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 22:12:44,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:44,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:44,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 22:12:44,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:44,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 22:12:44,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:44,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:44,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 22:12:44,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:44,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:44,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 22:12:44,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:44,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 22:12:44,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:44,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:44,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 22:12:44,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:44,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 22:12:44,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:44,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:44,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:44,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 22:12:44,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:44,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:44,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 22:12:44,806 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-02 22:12:44,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:12:45,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 22:12:45,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-12-02 22:12:45,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 22:12:45,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 22:12:45,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2018-12-02 22:12:45,048 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand 16 states. [2018-12-02 22:12:46,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:12:46,107 INFO L93 Difference]: Finished difference Result 187 states and 206 transitions. [2018-12-02 22:12:46,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 22:12:46,107 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2018-12-02 22:12:46,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:12:46,108 INFO L225 Difference]: With dead ends: 187 [2018-12-02 22:12:46,108 INFO L226 Difference]: Without dead ends: 187 [2018-12-02 22:12:46,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 139 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=78, Invalid=477, Unknown=1, NotChecked=44, Total=600 [2018-12-02 22:12:46,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-02 22:12:46,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 155. [2018-12-02 22:12:46,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-02 22:12:46,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 172 transitions. [2018-12-02 22:12:46,111 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 172 transitions. Word has length 76 [2018-12-02 22:12:46,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:12:46,112 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 172 transitions. [2018-12-02 22:12:46,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 22:12:46,112 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 172 transitions. [2018-12-02 22:12:46,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 22:12:46,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:12:46,112 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-02 22:12:46,113 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:12:46,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:46,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1354856233, now seen corresponding path program 2 times [2018-12-02 22:12:46,113 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:12:46,113 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:46,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 22:12:46,304 ERROR L235 seRefinementStrategy]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2018-12-02 22:12:46,304 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 22:12:46,304 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:46,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 22:12:46,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 22:12:46,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 22:12:46,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:46,414 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-02 22:12:46,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-12-02 22:12:46,482 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-02 22:12:46,484 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-02 22:12:46,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-02 22:12:46,542 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-02 22:12:46,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,560 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-02 22:12:46,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:46,562 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-02 22:12:46,562 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,566 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,572 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-02 22:12:46,573 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:26 [2018-12-02 22:12:46,600 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-02 22:12:46,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:46,605 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-02 22:12:46,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,625 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-02 22:12:46,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-12-02 22:12:46,654 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-02 22:12:46,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:46,659 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-02 22:12:46,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,680 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-02 22:12:46,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-12-02 22:12:46,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, 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-02 22:12:46,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:46,712 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-02 22:12:46,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,733 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-02 22:12:46,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-12-02 22:12:46,762 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-02 22:12:46,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:46,767 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-02 22:12:46,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,788 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-02 22:12:46,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-12-02 22:12:46,816 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-02 22:12:46,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:46,821 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-02 22:12:46,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,844 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-02 22:12:46,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-12-02 22:12:46,873 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-02 22:12:46,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:46,879 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-02 22:12:46,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,898 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-02 22:12:46,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-12-02 22:12:46,926 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-02 22:12:46,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:46,931 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-02 22:12:46,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:46,952 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-02 22:12:46,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-12-02 22:12:47,078 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-02 22:12:47,079 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-02 22:12:47,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:47,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:47,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:47,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:13 [2018-12-02 22:12:47,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:12:47,111 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-02 22:12:47,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:47,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:47,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-02 22:12:47,148 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-02 22:12:47,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:12:47,223 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-02 22:12:47,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:47,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:47,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:12 [2018-12-02 22:12:47,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-02 22:12:47,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-12-02 22:12:47,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 22:12:47,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 22:12:47,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2018-12-02 22:12:47,530 INFO L87 Difference]: Start difference. First operand 155 states and 172 transitions. Second operand 18 states. [2018-12-02 22:12:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:12:49,298 INFO L93 Difference]: Finished difference Result 174 states and 188 transitions. [2018-12-02 22:12:49,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 22:12:49,298 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75 [2018-12-02 22:12:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:12:49,299 INFO L225 Difference]: With dead ends: 174 [2018-12-02 22:12:49,299 INFO L226 Difference]: Without dead ends: 174 [2018-12-02 22:12:49,299 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-02 22:12:49,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-02 22:12:49,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2018-12-02 22:12:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-02 22:12:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 177 transitions. [2018-12-02 22:12:49,301 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 177 transitions. Word has length 75 [2018-12-02 22:12:49,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:12:49,302 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 177 transitions. [2018-12-02 22:12:49,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 22:12:49,302 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 177 transitions. [2018-12-02 22:12:49,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 22:12:49,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:12:49,302 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-02 22:12:49,302 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:12:49,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:49,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1354856232, now seen corresponding path program 2 times [2018-12-02 22:12:49,303 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:12:49,303 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:49,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 22:12:49,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 22:12:49,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 22:12:49,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:49,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:12:49,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:49,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:49,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:12:49,664 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-02 22:12:49,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:12:52,639 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 62 [2018-12-02 22:12:52,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:12:52,657 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:52,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 22:12:52,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 22:12:52,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 22:12:52,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:52,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:12:52,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:52,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:52,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:12:52,730 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-02 22:12:52,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:12:53,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 22:12:53,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-02 22:12:53,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 22:12:53,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 22:12:53,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-12-02 22:12:53,070 INFO L87 Difference]: Start difference. First operand 158 states and 177 transitions. Second operand 12 states. [2018-12-02 22:12:54,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:12:54,046 INFO L93 Difference]: Finished difference Result 174 states and 188 transitions. [2018-12-02 22:12:54,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 22:12:54,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2018-12-02 22:12:54,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:12:54,048 INFO L225 Difference]: With dead ends: 174 [2018-12-02 22:12:54,048 INFO L226 Difference]: Without dead ends: 174 [2018-12-02 22:12:54,048 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-02 22:12:54,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-02 22:12:54,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2018-12-02 22:12:54,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-02 22:12:54,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions. [2018-12-02 22:12:54,052 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 75 [2018-12-02 22:12:54,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:12:54,052 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions. [2018-12-02 22:12:54,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 22:12:54,053 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2018-12-02 22:12:54,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 22:12:54,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:12:54,053 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-02 22:12:54,054 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:12:54,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:54,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1933234001, now seen corresponding path program 1 times [2018-12-02 22:12:54,054 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:12:54,054 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:54,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:12:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:54,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:54,275 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-02 22:12:54,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:12:54,377 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-02 22:12:54,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:12:54,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:54,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:12:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:12:54,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:54,429 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-02 22:12:54,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:12:54,493 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-02 22:12:54,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 22:12:54,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-02 22:12:54,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 22:12:54,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 22:12:54,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 22:12:54,509 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand 9 states. [2018-12-02 22:12:54,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:12:54,584 INFO L93 Difference]: Finished difference Result 175 states and 192 transitions. [2018-12-02 22:12:54,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 22:12:54,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2018-12-02 22:12:54,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:12:54,585 INFO L225 Difference]: With dead ends: 175 [2018-12-02 22:12:54,586 INFO L226 Difference]: Without dead ends: 171 [2018-12-02 22:12:54,586 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-02 22:12:54,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-02 22:12:54,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2018-12-02 22:12:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-02 22:12:54,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 180 transitions. [2018-12-02 22:12:54,588 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 180 transitions. Word has length 76 [2018-12-02 22:12:54,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:12:54,588 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 180 transitions. [2018-12-02 22:12:54,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 22:12:54,589 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 180 transitions. [2018-12-02 22:12:54,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 22:12:54,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:12:54,589 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-02 22:12:54,589 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:12:54,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:54,590 INFO L82 PathProgramCache]: Analyzing trace with hash 949129732, now seen corresponding path program 2 times [2018-12-02 22:12:54,590 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:12:54,590 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:54,612 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 22:12:54,803 ERROR L235 seRefinementStrategy]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2018-12-02 22:12:54,804 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 22:12:54,804 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:54,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 22:12:54,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 22:12:54,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 22:12:54,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:54,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:12:54,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:54,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:54,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:12:55,005 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-02 22:12:55,006 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-02 22:12:55,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:20 [2018-12-02 22:12:55,043 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-02 22:12:55,047 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-02 22:12:55,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,064 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-02 22:12:55,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-02 22:12:55,093 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-02 22:12:55,096 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-02 22:12:55,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,111 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-02 22:12:55,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-02 22:12:55,141 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-02 22:12:55,144 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-02 22:12:55,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,160 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-02 22:12:55,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-02 22:12:55,188 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-02 22:12:55,192 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-02 22:12:55,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,209 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-02 22:12:55,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-02 22:12:55,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, 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-02 22:12:55,243 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-02 22:12:55,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,262 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-02 22:12:55,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-02 22:12:55,290 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-02 22:12:55,294 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-02 22:12:55,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,310 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-02 22:12:55,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-02 22:12:55,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-02 22:12:55,341 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-02 22:12:55,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,358 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-02 22:12:55,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-02 22:12:55,552 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-02 22:12:55,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,558 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-02 22:12:55,559 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-02 22:12:55,559 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,560 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:55,561 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-02 22:12:55,561 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2018-12-02 22:12:55,593 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-02 22:12:55,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:12:56,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-02 22:12:56,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-12-02 22:12:56,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 22:12:56,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 22:12:56,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=494, Unknown=2, NotChecked=0, Total=552 [2018-12-02 22:12:56,265 INFO L87 Difference]: Start difference. First operand 159 states and 180 transitions. Second operand 18 states. [2018-12-02 22:12:58,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:12:58,074 INFO L93 Difference]: Finished difference Result 174 states and 191 transitions. [2018-12-02 22:12:58,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 22:12:58,075 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 76 [2018-12-02 22:12:58,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:12:58,076 INFO L225 Difference]: With dead ends: 174 [2018-12-02 22:12:58,076 INFO L226 Difference]: Without dead ends: 174 [2018-12-02 22:12:58,076 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-02 22:12:58,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-02 22:12:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 160. [2018-12-02 22:12:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-02 22:12:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 181 transitions. [2018-12-02 22:12:58,078 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 181 transitions. Word has length 76 [2018-12-02 22:12:58,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:12:58,078 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 181 transitions. [2018-12-02 22:12:58,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 22:12:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 181 transitions. [2018-12-02 22:12:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 22:12:58,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:12:58,079 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-02 22:12:58,079 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:12:58,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:12:58,079 INFO L82 PathProgramCache]: Analyzing trace with hash -641749321, now seen corresponding path program 2 times [2018-12-02 22:12:58,079 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:12:58,080 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:58,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 22:12:58,295 ERROR L235 seRefinementStrategy]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2018-12-02 22:12:58,295 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 22:12:58,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:12:58,303 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 22:12:58,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 22:12:58,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 22:12:58,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:12:58,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:12:58,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:58,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:58,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:12:58,504 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-02 22:12:58,506 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-02 22:12:58,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:58,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:58,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:58,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:20 [2018-12-02 22:12:58,542 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-02 22:12:58,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-02 22:12:58,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:58,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:58,564 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-02 22:12:58,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-02 22:12:58,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 25 treesize of output 20 [2018-12-02 22:12:58,595 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-02 22:12:58,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:58,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:58,614 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-02 22:12:58,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-02 22:12:58,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 25 treesize of output 20 [2018-12-02 22:12:58,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, 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-02 22:12:58,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:58,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:58,665 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-02 22:12:58,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-02 22:12:58,692 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-02 22:12:58,696 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-02 22:12:58,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:58,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:58,713 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-02 22:12:58,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-02 22:12:58,740 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-02 22:12:58,744 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-02 22:12:58,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:58,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:58,760 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-02 22:12:58,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-02 22:12:58,791 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-02 22:12:58,796 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-02 22:12:58,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:58,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:58,816 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-02 22:12:58,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-02 22:12:58,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-02 22:12:58,851 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-02 22:12:58,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:58,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:58,868 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-02 22:12:58,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-02 22:12:59,103 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-02 22:12:59,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:59,110 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-02 22:12:59,111 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-02 22:12:59,111 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 22:12:59,113 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:12:59,115 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-02 22:12:59,115 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2018-12-02 22:12:59,148 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-02 22:12:59,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:12:59,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-02 22:12:59,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-12-02 22:12:59,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 22:12:59,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 22:12:59,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=494, Unknown=2, NotChecked=0, Total=552 [2018-12-02 22:12:59,761 INFO L87 Difference]: Start difference. First operand 160 states and 181 transitions. Second operand 18 states. [2018-12-02 22:13:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:13:01,763 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2018-12-02 22:13:01,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 22:13:01,764 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-12-02 22:13:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:13:01,765 INFO L225 Difference]: With dead ends: 173 [2018-12-02 22:13:01,765 INFO L226 Difference]: Without dead ends: 173 [2018-12-02 22:13:01,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=164, Invalid=1316, Unknown=2, NotChecked=0, Total=1482 [2018-12-02 22:13:01,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-02 22:13:01,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 161. [2018-12-02 22:13:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-02 22:13:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 182 transitions. [2018-12-02 22:13:01,767 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 182 transitions. Word has length 77 [2018-12-02 22:13:01,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:13:01,768 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 182 transitions. [2018-12-02 22:13:01,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 22:13:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 182 transitions. [2018-12-02 22:13:01,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 22:13:01,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:13:01,768 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-02 22:13:01,768 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:13:01,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:13:01,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1579213306, now seen corresponding path program 1 times [2018-12-02 22:13:01,769 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:13:01,769 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:13:01,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:13:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:13:01,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:13:01,981 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-02 22:13:01,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:13:02,096 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-02 22:13:02,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:13:02,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:13:02,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:13:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:13:02,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:13:02,157 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-02 22:13:02,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:13:02,202 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-02 22:13:02,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 22:13:02,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7] total 11 [2018-12-02 22:13:02,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 22:13:02,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 22:13:02,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-02 22:13:02,218 INFO L87 Difference]: Start difference. First operand 161 states and 182 transitions. Second operand 11 states. [2018-12-02 22:13:02,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:13:02,355 INFO L93 Difference]: Finished difference Result 187 states and 203 transitions. [2018-12-02 22:13:02,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 22:13:02,356 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2018-12-02 22:13:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:13:02,357 INFO L225 Difference]: With dead ends: 187 [2018-12-02 22:13:02,357 INFO L226 Difference]: Without dead ends: 183 [2018-12-02 22:13:02,358 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-02 22:13:02,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-02 22:13:02,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 166. [2018-12-02 22:13:02,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-02 22:13:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 190 transitions. [2018-12-02 22:13:02,361 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 190 transitions. Word has length 78 [2018-12-02 22:13:02,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:13:02,361 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 190 transitions. [2018-12-02 22:13:02,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 22:13:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 190 transitions. [2018-12-02 22:13:02,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 22:13:02,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:13:02,362 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-02 22:13:02,363 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:13:02,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:13:02,363 INFO L82 PathProgramCache]: Analyzing trace with hash 329587573, now seen corresponding path program 1 times [2018-12-02 22:13:02,363 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:13:02,363 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:13:02,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:13:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:13:02,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:13:02,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:13:02,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:02,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:13:02,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:13:02,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 15 treesize of output 12 [2018-12-02 22:13:02,711 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-02 22:13:02,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:02,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:13:02,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-02 22:13:02,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2018-12-02 22:13:02,879 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-02 22:13:02,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:02,883 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-02 22:13:02,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:02,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:13:02,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:18, output treesize:3 [2018-12-02 22:13:02,922 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-02 22:13:02,923 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-02 22:13:02,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:02,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:13:02,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:13:02,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:11 [2018-12-02 22:13:02,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:13:02,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 22:13:02,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 22:13:02,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 22:13:02,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:28 [2018-12-02 22:13:02,974 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-02 22:13:02,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:13:02,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:13:02,979 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-02 22:13:02,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:02,989 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-02 22:13:02,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:11 [2018-12-02 22:13:03,098 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-02 22:13:03,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:13:03,319 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-02 22:13:03,444 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-02 22:13:03,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:03,448 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-02 22:13:03,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:6 [2018-12-02 22:13:03,669 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-02 22:13:03,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:03,679 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-02 22:13:03,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:36 [2018-12-02 22:13:03,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-12-02 22:13:03,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:03,827 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-02 22:13:03,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:03,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 22:13:03,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:22 [2018-12-02 22:13:04,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:13:04,051 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:13:04,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:13:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:13:04,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:13:04,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:13:04,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:04,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:13:04,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:13:04,117 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-02 22:13:04,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 22:13:04,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:04,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:13:04,140 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-02 22:13:04,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2018-12-02 22:13:04,143 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-02 22:13:04,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:04,147 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-02 22:13:04,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:04,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:13:04,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:3 [2018-12-02 22:13:04,150 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-02 22:13:04,152 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-02 22:13:04,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:04,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:13:04,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:13:04,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:11 [2018-12-02 22:13:04,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:13:04,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 22:13:04,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 22:13:04,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 22:13:04,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:28 [2018-12-02 22:13:04,181 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-02 22:13:04,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:13:04,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:13:04,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 22:13:04,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:04,195 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-02 22:13:04,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:11 [2018-12-02 22:13:04,233 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-02 22:13:04,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:13:04,445 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-02 22:13:04,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:04,449 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-02 22:13:04,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-02 22:13:04,503 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-02 22:13:04,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:04,514 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-02 22:13:04,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:36 [2018-12-02 22:13:06,593 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-02 22:13:06,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:06,594 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-02 22:13:06,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:06,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 22:13:06,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:22 [2018-12-02 22:13:06,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 22:13:06,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-12-02 22:13:06,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 22:13:06,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 22:13:06,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=783, Unknown=3, NotChecked=114, Total=992 [2018-12-02 22:13:06,696 INFO L87 Difference]: Start difference. First operand 166 states and 190 transitions. Second operand 19 states. [2018-12-02 22:13:10,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:13:10,190 INFO L93 Difference]: Finished difference Result 183 states and 204 transitions. [2018-12-02 22:13:10,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 22:13:10,190 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 80 [2018-12-02 22:13:10,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:13:10,191 INFO L225 Difference]: With dead ends: 183 [2018-12-02 22:13:10,191 INFO L226 Difference]: Without dead ends: 183 [2018-12-02 22:13:10,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 181 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=152, Invalid=1259, Unknown=3, NotChecked=146, Total=1560 [2018-12-02 22:13:10,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-02 22:13:10,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 174. [2018-12-02 22:13:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-02 22:13:10,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 200 transitions. [2018-12-02 22:13:10,194 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 200 transitions. Word has length 80 [2018-12-02 22:13:10,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:13:10,194 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 200 transitions. [2018-12-02 22:13:10,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 22:13:10,194 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 200 transitions. [2018-12-02 22:13:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 22:13:10,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:13:10,195 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-02 22:13:10,195 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:13:10,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:13:10,195 INFO L82 PathProgramCache]: Analyzing trace with hash 329587574, now seen corresponding path program 1 times [2018-12-02 22:13:10,196 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:13:10,196 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:13:10,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:13:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:13:10,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:13:10,531 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-02 22:13:10,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:13:10,818 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-02 22:13:10,819 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-02 22:13:10,852 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-02 22:13:10,853 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-02 22:13:10,876 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-02 22:13:10,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-12-02 22:13:11,112 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-02 22:13:11,113 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-02 22:13:11,162 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-02 22:13:11,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:54 [2018-12-02 22:13:11,380 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-12-02 22:13:11,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:13:11,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:13:11,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:13:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:13:11,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:13:11,517 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-02 22:13:11,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:13:11,595 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-02 22:13:11,596 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-02 22:13:11,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 22:13:11,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2018-12-02 22:13:12,278 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-02 22:13:12,278 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-02 22:13:12,360 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-02 22:13:12,360 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-02 22:13:12,434 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-02 22:13:12,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:83 [2018-12-02 22:13:12,713 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2018-12-02 22:13:12,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 22:13:12,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-12-02 22:13:12,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 22:13:12,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 22:13:12,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-12-02 22:13:12,732 INFO L87 Difference]: Start difference. First operand 174 states and 200 transitions. Second operand 12 states. [2018-12-02 22:13:13,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:13:13,607 INFO L93 Difference]: Finished difference Result 201 states and 230 transitions. [2018-12-02 22:13:13,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 22:13:13,607 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 80 [2018-12-02 22:13:13,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:13:13,608 INFO L225 Difference]: With dead ends: 201 [2018-12-02 22:13:13,608 INFO L226 Difference]: Without dead ends: 201 [2018-12-02 22:13:13,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2018-12-02 22:13:13,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-02 22:13:13,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2018-12-02 22:13:13,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-02 22:13:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 225 transitions. [2018-12-02 22:13:13,611 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 225 transitions. Word has length 80 [2018-12-02 22:13:13,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:13:13,611 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 225 transitions. [2018-12-02 22:13:13,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 22:13:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 225 transitions. [2018-12-02 22:13:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 22:13:13,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:13:13,612 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-02 22:13:13,612 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:13:13,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:13:13,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1627280166, now seen corresponding path program 1 times [2018-12-02 22:13:13,612 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:13:13,613 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:13:13,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:13:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:13:13,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:13:13,859 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-02 22:13:13,860 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-02 22:13:13,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:13,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:13:13,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:13:13,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 22:13:13,952 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-02 22:13:13,953 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-02 22:13:13,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:13,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:13:13,955 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-02 22:13:13,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-02 22:13:13,970 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-02 22:13:13,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:13:14,168 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-02 22:13:14,171 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-02 22:13:14,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:14,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:13:14,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 22:13:14,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2018-12-02 22:13:14,339 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-02 22:13:14,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:13:14,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:13:14,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:13:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:13:14,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:13:14,398 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-02 22:13:14,399 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-02 22:13:14,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:14,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:13:14,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:13:14,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 22:13:14,446 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-02 22:13:14,447 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-02 22:13:14,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:14,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:13:14,449 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-02 22:13:14,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-02 22:13:14,453 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-02 22:13:14,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:13:14,553 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-02 22:13:14,555 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-02 22:13:14,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:13:14,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:13:14,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 22:13:14,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2018-12-02 22:13:14,595 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-02 22:13:14,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 22:13:14,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 13, 10] total 19 [2018-12-02 22:13:14,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 22:13:14,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 22:13:14,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-12-02 22:13:14,621 INFO L87 Difference]: Start difference. First operand 190 states and 225 transitions. Second operand 20 states. [2018-12-02 22:13:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:13:19,575 INFO L93 Difference]: Finished difference Result 217 states and 240 transitions. [2018-12-02 22:13:19,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 22:13:19,576 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 81 [2018-12-02 22:13:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:13:19,576 INFO L225 Difference]: With dead ends: 217 [2018-12-02 22:13:19,576 INFO L226 Difference]: Without dead ends: 217 [2018-12-02 22:13:19,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 301 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=800, Unknown=0, NotChecked=0, Total=930 [2018-12-02 22:13:19,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-02 22:13:19,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 196. [2018-12-02 22:13:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-02 22:13:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 229 transitions. [2018-12-02 22:13:19,579 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 229 transitions. Word has length 81 [2018-12-02 22:13:19,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:13:19,579 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 229 transitions. [2018-12-02 22:13:19,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 22:13:19,579 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 229 transitions. [2018-12-02 22:13:19,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 22:13:19,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:13:19,579 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-02 22:13:19,579 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:13:19,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:13:19,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1454527127, now seen corresponding path program 3 times [2018-12-02 22:13:19,580 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:13:19,580 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:13:19,601 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-02 22:13:19,663 ERROR L235 seRefinementStrategy]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2018-12-02 22:13:19,663 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 22:13:19,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:13:19,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 22:14:06,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-02 22:14:06,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 22:14:06,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:14:06,427 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-02 22:14:06,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:14:06,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:14:06,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-12-02 22:14:06,522 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-02 22:14:06,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 10 treesize of output 9 [2018-12-02 22:14:06,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:14:06,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:14:06,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:14:06,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:24 [2018-12-02 22:14:06,565 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-02 22:14:06,568 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-02 22:14:06,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:14:06,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:14:06,586 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-02 22:14:06,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-02 22:14:06,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, 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-02 22:14:06,616 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-02 22:14:06,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:14:06,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:14:06,634 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-02 22:14:06,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-02 22:14:06,661 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-02 22:14:06,664 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-02 22:14:06,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:14:06,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:14:06,684 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-02 22:14:06,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-02 22:14:06,713 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-02 22:14:06,717 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-02 22:14:06,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:14:06,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:14:06,745 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-02 22:14:06,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-02 22:14:06,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, 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-02 22:14:06,798 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-02 22:14:06,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:14:06,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:14:06,829 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-02 22:14:06,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-02 22:14:06,877 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-02 22:14:06,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02 22:14:06,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:14:06,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:14:06,910 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-02 22:14:06,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-02 22:14:06,942 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-02 22:14:06,946 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-02 22:14:06,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:14:06,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:14:06,964 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-02 22:14:06,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-02 22:14:07,242 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-02 22:14:07,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:14:07,249 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-02 22:14:07,250 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-02 22:14:07,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 22:14:07,252 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:14:07,256 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-02 22:14:07,256 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:36, output treesize:13 [2018-12-02 22:14:07,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:14:07,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02 22:14:07,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:14:07,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:14:07,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-02 22:14:07,323 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-02 22:14:07,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:14:07,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-02 22:14:07,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:14:07,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:14:07,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:32 [2018-12-02 22:14:08,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-02 22:14:08,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-12-02 22:14:08,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 22:14:08,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 22:14:08,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=635, Unknown=1, NotChecked=0, Total=702 [2018-12-02 22:14:08,138 INFO L87 Difference]: Start difference. First operand 196 states and 229 transitions. Second operand 19 states. [2018-12-02 22:14:10,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:14:10,185 INFO L93 Difference]: Finished difference Result 215 states and 245 transitions. [2018-12-02 22:14:10,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 22:14:10,186 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 80 [2018-12-02 22:14:10,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:14:10,187 INFO L225 Difference]: With dead ends: 215 [2018-12-02 22:14:10,187 INFO L226 Difference]: Without dead ends: 215 [2018-12-02 22:14:10,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=200, Invalid=1691, Unknown=1, NotChecked=0, Total=1892 [2018-12-02 22:14:10,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-02 22:14:10,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 199. [2018-12-02 22:14:10,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-02 22:14:10,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 234 transitions. [2018-12-02 22:14:10,189 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 234 transitions. Word has length 80 [2018-12-02 22:14:10,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:14:10,189 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 234 transitions. [2018-12-02 22:14:10,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 22:14:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 234 transitions. [2018-12-02 22:14:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 22:14:10,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:14:10,189 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-02 22:14:10,190 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:14:10,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:14:10,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1454527126, now seen corresponding path program 3 times [2018-12-02 22:14:10,190 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:14:10,190 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:14:10,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 22:14:10,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 22:14:10,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 22:14:10,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:14:10,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:14:10,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:14:10,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:14:10,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:14:10,522 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-02 22:14:10,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:14:11,031 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-12-02 22:14:12,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:14:12,036 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:14:12,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 22:14:12,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 22:14:12,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 22:14:12,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:14:12,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 22:14:12,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 22:14:12,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:14:12,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 22:14:12,140 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-02 22:14:12,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:14:13,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 22:14:13,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-12-02 22:14:13,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 22:14:13,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 22:14:13,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2018-12-02 22:14:13,954 INFO L87 Difference]: Start difference. First operand 199 states and 234 transitions. Second operand 13 states. [2018-12-02 22:14:15,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:14:15,042 INFO L93 Difference]: Finished difference Result 215 states and 245 transitions. [2018-12-02 22:14:15,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 22:14:15,042 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-12-02 22:14:15,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:14:15,043 INFO L225 Difference]: With dead ends: 215 [2018-12-02 22:14:15,043 INFO L226 Difference]: Without dead ends: 215 [2018-12-02 22:14:15,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 189 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 22:14:15,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-02 22:14:15,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 199. [2018-12-02 22:14:15,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-02 22:14:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 233 transitions. [2018-12-02 22:14:15,045 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 233 transitions. Word has length 80 [2018-12-02 22:14:15,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:14:15,045 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 233 transitions. [2018-12-02 22:14:15,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 22:14:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 233 transitions. [2018-12-02 22:14:15,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 22:14:15,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:14:15,046 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-02 22:14:15,046 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-02 22:14:15,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:14:15,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1093922347, now seen corresponding path program 1 times [2018-12-02 22:14:15,046 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 22:14:15,046 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/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-02 22:14:15,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:14:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:14:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:14:16,532 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 22:14:16,555 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 22:14:16,556 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 22:14:16,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 10:14:16 BoogieIcfgContainer [2018-12-02 22:14:16,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 22:14:16,574 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 22:14:16,574 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 22:14:16,574 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 22:14:16,574 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:09:02" (3/4) ... [2018-12-02 22:14:16,576 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 22:14:16,590 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 22:14:16,590 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 22:14:16,632 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8bdbfc98-49d6-4c1c-ad5c-f1db4962cf34/bin-2019/utaipan/witness.graphml [2018-12-02 22:14:16,632 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 22:14:16,633 INFO L168 Benchmark]: Toolchain (without parser) took 315052.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -174.9 MB). Peak memory consumption was 301.2 MB. Max. memory is 11.5 GB. [2018-12-02 22:14:16,633 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:14:16,633 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-12-02 22:14:16,633 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.10 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:14:16,633 INFO L168 Benchmark]: Boogie Preprocessor took 19.12 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:14:16,633 INFO L168 Benchmark]: RCFGBuilder took 255.33 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: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2018-12-02 22:14:16,634 INFO L168 Benchmark]: TraceAbstraction took 314330.26 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 13.1 MB). Free memory was 1.0 GB in the beginning and 766.3 MB in the end (delta: 282.2 MB). Peak memory consumption was 295.3 MB. Max. memory is 11.5 GB. [2018-12-02 22:14:16,634 INFO L168 Benchmark]: Witness Printer took 58.55 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -4.2 MB). Free memory was 766.3 MB in the beginning and 1.1 GB in the end (delta: -346.5 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2018-12-02 22:14:16,635 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.20 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 363.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.10 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.12 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 255.33 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: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 314330.26 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 13.1 MB). Free memory was 1.0 GB in the beginning and 766.3 MB in the end (delta: 282.2 MB). Peak memory consumption was 295.3 MB. Max. memory is 11.5 GB. * Witness Printer took 58.55 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -4.2 MB). Free memory was 766.3 MB in the beginning and 1.1 GB in the end (delta: -346.5 MB). Peak memory consumption was 1.6 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