./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.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_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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 976e1955e162f3b4e872a15f7e9a64e265f0afc5 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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 976e1955e162f3b4e872a15f7e9a64e265f0afc5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 01:05:08,532 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 01:05:08,533 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 01:05:08,539 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 01:05:08,540 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 01:05:08,540 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 01:05:08,541 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 01:05:08,542 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 01:05:08,543 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 01:05:08,543 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 01:05:08,544 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 01:05:08,544 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 01:05:08,544 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 01:05:08,545 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 01:05:08,545 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 01:05:08,546 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 01:05:08,546 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 01:05:08,547 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 01:05:08,548 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 01:05:08,549 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 01:05:08,549 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 01:05:08,550 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 01:05:08,551 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 01:05:08,551 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 01:05:08,551 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 01:05:08,552 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 01:05:08,552 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 01:05:08,552 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 01:05:08,553 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 01:05:08,553 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 01:05:08,553 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 01:05:08,554 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 01:05:08,554 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 01:05:08,554 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 01:05:08,555 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 01:05:08,555 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 01:05:08,555 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-03 01:05:08,563 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 01:05:08,563 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 01:05:08,563 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 01:05:08,563 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 01:05:08,563 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 01:05:08,564 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 01:05:08,564 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 01:05:08,564 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 01:05:08,564 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 01:05:08,564 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 01:05:08,564 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 01:05:08,564 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 01:05:08,564 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 01:05:08,565 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 01:05:08,565 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 01:05:08,565 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 01:05:08,565 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 01:05:08,565 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 01:05:08,565 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 01:05:08,565 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 01:05:08,566 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 01:05:08,566 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 01:05:08,566 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 01:05:08,566 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 01:05:08,566 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 01:05:08,566 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 01:05:08,566 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 01:05:08,566 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 01:05:08,566 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 01:05:08,567 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 01:05:08,567 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 01:05:08,567 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 01:05:08,567 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 01:05:08,567 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 01:05:08,567 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 01:05:08,567 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 01:05:08,567 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_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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 -> 976e1955e162f3b4e872a15f7e9a64e265f0afc5 [2018-12-03 01:05:08,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 01:05:08,595 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 01:05:08,598 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 01:05:08,599 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 01:05:08,599 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 01:05:08,600 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i [2018-12-03 01:05:08,641 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/data/c164db5ee/fe976dd4b85742e28d9a94d0c07104e9/FLAGba0868e1e [2018-12-03 01:05:09,113 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 01:05:09,113 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/sv-benchmarks/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i [2018-12-03 01:05:09,121 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/data/c164db5ee/fe976dd4b85742e28d9a94d0c07104e9/FLAGba0868e1e [2018-12-03 01:05:09,621 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/data/c164db5ee/fe976dd4b85742e28d9a94d0c07104e9 [2018-12-03 01:05:09,624 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 01:05:09,625 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 01:05:09,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 01:05:09,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 01:05:09,629 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 01:05:09,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:05:09" (1/1) ... [2018-12-03 01:05:09,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340b48b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:09, skipping insertion in model container [2018-12-03 01:05:09,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:05:09" (1/1) ... [2018-12-03 01:05:09,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 01:05:09,666 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 01:05:09,895 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:05:09,904 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 01:05:09,939 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:05:09,982 INFO L195 MainTranslator]: Completed translation [2018-12-03 01:05:09,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:09 WrapperNode [2018-12-03 01:05:09,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 01:05:09,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 01:05:09,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 01:05:09,983 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 01:05:09,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:09" (1/1) ... [2018-12-03 01:05:10,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:09" (1/1) ... [2018-12-03 01:05:10,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 01:05:10,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 01:05:10,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 01:05:10,006 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 01:05:10,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:09" (1/1) ... [2018-12-03 01:05:10,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:09" (1/1) ... [2018-12-03 01:05:10,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:09" (1/1) ... [2018-12-03 01:05:10,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:09" (1/1) ... [2018-12-03 01:05:10,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:09" (1/1) ... [2018-12-03 01:05:10,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:09" (1/1) ... [2018-12-03 01:05:10,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:09" (1/1) ... [2018-12-03 01:05:10,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 01:05:10,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 01:05:10,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 01:05:10,028 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 01:05:10,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:05:10,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 01:05:10,061 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-12-03 01:05:10,061 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-12-03 01:05:10,061 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2018-12-03 01:05:10,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2018-12-03 01:05:10,061 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-03 01:05:10,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-03 01:05:10,061 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2018-12-03 01:05:10,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2018-12-03 01:05:10,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2018-12-03 01:05:10,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2018-12-03 01:05:10,062 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_13 [2018-12-03 01:05:10,062 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_13 [2018-12-03 01:05:10,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 01:05:10,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 01:05:10,062 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 01:05:10,063 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 01:05:10,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 01:05:10,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 01:05:10,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 01:05:10,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-03 01:05:10,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2018-12-03 01:05:10,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2018-12-03 01:05:10,064 INFO L130 BoogieDeclarations]: Found specification of procedure free_13 [2018-12-03 01:05:10,064 INFO L138 BoogieDeclarations]: Found implementation of procedure free_13 [2018-12-03 01:05:10,064 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-03 01:05:10,064 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-03 01:05:10,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 01:05:10,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 01:05:10,293 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 01:05:10,293 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 01:05:10,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:05:10 BoogieIcfgContainer [2018-12-03 01:05:10,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 01:05:10,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 01:05:10,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 01:05:10,296 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 01:05:10,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 01:05:09" (1/3) ... [2018-12-03 01:05:10,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cbc971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:05:10, skipping insertion in model container [2018-12-03 01:05:10,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:09" (2/3) ... [2018-12-03 01:05:10,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cbc971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:05:10, skipping insertion in model container [2018-12-03 01:05:10,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:05:10" (3/3) ... [2018-12-03 01:05:10,298 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test13_true-valid-memsafety.i [2018-12-03 01:05:10,303 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 01:05:10,308 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-12-03 01:05:10,317 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2018-12-03 01:05:10,332 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 01:05:10,332 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 01:05:10,332 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 01:05:10,332 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 01:05:10,332 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 01:05:10,332 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 01:05:10,333 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 01:05:10,333 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 01:05:10,343 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2018-12-03 01:05:10,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 01:05:10,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:10,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:10,350 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:10,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:10,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1627156754, now seen corresponding path program 1 times [2018-12-03 01:05:10,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:10,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:10,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:10,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:10,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:05:10,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:10,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:05:10,486 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:10,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:05:10,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:05:10,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:05:10,499 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 5 states. [2018-12-03 01:05:10,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:10,523 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2018-12-03 01:05:10,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:05:10,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-03 01:05:10,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:10,531 INFO L225 Difference]: With dead ends: 106 [2018-12-03 01:05:10,531 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 01:05:10,532 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-03 01:05:10,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 01:05:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-12-03 01:05:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 01:05:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-12-03 01:05:10,556 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 17 [2018-12-03 01:05:10,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:10,556 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-12-03 01:05:10,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:05:10,556 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-12-03 01:05:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 01:05:10,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:10,557 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:10,557 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:10,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:10,557 INFO L82 PathProgramCache]: Analyzing trace with hash -115653581, now seen corresponding path program 1 times [2018-12-03 01:05:10,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:10,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:10,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:10,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:10,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:10,631 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-03 01:05:10,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:10,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:05:10,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:10,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:05:10,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:05:10,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:05:10,632 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 7 states. [2018-12-03 01:05:10,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:10,915 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-12-03 01:05:10,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 01:05:10,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-03 01:05:10,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:10,917 INFO L225 Difference]: With dead ends: 148 [2018-12-03 01:05:10,917 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 01:05:10,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-03 01:05:10,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 01:05:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 106. [2018-12-03 01:05:10,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 01:05:10,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-12-03 01:05:10,926 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 17 [2018-12-03 01:05:10,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:10,926 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-12-03 01:05:10,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:05:10,927 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-12-03 01:05:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 01:05:10,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:10,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:10,927 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:10,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:10,927 INFO L82 PathProgramCache]: Analyzing trace with hash -115653580, now seen corresponding path program 1 times [2018-12-03 01:05:10,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:10,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:10,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:10,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:10,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:11,010 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-03 01:05:11,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:11,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 01:05:11,010 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:11,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 01:05:11,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 01:05:11,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:05:11,011 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 8 states. [2018-12-03 01:05:11,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:11,363 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-12-03 01:05:11,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 01:05:11,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-12-03 01:05:11,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:11,364 INFO L225 Difference]: With dead ends: 143 [2018-12-03 01:05:11,365 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 01:05:11,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-12-03 01:05:11,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 01:05:11,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 104. [2018-12-03 01:05:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 01:05:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2018-12-03 01:05:11,370 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 17 [2018-12-03 01:05:11,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:11,371 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2018-12-03 01:05:11,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 01:05:11,371 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2018-12-03 01:05:11,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 01:05:11,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:11,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:11,372 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:11,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:11,372 INFO L82 PathProgramCache]: Analyzing trace with hash -871985669, now seen corresponding path program 1 times [2018-12-03 01:05:11,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:11,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:11,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:11,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:11,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:11,436 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-03 01:05:11,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:11,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 01:05:11,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:11,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 01:05:11,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 01:05:11,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:05:11,437 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 8 states. [2018-12-03 01:05:11,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:11,610 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-12-03 01:05:11,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 01:05:11,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-12-03 01:05:11,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:11,611 INFO L225 Difference]: With dead ends: 143 [2018-12-03 01:05:11,612 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 01:05:11,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-03 01:05:11,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 01:05:11,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 114. [2018-12-03 01:05:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 01:05:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-12-03 01:05:11,618 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 20 [2018-12-03 01:05:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:11,618 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-12-03 01:05:11,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 01:05:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-12-03 01:05:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 01:05:11,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:11,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:11,619 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:11,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:11,619 INFO L82 PathProgramCache]: Analyzing trace with hash -871985668, now seen corresponding path program 1 times [2018-12-03 01:05:11,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:11,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:11,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:11,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:11,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:11,769 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-03 01:05:11,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:11,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 01:05:11,769 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:11,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 01:05:11,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 01:05:11,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-03 01:05:11,770 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 11 states. [2018-12-03 01:05:12,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:12,353 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2018-12-03 01:05:12,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 01:05:12,353 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 01:05:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:12,354 INFO L225 Difference]: With dead ends: 141 [2018-12-03 01:05:12,354 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 01:05:12,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-12-03 01:05:12,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 01:05:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 113. [2018-12-03 01:05:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 01:05:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-12-03 01:05:12,359 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 20 [2018-12-03 01:05:12,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:12,359 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-12-03 01:05:12,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 01:05:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-12-03 01:05:12,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 01:05:12,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:12,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:12,360 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:12,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:12,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1261751943, now seen corresponding path program 1 times [2018-12-03 01:05:12,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:12,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:12,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:12,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:12,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:12,406 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-03 01:05:12,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:12,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 01:05:12,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:12,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 01:05:12,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 01:05:12,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:05:12,407 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 9 states. [2018-12-03 01:05:12,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:12,547 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2018-12-03 01:05:12,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 01:05:12,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-12-03 01:05:12,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:12,548 INFO L225 Difference]: With dead ends: 111 [2018-12-03 01:05:12,548 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 01:05:12,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 01:05:12,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 01:05:12,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 01:05:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 01:05:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2018-12-03 01:05:12,552 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 21 [2018-12-03 01:05:12,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:12,553 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-12-03 01:05:12,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 01:05:12,553 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2018-12-03 01:05:12,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 01:05:12,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:12,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:12,553 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:12,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:12,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1261751942, now seen corresponding path program 1 times [2018-12-03 01:05:12,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:12,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:12,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:12,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:12,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:12,625 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-03 01:05:12,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:12,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 01:05:12,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:12,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 01:05:12,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 01:05:12,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:05:12,626 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 10 states. [2018-12-03 01:05:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:12,775 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2018-12-03 01:05:12,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 01:05:12,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-12-03 01:05:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:12,776 INFO L225 Difference]: With dead ends: 109 [2018-12-03 01:05:12,776 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 01:05:12,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-12-03 01:05:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 01:05:12,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 01:05:12,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 01:05:12,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2018-12-03 01:05:12,781 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 21 [2018-12-03 01:05:12,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:12,782 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2018-12-03 01:05:12,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 01:05:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2018-12-03 01:05:12,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 01:05:12,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:12,783 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:12,783 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:12,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:12,783 INFO L82 PathProgramCache]: Analyzing trace with hash 755715794, now seen corresponding path program 1 times [2018-12-03 01:05:12,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:12,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:12,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:12,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:12,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:12,823 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-03 01:05:12,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:12,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:05:12,824 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:12,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:05:12,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:05:12,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:05:12,824 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 6 states. [2018-12-03 01:05:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:12,969 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2018-12-03 01:05:12,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 01:05:12,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-03 01:05:12,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:12,970 INFO L225 Difference]: With dead ends: 141 [2018-12-03 01:05:12,970 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 01:05:12,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:05:12,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 01:05:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2018-12-03 01:05:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 01:05:12,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-12-03 01:05:12,976 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 21 [2018-12-03 01:05:12,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:12,976 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-12-03 01:05:12,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:05:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-12-03 01:05:12,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 01:05:12,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:12,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:12,978 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:12,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:12,978 INFO L82 PathProgramCache]: Analyzing trace with hash 755715795, now seen corresponding path program 1 times [2018-12-03 01:05:12,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:12,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:12,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:12,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:12,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:13,058 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-03 01:05:13,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:13,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:05:13,058 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:13,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:05:13,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:05:13,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:05:13,059 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 7 states. [2018-12-03 01:05:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:13,335 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-12-03 01:05:13,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 01:05:13,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-03 01:05:13,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:13,336 INFO L225 Difference]: With dead ends: 142 [2018-12-03 01:05:13,336 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 01:05:13,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-03 01:05:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 01:05:13,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 122. [2018-12-03 01:05:13,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 01:05:13,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2018-12-03 01:05:13,341 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 21 [2018-12-03 01:05:13,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:13,341 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2018-12-03 01:05:13,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:05:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2018-12-03 01:05:13,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 01:05:13,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:13,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:13,342 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:13,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:13,343 INFO L82 PathProgramCache]: Analyzing trace with hash 626633076, now seen corresponding path program 1 times [2018-12-03 01:05:13,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:13,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:13,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:13,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:13,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:13,367 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-03 01:05:13,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:13,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:05:13,367 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:13,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:05:13,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:05:13,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:05:13,368 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 5 states. [2018-12-03 01:05:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:13,373 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-12-03 01:05:13,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:05:13,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-03 01:05:13,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:13,373 INFO L225 Difference]: With dead ends: 111 [2018-12-03 01:05:13,374 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 01:05:13,374 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-03 01:05:13,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 01:05:13,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-12-03 01:05:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 01:05:13,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-12-03 01:05:13,377 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 21 [2018-12-03 01:05:13,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:13,377 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-12-03 01:05:13,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:05:13,377 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-12-03 01:05:13,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 01:05:13,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:13,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:13,378 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:13,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:13,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1362839012, now seen corresponding path program 1 times [2018-12-03 01:05:13,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:13,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:13,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:13,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:13,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:13,418 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-03 01:05:13,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:13,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:05:13,418 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:13,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:05:13,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:05:13,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:05:13,419 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 5 states. [2018-12-03 01:05:13,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:13,481 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-12-03 01:05:13,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:05:13,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-03 01:05:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:13,481 INFO L225 Difference]: With dead ends: 108 [2018-12-03 01:05:13,481 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 01:05:13,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:05:13,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 01:05:13,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 01:05:13,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 01:05:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2018-12-03 01:05:13,484 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 23 [2018-12-03 01:05:13,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:13,484 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2018-12-03 01:05:13,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:05:13,484 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2018-12-03 01:05:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 01:05:13,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:13,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:13,484 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:13,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:13,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1362839011, now seen corresponding path program 1 times [2018-12-03 01:05:13,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:13,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:13,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:13,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:13,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:13,575 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-03 01:05:13,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:13,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 01:05:13,575 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:13,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 01:05:13,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 01:05:13,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:05:13,576 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 10 states. [2018-12-03 01:05:13,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:13,756 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-12-03 01:05:13,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 01:05:13,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-12-03 01:05:13,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:13,757 INFO L225 Difference]: With dead ends: 128 [2018-12-03 01:05:13,758 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 01:05:13,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-12-03 01:05:13,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 01:05:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2018-12-03 01:05:13,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 01:05:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2018-12-03 01:05:13,760 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 23 [2018-12-03 01:05:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:13,761 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2018-12-03 01:05:13,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 01:05:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2018-12-03 01:05:13,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 01:05:13,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:13,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:13,762 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:13,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:13,762 INFO L82 PathProgramCache]: Analyzing trace with hash -992923394, now seen corresponding path program 1 times [2018-12-03 01:05:13,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:13,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:13,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:13,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:13,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:13,783 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-03 01:05:13,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:13,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:05:13,783 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:13,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:05:13,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:05:13,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:05:13,784 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 5 states. [2018-12-03 01:05:13,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:13,851 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-12-03 01:05:13,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:05:13,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-03 01:05:13,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:13,852 INFO L225 Difference]: With dead ends: 121 [2018-12-03 01:05:13,853 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 01:05:13,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:05:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 01:05:13,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2018-12-03 01:05:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 01:05:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2018-12-03 01:05:13,856 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 26 [2018-12-03 01:05:13,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:13,856 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2018-12-03 01:05:13,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:05:13,856 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2018-12-03 01:05:13,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 01:05:13,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:13,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:13,857 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:13,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:13,857 INFO L82 PathProgramCache]: Analyzing trace with hash -992923393, now seen corresponding path program 1 times [2018-12-03 01:05:13,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:13,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:13,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:13,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:13,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:13,938 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-03 01:05:13,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:13,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 01:05:13,938 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:13,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:05:13,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:05:13,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:05:13,939 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 7 states. [2018-12-03 01:05:14,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:14,052 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-12-03 01:05:14,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 01:05:14,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-03 01:05:14,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:14,053 INFO L225 Difference]: With dead ends: 120 [2018-12-03 01:05:14,053 INFO L226 Difference]: Without dead ends: 120 [2018-12-03 01:05:14,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-03 01:05:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-03 01:05:14,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2018-12-03 01:05:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 01:05:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-12-03 01:05:14,055 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 26 [2018-12-03 01:05:14,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:14,056 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-12-03 01:05:14,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:05:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-12-03 01:05:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 01:05:14,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:14,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:14,056 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:14,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:14,056 INFO L82 PathProgramCache]: Analyzing trace with hash -787755985, now seen corresponding path program 1 times [2018-12-03 01:05:14,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:14,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:14,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:14,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:14,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:14,078 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-03 01:05:14,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:14,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:05:14,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:14,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:05:14,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:05:14,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:05:14,078 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 6 states. [2018-12-03 01:05:14,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:14,181 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-12-03 01:05:14,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:05:14,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-03 01:05:14,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:14,182 INFO L225 Difference]: With dead ends: 139 [2018-12-03 01:05:14,182 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 01:05:14,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:05:14,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 01:05:14,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 126. [2018-12-03 01:05:14,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 01:05:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-12-03 01:05:14,185 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 28 [2018-12-03 01:05:14,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:14,186 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-12-03 01:05:14,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:05:14,186 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-12-03 01:05:14,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 01:05:14,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:14,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:14,186 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:14,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:14,186 INFO L82 PathProgramCache]: Analyzing trace with hash -787755984, now seen corresponding path program 1 times [2018-12-03 01:05:14,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:14,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:14,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:14,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:14,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:14,227 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-03 01:05:14,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:14,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:05:14,228 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:14,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:05:14,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:05:14,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:05:14,228 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 6 states. [2018-12-03 01:05:14,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:14,373 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-12-03 01:05:14,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:05:14,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-03 01:05:14,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:14,374 INFO L225 Difference]: With dead ends: 126 [2018-12-03 01:05:14,374 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 01:05:14,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:05:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 01:05:14,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 01:05:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 01:05:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2018-12-03 01:05:14,377 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 28 [2018-12-03 01:05:14,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:14,377 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-12-03 01:05:14,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:05:14,377 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2018-12-03 01:05:14,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 01:05:14,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:14,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:14,378 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:14,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:14,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1950839153, now seen corresponding path program 1 times [2018-12-03 01:05:14,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:14,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:14,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:14,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:14,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:14,458 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-03 01:05:14,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:14,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 01:05:14,459 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:14,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 01:05:14,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 01:05:14,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 01:05:14,459 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 12 states. [2018-12-03 01:05:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:14,805 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-12-03 01:05:14,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 01:05:14,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-12-03 01:05:14,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:14,808 INFO L225 Difference]: With dead ends: 117 [2018-12-03 01:05:14,808 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 01:05:14,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-12-03 01:05:14,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 01:05:14,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2018-12-03 01:05:14,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 01:05:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-12-03 01:05:14,817 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 35 [2018-12-03 01:05:14,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:14,818 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-12-03 01:05:14,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 01:05:14,819 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-12-03 01:05:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 01:05:14,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:14,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:14,821 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:14,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:14,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1950839154, now seen corresponding path program 1 times [2018-12-03 01:05:14,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:14,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:14,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:14,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:14,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:14,992 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-03 01:05:14,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:14,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 01:05:14,992 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:14,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 01:05:14,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 01:05:14,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-03 01:05:14,993 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 13 states. [2018-12-03 01:05:15,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:15,417 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-12-03 01:05:15,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 01:05:15,418 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-12-03 01:05:15,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:15,419 INFO L225 Difference]: With dead ends: 112 [2018-12-03 01:05:15,419 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 01:05:15,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-12-03 01:05:15,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 01:05:15,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2018-12-03 01:05:15,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 01:05:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-12-03 01:05:15,423 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 35 [2018-12-03 01:05:15,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:15,424 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-12-03 01:05:15,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 01:05:15,424 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-12-03 01:05:15,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 01:05:15,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:15,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:15,425 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:15,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:15,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1221797440, now seen corresponding path program 1 times [2018-12-03 01:05:15,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:15,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:15,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:15,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:15,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:15,603 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-03 01:05:15,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:15,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-03 01:05:15,603 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:15,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 01:05:15,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 01:05:15,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-12-03 01:05:15,603 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 16 states. [2018-12-03 01:05:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:15,967 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-12-03 01:05:15,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 01:05:15,967 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-12-03 01:05:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:15,968 INFO L225 Difference]: With dead ends: 110 [2018-12-03 01:05:15,968 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 01:05:15,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2018-12-03 01:05:15,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 01:05:15,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2018-12-03 01:05:15,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 01:05:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2018-12-03 01:05:15,971 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 40 [2018-12-03 01:05:15,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:15,971 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2018-12-03 01:05:15,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 01:05:15,971 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2018-12-03 01:05:15,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 01:05:15,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:15,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:15,972 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:15,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:15,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1692383055, now seen corresponding path program 1 times [2018-12-03 01:05:15,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:15,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:15,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:15,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:15,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:16,113 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-03 01:05:16,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:16,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-03 01:05:16,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:16,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 01:05:16,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 01:05:16,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-12-03 01:05:16,114 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand 17 states. [2018-12-03 01:05:16,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:16,539 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-03 01:05:16,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 01:05:16,539 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-12-03 01:05:16,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:16,539 INFO L225 Difference]: With dead ends: 102 [2018-12-03 01:05:16,539 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 01:05:16,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 01:05:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 01:05:16,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2018-12-03 01:05:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 01:05:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2018-12-03 01:05:16,541 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 42 [2018-12-03 01:05:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:16,542 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2018-12-03 01:05:16,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 01:05:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2018-12-03 01:05:16,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 01:05:16,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:16,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:16,542 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:16,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:16,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1034005355, now seen corresponding path program 1 times [2018-12-03 01:05:16,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:16,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:16,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:16,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:16,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:05:16,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:16,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-12-03 01:05:16,876 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:16,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 01:05:16,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 01:05:16,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-12-03 01:05:16,877 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 26 states. [2018-12-03 01:05:17,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:17,995 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 01:05:17,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 01:05:17,995 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 44 [2018-12-03 01:05:17,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:17,996 INFO L225 Difference]: With dead ends: 101 [2018-12-03 01:05:17,996 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 01:05:17,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=308, Invalid=2448, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 01:05:17,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 01:05:17,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-12-03 01:05:17,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 01:05:18,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2018-12-03 01:05:18,000 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 44 [2018-12-03 01:05:18,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:18,000 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2018-12-03 01:05:18,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 01:05:18,001 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-12-03 01:05:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 01:05:18,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:18,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:18,002 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:18,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:18,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1034005356, now seen corresponding path program 1 times [2018-12-03 01:05:18,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:18,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:18,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:18,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:18,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:18,548 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-03 01:05:18,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:18,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2018-12-03 01:05:18,549 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:18,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 01:05:18,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 01:05:18,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=689, Unknown=0, NotChecked=0, Total=756 [2018-12-03 01:05:18,549 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 28 states. [2018-12-03 01:05:19,067 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2018-12-03 01:05:19,303 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2018-12-03 01:05:19,889 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2018-12-03 01:05:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:21,553 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 01:05:21,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 01:05:21,554 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 44 [2018-12-03 01:05:21,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:21,556 INFO L225 Difference]: With dead ends: 100 [2018-12-03 01:05:21,556 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 01:05:21,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=328, Invalid=2642, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 01:05:21,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 01:05:21,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-12-03 01:05:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 01:05:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2018-12-03 01:05:21,562 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 44 [2018-12-03 01:05:21,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:21,562 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2018-12-03 01:05:21,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 01:05:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2018-12-03 01:05:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 01:05:21,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:21,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:21,564 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:21,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:21,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1989394924, now seen corresponding path program 1 times [2018-12-03 01:05:21,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:21,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:21,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:21,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:21,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:22,075 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-03 01:05:22,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:22,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-12-03 01:05:22,075 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:22,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 01:05:22,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 01:05:22,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=502, Unknown=0, NotChecked=0, Total=552 [2018-12-03 01:05:22,076 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 24 states. [2018-12-03 01:05:24,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:24,154 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 01:05:24,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 01:05:24,155 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-12-03 01:05:24,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:24,157 INFO L225 Difference]: With dead ends: 99 [2018-12-03 01:05:24,157 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 01:05:24,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=245, Invalid=2011, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 01:05:24,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 01:05:24,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-12-03 01:05:24,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 01:05:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-12-03 01:05:24,165 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 45 [2018-12-03 01:05:24,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:24,166 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-12-03 01:05:24,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 01:05:24,166 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-12-03 01:05:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 01:05:24,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:24,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:24,167 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:24,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:24,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1989394925, now seen corresponding path program 1 times [2018-12-03 01:05:24,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:24,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:24,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:24,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:24,170 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:24,676 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-03 01:05:24,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:24,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-12-03 01:05:24,676 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:24,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 01:05:24,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 01:05:24,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2018-12-03 01:05:24,677 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 24 states. [2018-12-03 01:05:26,226 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2018-12-03 01:05:26,425 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2018-12-03 01:05:26,618 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-12-03 01:05:27,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:27,911 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-03 01:05:27,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 01:05:27,911 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-12-03 01:05:27,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:27,912 INFO L225 Difference]: With dead ends: 98 [2018-12-03 01:05:27,912 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 01:05:27,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=224, Invalid=1846, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 01:05:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 01:05:27,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-12-03 01:05:27,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 01:05:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-03 01:05:27,914 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 45 [2018-12-03 01:05:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:27,915 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-03 01:05:27,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 01:05:27,915 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-03 01:05:27,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 01:05:27,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:27,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:27,915 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:27,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:27,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1304629992, now seen corresponding path program 1 times [2018-12-03 01:05:27,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:27,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:27,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:27,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:27,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:28,085 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-03 01:05:28,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:28,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-03 01:05:28,085 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:28,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 01:05:28,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 01:05:28,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-12-03 01:05:28,086 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 17 states. [2018-12-03 01:05:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:28,358 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 01:05:28,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 01:05:28,359 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2018-12-03 01:05:28,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:28,359 INFO L225 Difference]: With dead ends: 97 [2018-12-03 01:05:28,359 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 01:05:28,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-12-03 01:05:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 01:05:28,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 01:05:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 01:05:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-03 01:05:28,362 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 51 [2018-12-03 01:05:28,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:28,362 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-03 01:05:28,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 01:05:28,362 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-03 01:05:28,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 01:05:28,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:28,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:28,363 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:28,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:28,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1073148402, now seen corresponding path program 1 times [2018-12-03 01:05:28,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:28,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:28,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:28,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:28,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:05:28,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:28,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2018-12-03 01:05:28,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:28,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 01:05:28,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 01:05:28,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2018-12-03 01:05:28,852 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 30 states. [2018-12-03 01:05:30,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:30,034 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 01:05:30,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 01:05:30,034 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2018-12-03 01:05:30,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:30,035 INFO L225 Difference]: With dead ends: 100 [2018-12-03 01:05:30,035 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 01:05:30,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=293, Invalid=3247, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 01:05:30,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 01:05:30,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-12-03 01:05:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 01:05:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-03 01:05:30,038 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 54 [2018-12-03 01:05:30,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:30,038 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-03 01:05:30,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 01:05:30,038 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-03 01:05:30,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 01:05:30,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:30,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:30,039 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:30,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:30,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1073148403, now seen corresponding path program 1 times [2018-12-03 01:05:30,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:30,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:30,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:30,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:30,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:30,575 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-03 01:05:30,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:30,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2018-12-03 01:05:30,576 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:30,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 01:05:30,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 01:05:30,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2018-12-03 01:05:30,577 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 31 states. [2018-12-03 01:05:32,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:32,090 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 01:05:32,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 01:05:32,090 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 54 [2018-12-03 01:05:32,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:32,090 INFO L225 Difference]: With dead ends: 100 [2018-12-03 01:05:32,090 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 01:05:32,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=326, Invalid=3334, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 01:05:32,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 01:05:32,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-12-03 01:05:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 01:05:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-03 01:05:32,093 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 54 [2018-12-03 01:05:32,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:32,093 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-03 01:05:32,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 01:05:32,093 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-03 01:05:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 01:05:32,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:32,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:05:32,094 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:32,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:32,094 INFO L82 PathProgramCache]: Analyzing trace with hash 710557809, now seen corresponding path program 1 times [2018-12-03 01:05:32,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:32,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:32,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:32,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:32,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:32,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:05:32,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:32,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:05:32,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:32,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:05:32,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:05:32,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:05:32,121 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 6 states. [2018-12-03 01:05:32,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:32,176 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 01:05:32,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:05:32,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-03 01:05:32,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:32,177 INFO L225 Difference]: With dead ends: 97 [2018-12-03 01:05:32,177 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 01:05:32,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:05:32,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 01:05:32,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 01:05:32,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 01:05:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-03 01:05:32,179 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 59 [2018-12-03 01:05:32,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:32,179 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-03 01:05:32,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:05:32,179 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-03 01:05:32,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 01:05:32,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:32,179 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:05:32,179 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:32,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:32,180 INFO L82 PathProgramCache]: Analyzing trace with hash 710557810, now seen corresponding path program 1 times [2018-12-03 01:05:32,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:32,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:32,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:32,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:32,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:32,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:05:32,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:05:32,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:05:32,298 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-12-03 01:05:32,299 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [6], [8], [11], [16], [17], [18], [21], [24], [36], [37], [39], [40], [44], [45], [46], [47], [50], [53], [56], [59], [60], [63], [65], [66], [67], [68], [69], [72], [73], [76], [84], [87], [89], [91], [92], [95], [107], [108], [109], [110], [111], [112], [113], [115], [116], [117], [118], [119], [120], [121], [123], [124], [125] [2018-12-03 01:05:32,319 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:05:32,319 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:05:32,456 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:05:32,457 INFO L272 AbstractInterpreter]: Visited 56 different actions 56 times. Never merged. Never widened. Performed 537 root evaluator evaluations with a maximum evaluation depth of 6. Performed 537 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-12-03 01:05:32,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:32,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:05:32,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:05:32,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:05:32,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:32,469 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:05:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:32,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:05:32,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-12-03 01:05:32,613 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 27 treesize of output 19 [2018-12-03 01:05:32,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:32,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:32,619 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-03 01:05:32,622 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 7 [2018-12-03 01:05:32,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:32,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:32,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:32,624 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:7 [2018-12-03 01:05:32,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:05:32,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:05:32,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2018-12-03 01:05:32,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-03 01:05:32,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:05:32,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:41 [2018-12-03 01:05:32,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-12-03 01:05:32,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-03 01:05:32,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:05:32,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:41 [2018-12-03 01:05:32,940 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 24 treesize of output 20 [2018-12-03 01:05:32,942 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 20 treesize of output 11 [2018-12-03 01:05:32,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:32,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:32,948 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 26 treesize of output 20 [2018-12-03 01:05:32,949 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 20 treesize of output 14 [2018-12-03 01:05:32,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:32,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:32,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:32,954 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:11 [2018-12-03 01:05:32,977 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 16 treesize of output 20 [2018-12-03 01:05:32,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-03 01:05:32,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:05:32,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:17 [2018-12-03 01:05:33,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:05:33,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 01:05:33,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 33 [2018-12-03 01:05:33,146 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 01:05:33,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 01:05:33,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 01:05:33,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 01:05:33,146 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 20 states. [2018-12-03 01:05:33,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:33,719 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-12-03 01:05:33,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 01:05:33,719 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2018-12-03 01:05:33,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:33,720 INFO L225 Difference]: With dead ends: 113 [2018-12-03 01:05:33,720 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 01:05:33,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 01:05:33,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 01:05:33,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2018-12-03 01:05:33,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 01:05:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-12-03 01:05:33,724 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 59 [2018-12-03 01:05:33,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:33,724 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-12-03 01:05:33,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 01:05:33,724 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-12-03 01:05:33,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 01:05:33,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:33,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:05:33,725 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:33,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:33,725 INFO L82 PathProgramCache]: Analyzing trace with hash -124859678, now seen corresponding path program 1 times [2018-12-03 01:05:33,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:33,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:33,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:33,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:33,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:05:33,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:33,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:05:33,757 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:33,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:05:33,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:05:33,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:05:33,758 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 7 states. [2018-12-03 01:05:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:33,872 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2018-12-03 01:05:33,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 01:05:33,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-12-03 01:05:33,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:33,873 INFO L225 Difference]: With dead ends: 106 [2018-12-03 01:05:33,873 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 01:05:33,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-03 01:05:33,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 01:05:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 01:05:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 01:05:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-12-03 01:05:33,875 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 61 [2018-12-03 01:05:33,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:33,875 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-12-03 01:05:33,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:05:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2018-12-03 01:05:33,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 01:05:33,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:33,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:05:33,876 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:33,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:33,876 INFO L82 PathProgramCache]: Analyzing trace with hash -124859677, now seen corresponding path program 1 times [2018-12-03 01:05:33,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:33,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:33,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:33,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:33,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 01:05:33,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:33,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 01:05:33,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:33,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 01:05:33,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 01:05:33,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-12-03 01:05:33,960 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 14 states. [2018-12-03 01:05:34,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:34,248 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2018-12-03 01:05:34,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 01:05:34,248 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2018-12-03 01:05:34,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:34,249 INFO L225 Difference]: With dead ends: 105 [2018-12-03 01:05:34,249 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 01:05:34,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2018-12-03 01:05:34,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 01:05:34,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 01:05:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 01:05:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2018-12-03 01:05:34,251 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 61 [2018-12-03 01:05:34,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:34,251 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2018-12-03 01:05:34,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 01:05:34,251 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2018-12-03 01:05:34,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 01:05:34,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:34,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:05:34,252 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:34,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:34,252 INFO L82 PathProgramCache]: Analyzing trace with hash 424317281, now seen corresponding path program 1 times [2018-12-03 01:05:34,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:34,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:34,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:34,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:34,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 01:05:34,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:34,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-03 01:05:34,359 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:05:34,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 01:05:34,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 01:05:34,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-12-03 01:05:34,360 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 15 states. [2018-12-03 01:05:34,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:34,628 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-12-03 01:05:34,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 01:05:34,628 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-12-03 01:05:34,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:34,628 INFO L225 Difference]: With dead ends: 104 [2018-12-03 01:05:34,629 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 01:05:34,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2018-12-03 01:05:34,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 01:05:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 01:05:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 01:05:34,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-12-03 01:05:34,631 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 62 [2018-12-03 01:05:34,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:34,632 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-12-03 01:05:34,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 01:05:34,632 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-12-03 01:05:34,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 01:05:34,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:34,632 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:34,633 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 01:05:34,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:34,633 INFO L82 PathProgramCache]: Analyzing trace with hash -109549283, now seen corresponding path program 1 times [2018-12-03 01:05:34,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:05:34,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:34,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:34,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:05:34,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:05:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:05:35,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:05:35,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:05:35,453 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-12-03 01:05:35,453 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [6], [8], [11], [16], [17], [18], [19], [21], [24], [36], [37], [40], [44], [45], [46], [47], [50], [53], [56], [59], [60], [63], [65], [66], [67], [68], [69], [72], [73], [76], [84], [87], [89], [91], [92], [95], [107], [108], [109], [110], [111], [112], [113], [115], [116], [117], [118], [119], [120], [121], [123], [124], [125] [2018-12-03 01:05:35,455 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:05:35,455 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:05:35,498 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:05:35,498 INFO L272 AbstractInterpreter]: Visited 56 different actions 56 times. Never merged. Never widened. Performed 535 root evaluator evaluations with a maximum evaluation depth of 6. Performed 535 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-12-03 01:05:35,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:35,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:05:35,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:05:35,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:05:35,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:35,507 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:05:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:35,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:05:35,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 01:05:35,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:35,558 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-03 01:05:35,561 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 15 treesize of output 14 [2018-12-03 01:05:35,562 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:35,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:35,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:35,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 01:05:35,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 01:05:35,591 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:05:35,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:05:35,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:05:35,624 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:93 [2018-12-03 01:05:35,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:35,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:35,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-12-03 01:05:35,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:35,735 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-12-03 01:05:35,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:35,753 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 31 treesize of output 29 [2018-12-03 01:05:35,755 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-03 01:05:35,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:35,760 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:35,775 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 24 treesize of output 22 [2018-12-03 01:05:35,776 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-03 01:05:35,776 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:35,781 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:35,794 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 27 treesize of output 25 [2018-12-03 01:05:35,796 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-03 01:05:35,796 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:35,801 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:35,813 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 20 treesize of output 18 [2018-12-03 01:05:35,814 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-03 01:05:35,814 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:35,818 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:35,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:35,826 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:75, output treesize:13 [2018-12-03 01:05:36,131 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-03 01:05:36,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:05:36,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,142 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-03 01:05:36,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:05:36,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,151 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-12-03 01:05:36,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-12-03 01:05:36,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:36,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 01:05:36,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-12-03 01:05:36,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:36,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 01:05:36,216 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,229 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-12-03 01:05:36,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 56 [2018-12-03 01:05:36,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 41 treesize of output 46 [2018-12-03 01:05:36,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:36,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 67 [2018-12-03 01:05:36,324 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-03 01:05:36,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:05:36,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 71 [2018-12-03 01:05:36,392 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 64 treesize of output 69 [2018-12-03 01:05:36,393 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:36,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:36,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 90 [2018-12-03 01:05:36,434 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-03 01:05:36,458 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:05:36,460 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 01:05:36,460 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 01:05:36,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2018-12-03 01:05:36,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:36,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2018-12-03 01:05:36,465 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,472 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,473 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 01:05:36,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-12-03 01:05:36,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:36,479 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 52 treesize of output 63 [2018-12-03 01:05:36,479 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,489 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:05:36,517 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:58, output treesize:165 [2018-12-03 01:05:36,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:36,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:36,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:36,805 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 95 treesize of output 88 [2018-12-03 01:05:36,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:36,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:36,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:36,837 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 95 treesize of output 88 [2018-12-03 01:05:36,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 84 [2018-12-03 01:05:36,865 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 19 [2018-12-03 01:05:36,866 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,876 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 77 [2018-12-03 01:05:36,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, 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 7 [2018-12-03 01:05:36,913 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,921 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,945 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 88 treesize of output 84 [2018-12-03 01:05:36,947 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 19 [2018-12-03 01:05:36,947 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,957 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,978 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 81 treesize of output 77 [2018-12-03 01:05:36,980 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 7 [2018-12-03 01:05:36,980 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:36,989 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:37,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 01:05:37,009 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:191, output treesize:141 [2018-12-03 01:05:37,525 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-03 01:05:37,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:05:37,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:37,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:37,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:37,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-03 01:05:37,615 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 01:05:37,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 89 [2018-12-03 01:05:37,618 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2018-12-03 01:05:37,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:37,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 80 [2018-12-03 01:05:37,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 16 xjuncts. [2018-12-03 01:05:37,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-12-03 01:05:37,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 62 [2018-12-03 01:05:37,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,819 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2018-12-03 01:05:37,819 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:05:37,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 5 treesize of output 1 [2018-12-03 01:05:37,827 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:37,831 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:05:37,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 62 [2018-12-03 01:05:37,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,841 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2018-12-03 01:05:37,842 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:05:37,850 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-03 01:05:37,850 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:37,854 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:05:37,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 60 [2018-12-03 01:05:37,858 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-03 01:05:37,858 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:37,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 44 [2018-12-03 01:05:37,879 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 01:05:37,893 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 01:05:37,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 56 [2018-12-03 01:05:37,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 51 [2018-12-03 01:05:37,910 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 01:05:37,928 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 30 treesize of output 25 [2018-12-03 01:05:37,929 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:37,930 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 31 treesize of output 26 [2018-12-03 01:05:37,930 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:37,941 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 01:05:37,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2018-12-03 01:05:37,945 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-03 01:05:37,945 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:37,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 60 [2018-12-03 01:05:37,967 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-03 01:05:37,989 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-03 01:05:37,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66 [2018-12-03 01:05:37,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:37,999 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2018-12-03 01:05:37,999 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:05:38,007 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-03 01:05:38,008 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:38,012 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:05:38,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 60 [2018-12-03 01:05:38,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:38,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:38,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:38,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:38,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 49 [2018-12-03 01:05:38,024 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 01:05:38,041 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 31 treesize of output 26 [2018-12-03 01:05:38,041 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:38,042 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 25 treesize of output 20 [2018-12-03 01:05:38,043 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:38,054 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 01:05:38,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 56 [2018-12-03 01:05:38,058 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-03 01:05:38,058 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:38,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:38,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:38,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:38,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:38,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 46 [2018-12-03 01:05:38,074 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 01:05:38,089 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 01:05:38,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 22 dim-0 vars, and 15 xjuncts. [2018-12-03 01:05:38,178 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 3 variables, input treesize:153, output treesize:357 [2018-12-03 01:05:38,542 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-03 01:05:38,544 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-03 01:05:38,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:38,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:38,547 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-03 01:05:38,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:5 [2018-12-03 01:05:38,678 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:05:38,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:05:38,833 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 18 treesize of output 13 [2018-12-03 01:05:38,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:38,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:38,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:9 [2018-12-03 01:05:39,031 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 9 treesize of output 7 [2018-12-03 01:05:39,033 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 7 treesize of output 3 [2018-12-03 01:05:39,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:39,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:39,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:05:39,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:45 [2018-12-03 01:05:39,410 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 19 treesize of output 13 [2018-12-03 01:05:39,413 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 13 treesize of output 7 [2018-12-03 01:05:39,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:39,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:39,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:05:39,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:73 [2018-12-03 01:05:39,673 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 48 treesize of output 36 [2018-12-03 01:05:39,677 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 36 treesize of output 16 [2018-12-03 01:05:39,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:39,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:39,695 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 20 treesize of output 16 [2018-12-03 01:05:39,698 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 16 treesize of output 7 [2018-12-03 01:05:39,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:39,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:39,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:39,706 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:12 [2018-12-03 01:05:39,773 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-03 01:05:39,774 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-03 01:05:39,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:39,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:39,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:05:39,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:25 [2018-12-03 01:05:41,083 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-12-03 01:05:41,296 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 66 [2018-12-03 01:05:41,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 50 treesize of output 39 [2018-12-03 01:05:41,320 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 01:05:41,320 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 39 treesize of output 45 [2018-12-03 01:05:41,320 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,328 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 20 treesize of output 23 [2018-12-03 01:05:41,330 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 01:05:41,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-12-03 01:05:41,331 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,335 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,346 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 35 treesize of output 27 [2018-12-03 01:05:41,348 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 24 treesize of output 7 [2018-12-03 01:05:41,348 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,350 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,351 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 49 treesize of output 37 [2018-12-03 01:05:41,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-12-03 01:05:41,372 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2018-12-03 01:05:41,374 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2018-12-03 01:05:41,376 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 18 [2018-12-03 01:05:41,377 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,387 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:05:41,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:05:41,412 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 66 [2018-12-03 01:05:41,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 20 treesize of output 23 [2018-12-03 01:05:41,424 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 01:05:41,424 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 20 treesize of output 28 [2018-12-03 01:05:41,424 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,431 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 50 treesize of output 39 [2018-12-03 01:05:41,435 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 39 treesize of output 38 [2018-12-03 01:05:41,435 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,439 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,452 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 42 treesize of output 34 [2018-12-03 01:05:41,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2018-12-03 01:05:41,475 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,477 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 26 treesize of output 12 [2018-12-03 01:05:41,477 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2018-12-03 01:05:41,479 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,488 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:05:41,489 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 49 treesize of output 37 [2018-12-03 01:05:41,509 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 27 treesize of output 11 [2018-12-03 01:05:41,509 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2018-12-03 01:05:41,510 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,517 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:05:41,518 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 35 treesize of output 27 [2018-12-03 01:05:41,520 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 24 treesize of output 7 [2018-12-03 01:05:41,520 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,522 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:41,537 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:05:41,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-12-03 01:05:41,561 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 4 variables, input treesize:189, output treesize:90 [2018-12-03 01:05:42,347 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-03 01:05:42,811 WARN L180 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 89 [2018-12-03 01:05:42,815 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 95 [2018-12-03 01:05:43,016 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:05:43,018 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:223) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java: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-03 01:05:43,025 INFO L168 Benchmark]: Toolchain (without parser) took 33400.24 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 529.5 MB). Free memory was 952.4 MB in the beginning and 1.5 GB in the end (delta: -555.6 MB). Peak memory consumption was 653.4 MB. Max. memory is 11.5 GB. [2018-12-03 01:05:43,026 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:05:43,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-03 01:05:43,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:05:43,027 INFO L168 Benchmark]: Boogie Preprocessor took 21.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-12-03 01:05:43,028 INFO L168 Benchmark]: RCFGBuilder took 265.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: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-12-03 01:05:43,028 INFO L168 Benchmark]: TraceAbstraction took 32729.93 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 380.6 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -424.6 MB). Peak memory consumption was 635.6 MB. Max. memory is 11.5 GB. [2018-12-03 01:05:43,032 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 356.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 265.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: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32729.93 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 380.6 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -424.6 MB). Peak memory consumption was 635.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-03 01:05:44,253 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 01:05:44,254 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 01:05:44,260 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 01:05:44,260 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 01:05:44,261 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 01:05:44,262 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 01:05:44,263 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 01:05:44,264 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 01:05:44,265 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 01:05:44,265 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 01:05:44,265 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 01:05:44,266 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 01:05:44,266 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 01:05:44,267 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 01:05:44,267 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 01:05:44,267 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 01:05:44,268 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 01:05:44,270 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 01:05:44,270 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 01:05:44,271 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 01:05:44,272 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 01:05:44,273 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 01:05:44,274 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 01:05:44,274 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 01:05:44,274 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 01:05:44,275 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 01:05:44,275 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 01:05:44,275 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 01:05:44,276 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 01:05:44,276 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 01:05:44,276 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 01:05:44,277 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 01:05:44,277 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 01:05:44,277 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 01:05:44,277 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 01:05:44,277 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-03 01:05:44,287 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 01:05:44,288 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 01:05:44,288 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 01:05:44,288 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 01:05:44,289 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 01:05:44,289 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 01:05:44,289 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 01:05:44,289 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 01:05:44,289 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 01:05:44,289 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 01:05:44,290 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 01:05:44,290 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 01:05:44,290 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 01:05:44,290 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 01:05:44,291 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 01:05:44,291 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 01:05:44,291 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 01:05:44,291 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 01:05:44,291 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 01:05:44,291 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 01:05:44,292 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 01:05:44,292 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 01:05:44,292 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-03 01:05:44,292 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-03 01:05:44,292 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 01:05:44,292 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 01:05:44,292 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 01:05:44,293 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 01:05:44,293 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 01:05:44,293 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 01:05:44,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 01:05:44,293 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 01:05:44,293 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 01:05:44,293 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-03 01:05:44,294 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 01:05:44,294 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-03 01:05:44,294 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_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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 -> 976e1955e162f3b4e872a15f7e9a64e265f0afc5 [2018-12-03 01:05:44,317 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 01:05:44,324 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 01:05:44,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 01:05:44,327 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 01:05:44,328 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 01:05:44,328 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i [2018-12-03 01:05:44,363 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/data/d2704937b/7031bce6047c4234b3f5dd0450976463/FLAGc7a9766c4 [2018-12-03 01:05:44,859 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 01:05:44,859 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/sv-benchmarks/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i [2018-12-03 01:05:44,866 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/data/d2704937b/7031bce6047c4234b3f5dd0450976463/FLAGc7a9766c4 [2018-12-03 01:05:45,349 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/data/d2704937b/7031bce6047c4234b3f5dd0450976463 [2018-12-03 01:05:45,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 01:05:45,352 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 01:05:45,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 01:05:45,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 01:05:45,355 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 01:05:45,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:05:45" (1/1) ... [2018-12-03 01:05:45,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785ac8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:45, skipping insertion in model container [2018-12-03 01:05:45,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:05:45" (1/1) ... [2018-12-03 01:05:45,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 01:05:45,383 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 01:05:45,592 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:05:45,640 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 01:05:45,675 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:05:45,716 INFO L195 MainTranslator]: Completed translation [2018-12-03 01:05:45,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:45 WrapperNode [2018-12-03 01:05:45,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 01:05:45,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 01:05:45,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 01:05:45,717 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 01:05:45,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:45" (1/1) ... [2018-12-03 01:05:45,733 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:45" (1/1) ... [2018-12-03 01:05:45,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 01:05:45,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 01:05:45,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 01:05:45,738 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 01:05:45,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:45" (1/1) ... [2018-12-03 01:05:45,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:45" (1/1) ... [2018-12-03 01:05:45,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:45" (1/1) ... [2018-12-03 01:05:45,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:45" (1/1) ... [2018-12-03 01:05:45,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:45" (1/1) ... [2018-12-03 01:05:45,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:45" (1/1) ... [2018-12-03 01:05:45,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:45" (1/1) ... [2018-12-03 01:05:45,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 01:05:45,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 01:05:45,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 01:05:45,760 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 01:05:45,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:05:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 01:05:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-12-03 01:05:45,792 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-12-03 01:05:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2018-12-03 01:05:45,792 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2018-12-03 01:05:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-03 01:05:45,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-03 01:05:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2018-12-03 01:05:45,792 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2018-12-03 01:05:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2018-12-03 01:05:45,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2018-12-03 01:05:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_13 [2018-12-03 01:05:45,792 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_13 [2018-12-03 01:05:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 01:05:45,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 01:05:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 01:05:45,793 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 01:05:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 01:05:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 01:05:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 01:05:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-03 01:05:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2018-12-03 01:05:45,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2018-12-03 01:05:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure free_13 [2018-12-03 01:05:45,793 INFO L138 BoogieDeclarations]: Found implementation of procedure free_13 [2018-12-03 01:05:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-03 01:05:45,793 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-03 01:05:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 01:05:45,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 01:05:46,089 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 01:05:46,089 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 01:05:46,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:05:46 BoogieIcfgContainer [2018-12-03 01:05:46,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 01:05:46,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 01:05:46,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 01:05:46,093 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 01:05:46,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 01:05:45" (1/3) ... [2018-12-03 01:05:46,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b325aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:05:46, skipping insertion in model container [2018-12-03 01:05:46,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:05:45" (2/3) ... [2018-12-03 01:05:46,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b325aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:05:46, skipping insertion in model container [2018-12-03 01:05:46,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:05:46" (3/3) ... [2018-12-03 01:05:46,095 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test13_true-valid-memsafety.i [2018-12-03 01:05:46,103 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 01:05:46,108 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-12-03 01:05:46,121 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2018-12-03 01:05:46,136 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 01:05:46,136 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 01:05:46,137 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 01:05:46,137 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 01:05:46,137 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 01:05:46,137 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 01:05:46,137 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 01:05:46,137 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 01:05:46,137 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 01:05:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2018-12-03 01:05:46,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 01:05:46,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:46,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:46,156 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:05:46,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:46,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1627156754, now seen corresponding path program 1 times [2018-12-03 01:05:46,164 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:05:46,165 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:05:46,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:46,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:05:46,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 12 treesize of output 15 [2018-12-03 01:05:46,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:46,308 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-03 01:05:46,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:46,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:46,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 01:05:46,329 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 01:05:46,364 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 15 treesize of output 14 [2018-12-03 01:05:46,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:46,400 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:05:46,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:05:46,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-03 01:05:46,469 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:71 [2018-12-03 01:05:46,508 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 9 treesize of output 7 [2018-12-03 01:05:46,511 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-03 01:05:46,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:46,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:46,514 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-03 01:05:46,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2018-12-03 01:05:46,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 7 treesize of output 1 [2018-12-03 01:05:46,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:46,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:46,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2018-12-03 01:05:46,565 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-03 01:05:46,565 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:05:46,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:46,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:05:46,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:05:46,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:05:46,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:05:46,586 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 7 states. [2018-12-03 01:05:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:55,564 INFO L93 Difference]: Finished difference Result 204 states and 218 transitions. [2018-12-03 01:05:55,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 01:05:55,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-03 01:05:55,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:55,573 INFO L225 Difference]: With dead ends: 204 [2018-12-03 01:05:55,573 INFO L226 Difference]: Without dead ends: 191 [2018-12-03 01:05:55,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-03 01:05:55,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-03 01:05:55,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 107. [2018-12-03 01:05:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 01:05:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-12-03 01:05:55,605 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 17 [2018-12-03 01:05:55,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:55,606 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-12-03 01:05:55,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:05:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-12-03 01:05:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 01:05:55,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:55,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:55,607 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:05:55,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:55,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1627156755, now seen corresponding path program 1 times [2018-12-03 01:05:55,607 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:05:55,607 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:05:55,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:55,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:05:55,692 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-03 01:05:55,692 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:05:55,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:05:55,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:05:55,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:05:55,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:05:55,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:05:55,696 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 5 states. [2018-12-03 01:05:55,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:05:55,710 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-12-03 01:05:55,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:05:55,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-03 01:05:55,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:05:55,711 INFO L225 Difference]: With dead ends: 108 [2018-12-03 01:05:55,711 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 01:05:55,712 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-03 01:05:55,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 01:05:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-12-03 01:05:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 01:05:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-12-03 01:05:55,717 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 17 [2018-12-03 01:05:55,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:05:55,718 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-12-03 01:05:55,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:05:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-12-03 01:05:55,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 01:05:55,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:05:55,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:05:55,719 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:05:55,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:05:55,719 INFO L82 PathProgramCache]: Analyzing trace with hash -115653580, now seen corresponding path program 1 times [2018-12-03 01:05:55,719 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:05:55,719 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:05:55,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:05:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:55,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:05:55,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 01:05:55,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:55,818 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-03 01:05:55,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:55,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:55,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 01:05:55,837 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 01:05:55,877 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 15 treesize of output 14 [2018-12-03 01:05:55,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:55,908 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:05:55,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:05:55,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 9 treesize of output 12 [2018-12-03 01:05:55,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03 01:05:55,992 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:55,997 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:56,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:05:56,023 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:34, output treesize:110 [2018-12-03 01:05:56,095 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 30 treesize of output 28 [2018-12-03 01:05:56,097 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-03 01:05:56,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:56,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:56,129 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 30 treesize of output 28 [2018-12-03 01:05:56,131 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-03 01:05:56,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:56,137 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:56,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:05:56,154 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:43 [2018-12-03 01:05:56,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:56,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:05:56,225 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 27 treesize of output 19 [2018-12-03 01:05:56,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:56,259 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 19 treesize of output 14 [2018-12-03 01:05:56,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:56,279 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 22 treesize of output 15 [2018-12-03 01:05:56,280 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:56,306 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 10 [2018-12-03 01:05:56,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:05:56,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:05:56,315 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:10 [2018-12-03 01:06:00,892 WARN L180 SmtUtils]: Spent 904.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 01:06:00,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:06:00,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:06:00,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-12-03 01:06:00,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:06:00,967 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 2 case distinctions, treesize of input 24 treesize of output 27 [2018-12-03 01:06:00,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 01:06:01,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:06:01,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:06:01,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:06:01,033 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 32 treesize of output 23 [2018-12-03 01:06:01,033 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:06:01,100 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 23 treesize of output 22 [2018-12-03 01:06:01,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:06:01,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:06:01,146 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:65, output treesize:28 [2018-12-03 01:06:02,347 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-03 01:06:02,347 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:06:02,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:06:02,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 01:06:02,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 01:06:02,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 01:06:02,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=50, Unknown=4, NotChecked=0, Total=72 [2018-12-03 01:06:02,350 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 9 states. [2018-12-03 01:06:16,382 WARN L180 SmtUtils]: Spent 3.78 s on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2018-12-03 01:07:18,975 WARN L180 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2018-12-03 01:07:58,910 WARN L180 SmtUtils]: Spent 1.53 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 01:08:10,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:08:10,953 INFO L93 Difference]: Finished difference Result 188 states and 195 transitions. [2018-12-03 01:08:10,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 01:08:10,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-12-03 01:08:10,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:08:10,955 INFO L225 Difference]: With dead ends: 188 [2018-12-03 01:08:10,955 INFO L226 Difference]: Without dead ends: 188 [2018-12-03 01:08:10,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 44.0s TimeCoverageRelationStatistics Valid=86, Invalid=195, Unknown=25, NotChecked=0, Total=306 [2018-12-03 01:08:10,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-03 01:08:10,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 115. [2018-12-03 01:08:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 01:08:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-12-03 01:08:10,962 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 17 [2018-12-03 01:08:10,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:08:10,962 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-12-03 01:08:10,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 01:08:10,963 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-12-03 01:08:10,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 01:08:10,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:08:10,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:08:10,963 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:08:10,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:08:10,963 INFO L82 PathProgramCache]: Analyzing trace with hash -871985669, now seen corresponding path program 1 times [2018-12-03 01:08:10,963 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:08:10,964 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:08:10,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:08:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:08:11,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:08:11,055 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 9 treesize of output 7 [2018-12-03 01:08:11,057 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-03 01:08:11,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:08:11,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:08:11,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:08:11,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:20 [2018-12-03 01:08:11,108 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-03 01:08:11,110 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-03 01:08:11,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:08:11,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:08:11,115 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-03 01:08:11,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:5 [2018-12-03 01:08:11,147 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-03 01:08:11,147 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:08:11,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:08:11,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 01:08:11,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 01:08:11,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 01:08:11,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:08:11,150 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 9 states. [2018-12-03 01:08:11,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:08:11,879 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-12-03 01:08:11,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 01:08:11,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-12-03 01:08:11,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:08:11,881 INFO L225 Difference]: With dead ends: 143 [2018-12-03 01:08:11,881 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 01:08:11,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-12-03 01:08:11,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 01:08:11,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 114. [2018-12-03 01:08:11,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 01:08:11,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-12-03 01:08:11,889 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 20 [2018-12-03 01:08:11,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:08:11,889 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-12-03 01:08:11,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 01:08:11,889 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-12-03 01:08:11,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 01:08:11,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:08:11,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:08:11,890 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:08:11,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:08:11,890 INFO L82 PathProgramCache]: Analyzing trace with hash -871985668, now seen corresponding path program 1 times [2018-12-03 01:08:11,890 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:08:11,890 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:08:11,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:08:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:08:11,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:08:11,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 9 treesize of output 12 [2018-12-03 01:08:11,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03 01:08:11,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:08:12,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:08:12,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 12 treesize of output 15 [2018-12-03 01:08:12,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:08:12,042 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-03 01:08:12,046 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 15 treesize of output 14 [2018-12-03 01:08:12,046 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 01:08:12,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:08:12,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:08:12,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 01:08:12,078 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-03 01:08:12,099 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:08:12,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:08:12,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:08:12,151 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:57, output treesize:179 [2018-12-03 01:08:12,276 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2018-12-03 01:08:12,306 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2018-12-03 01:08:12,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:08:12,365 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 49 treesize of output 42 [2018-12-03 01:08:12,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:08:12,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:08:12,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:42 [2018-12-03 01:08:15,956 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-03 01:08:15,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:08:15,968 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 64 treesize of output 67 [2018-12-03 01:08:15,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:08:16,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:08:16,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:08:16,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:08:16,077 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 63 treesize of output 54 [2018-12-03 01:08:16,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:08:16,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:08:16,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:08:16,164 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 64 treesize of output 56 [2018-12-03 01:08:16,164 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:08:16,264 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 2 case distinctions, treesize of input 56 treesize of output 59 [2018-12-03 01:08:16,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 01:08:16,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:08:16,356 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:129, output treesize:92 [2018-12-03 01:08:18,481 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-03 01:08:18,484 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-03 01:08:18,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:08:18,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:08:18,504 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-03 01:08:18,506 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-03 01:08:18,507 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:08:18,508 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:08:18,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:08:18,513 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:9 [2018-12-03 01:08:18,580 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-03 01:08:18,580 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:08:18,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:08:18,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 01:08:18,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 01:08:18,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 01:08:18,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=87, Unknown=3, NotChecked=0, Total=110 [2018-12-03 01:08:18,583 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 11 states. [2018-12-03 01:08:27,289 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2018-12-03 01:08:39,086 WARN L180 SmtUtils]: Spent 3.41 s on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-12-03 01:08:52,792 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2018-12-03 01:08:59,149 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 73 [2018-12-03 01:09:03,502 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 78 [2018-12-03 01:09:11,684 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-12-03 01:09:18,818 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-12-03 01:09:57,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:09:57,097 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2018-12-03 01:09:57,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 01:09:57,098 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 01:09:57,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:09:57,099 INFO L225 Difference]: With dead ends: 133 [2018-12-03 01:09:57,099 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 01:09:57,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=78, Invalid=249, Unknown=15, NotChecked=0, Total=342 [2018-12-03 01:09:57,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 01:09:57,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2018-12-03 01:09:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 01:09:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-12-03 01:09:57,103 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 20 [2018-12-03 01:09:57,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:09:57,104 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-12-03 01:09:57,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 01:09:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-12-03 01:09:57,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 01:09:57,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:09:57,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:09:57,104 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:09:57,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:09:57,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1261751943, now seen corresponding path program 1 times [2018-12-03 01:09:57,105 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:09:57,105 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:09:57,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:09:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:09:57,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:09:57,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:09:57,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:09:57,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:09:57,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 01:09:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:09:57,225 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:09:57,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:09:57,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 01:09:57,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 01:09:57,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 01:09:57,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:09:57,228 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 9 states. [2018-12-03 01:09:57,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:09:57,683 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2018-12-03 01:09:57,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 01:09:57,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-12-03 01:09:57,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:09:57,684 INFO L225 Difference]: With dead ends: 111 [2018-12-03 01:09:57,684 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 01:09:57,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 01:09:57,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 01:09:57,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 01:09:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 01:09:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2018-12-03 01:09:57,688 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 21 [2018-12-03 01:09:57,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:09:57,688 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-12-03 01:09:57,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 01:09:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2018-12-03 01:09:57,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 01:09:57,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:09:57,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:09:57,689 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:09:57,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:09:57,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1261751942, now seen corresponding path program 1 times [2018-12-03 01:09:57,689 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:09:57,689 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 01:09:57,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:09:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:09:57,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:09:57,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:09:57,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:09:57,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:09:57,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 01:09:57,865 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-03 01:09:57,865 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:09:57,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:09:57,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 01:09:57,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 01:09:57,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 01:09:57,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:09:57,868 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 10 states. [2018-12-03 01:09:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:09:58,416 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2018-12-03 01:09:58,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 01:09:58,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-12-03 01:09:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:09:58,417 INFO L225 Difference]: With dead ends: 109 [2018-12-03 01:09:58,417 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 01:09:58,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-12-03 01:09:58,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 01:09:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 01:09:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 01:09:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2018-12-03 01:09:58,422 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 21 [2018-12-03 01:09:58,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:09:58,422 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2018-12-03 01:09:58,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 01:09:58,423 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2018-12-03 01:09:58,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 01:09:58,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:09:58,423 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:09:58,424 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:09:58,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:09:58,424 INFO L82 PathProgramCache]: Analyzing trace with hash 755715794, now seen corresponding path program 1 times [2018-12-03 01:09:58,424 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:09:58,424 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:09:58,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:09:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:09:58,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:09:58,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 12 treesize of output 15 [2018-12-03 01:09:58,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:09:58,514 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-03 01:09:58,518 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 15 treesize of output 14 [2018-12-03 01:09:58,518 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:09:58,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:09:58,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:09:58,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 01:09:58,551 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 01:09:58,585 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:09:58,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:09:58,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:09:58,638 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:92 [2018-12-03 01:09:58,681 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-03 01:09:58,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:09:58,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 17 treesize of output 13 [2018-12-03 01:09:58,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:09:58,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-03 01:09:58,698 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:09:58,699 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:09:58,702 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-03 01:09:58,702 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:30, output treesize:7 [2018-12-03 01:09:58,720 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 24 treesize of output 18 [2018-12-03 01:09:58,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:09:58,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-03 01:09:58,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:09:58,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:09:58,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:09:58,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-12-03 01:09:58,755 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-03 01:09:58,756 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:09:58,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:09:58,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:09:58,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:09:58,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:09:58,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:09:58,759 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 7 states. [2018-12-03 01:09:59,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:09:59,540 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2018-12-03 01:09:59,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 01:09:59,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-03 01:09:59,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:09:59,541 INFO L225 Difference]: With dead ends: 141 [2018-12-03 01:09:59,541 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 01:09:59,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-12-03 01:09:59,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 01:09:59,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2018-12-03 01:09:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 01:09:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-12-03 01:09:59,545 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 21 [2018-12-03 01:09:59,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:09:59,545 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-12-03 01:09:59,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:09:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-12-03 01:09:59,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 01:09:59,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:09:59,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:09:59,545 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:09:59,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:09:59,546 INFO L82 PathProgramCache]: Analyzing trace with hash 755715795, now seen corresponding path program 1 times [2018-12-03 01:09:59,546 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:09:59,546 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 01:09:59,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:09:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:09:59,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:09:59,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 9 treesize of output 12 [2018-12-03 01:09:59,613 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-03 01:09:59,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:09:59,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:09:59,634 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-03 01:09:59,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:46 [2018-12-03 01:09:59,676 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-03 01:09:59,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:09:59,697 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-03 01:09:59,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:09:59,700 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 13 treesize of output 6 [2018-12-03 01:09:59,700 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:09:59,702 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:09:59,715 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-03 01:09:59,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:09:59,718 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 13 treesize of output 6 [2018-12-03 01:09:59,718 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 01:09:59,719 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:09:59,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:09:59,725 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:50, output treesize:13 [2018-12-03 01:09:59,750 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-03 01:09:59,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-03 01:09:59,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:09:59,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:09:59,765 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-03 01:09:59,767 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-03 01:09:59,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:09:59,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:09:59,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:09:59,774 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:9 [2018-12-03 01:09:59,796 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-03 01:09:59,796 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:09:59,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:09:59,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:09:59,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:09:59,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:09:59,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:09:59,799 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 7 states. [2018-12-03 01:10:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:00,455 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2018-12-03 01:10:00,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 01:10:00,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-03 01:10:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:00,456 INFO L225 Difference]: With dead ends: 152 [2018-12-03 01:10:00,456 INFO L226 Difference]: Without dead ends: 150 [2018-12-03 01:10:00,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-03 01:10:00,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-03 01:10:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137. [2018-12-03 01:10:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-03 01:10:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2018-12-03 01:10:00,460 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 21 [2018-12-03 01:10:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:00,460 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2018-12-03 01:10:00,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:10:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2018-12-03 01:10:00,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 01:10:00,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:00,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:00,460 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:10:00,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:00,461 INFO L82 PathProgramCache]: Analyzing trace with hash 626633076, now seen corresponding path program 1 times [2018-12-03 01:10:00,461 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:10:00,461 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:10:00,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:00,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:10:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:00,503 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:10:00,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:00,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:10:00,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:10:00,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:10:00,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:10:00,505 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 5 states. [2018-12-03 01:10:00,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:00,513 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2018-12-03 01:10:00,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:10:00,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-03 01:10:00,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:00,514 INFO L225 Difference]: With dead ends: 126 [2018-12-03 01:10:00,514 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 01:10:00,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-03 01:10:00,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 01:10:00,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-12-03 01:10:00,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 01:10:00,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2018-12-03 01:10:00,517 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 21 [2018-12-03 01:10:00,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:00,517 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2018-12-03 01:10:00,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:10:00,517 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2018-12-03 01:10:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 01:10:00,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:00,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:00,518 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:10:00,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:00,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1362839012, now seen corresponding path program 1 times [2018-12-03 01:10:00,518 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:10:00,518 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 01:10:00,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:00,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:10:00,604 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 9 treesize of output 7 [2018-12-03 01:10:00,606 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-03 01:10:00,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:00,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:00,607 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-03 01:10:00,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:1 [2018-12-03 01:10:00,623 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-03 01:10:00,623 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:10:00,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:00,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:10:00,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:10:00,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:10:00,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:10:00,626 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand 6 states. [2018-12-03 01:10:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:01,170 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2018-12-03 01:10:01,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 01:10:01,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-03 01:10:01,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:01,171 INFO L225 Difference]: With dead ends: 133 [2018-12-03 01:10:01,171 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 01:10:01,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:10:01,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 01:10:01,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2018-12-03 01:10:01,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 01:10:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2018-12-03 01:10:01,175 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 23 [2018-12-03 01:10:01,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:01,175 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2018-12-03 01:10:01,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:10:01,175 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2018-12-03 01:10:01,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 01:10:01,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:01,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:01,176 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:10:01,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:01,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1362839011, now seen corresponding path program 1 times [2018-12-03 01:10:01,176 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:10:01,176 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:10:01,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:01,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:10:01,315 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-03 01:10:01,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-12-03 01:10:01,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:01,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:01,332 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-03 01:10:01,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-12-03 01:10:01,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:01,338 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:01,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:01,342 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:10 [2018-12-03 01:10:01,412 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-03 01:10:01,413 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:10:01,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:01,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 01:10:01,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 01:10:01,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 01:10:01,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:10:01,415 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand 9 states. [2018-12-03 01:10:02,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:02,266 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-12-03 01:10:02,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 01:10:02,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-12-03 01:10:02,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:02,268 INFO L225 Difference]: With dead ends: 130 [2018-12-03 01:10:02,268 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 01:10:02,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-12-03 01:10:02,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 01:10:02,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2018-12-03 01:10:02,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 01:10:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-12-03 01:10:02,270 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 23 [2018-12-03 01:10:02,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:02,270 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-12-03 01:10:02,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 01:10:02,271 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-12-03 01:10:02,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 01:10:02,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:02,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:02,271 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:10:02,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:02,271 INFO L82 PathProgramCache]: Analyzing trace with hash -992923394, now seen corresponding path program 1 times [2018-12-03 01:10:02,271 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:10:02,271 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 01:10:02,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:02,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:10:02,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 12 treesize of output 15 [2018-12-03 01:10:02,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:02,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-03 01:10:02,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:02,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:02,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 01:10:02,374 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 01:10:02,415 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 15 treesize of output 14 [2018-12-03 01:10:02,416 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:02,443 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:10:02,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:10:02,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:10:02,494 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:92 [2018-12-03 01:10:02,534 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-03 01:10:02,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:02,547 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-03 01:10:02,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:02,550 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 13 treesize of output 6 [2018-12-03 01:10:02,550 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:02,551 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:02,554 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-03 01:10:02,554 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:30, output treesize:7 [2018-12-03 01:10:02,572 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 24 treesize of output 18 [2018-12-03 01:10:02,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:02,576 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 18 treesize of output 10 [2018-12-03 01:10:02,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:02,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:02,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:02,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-12-03 01:10:02,614 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-03 01:10:02,614 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:10:02,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:02,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 01:10:02,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 01:10:02,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 01:10:02,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:10:02,616 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 9 states. [2018-12-03 01:10:03,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:03,656 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2018-12-03 01:10:03,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 01:10:03,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-12-03 01:10:03,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:03,657 INFO L225 Difference]: With dead ends: 141 [2018-12-03 01:10:03,657 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 01:10:03,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-12-03 01:10:03,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 01:10:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 128. [2018-12-03 01:10:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 01:10:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2018-12-03 01:10:03,661 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 26 [2018-12-03 01:10:03,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:03,661 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2018-12-03 01:10:03,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 01:10:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2018-12-03 01:10:03,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 01:10:03,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:03,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:03,662 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:10:03,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:03,662 INFO L82 PathProgramCache]: Analyzing trace with hash -992923393, now seen corresponding path program 1 times [2018-12-03 01:10:03,662 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:10:03,663 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:10:03,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:03,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:10:03,749 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-03 01:10:03,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:03,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-03 01:10:03,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:03,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:03,765 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-03 01:10:03,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:03,768 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 13 treesize of output 6 [2018-12-03 01:10:03,768 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:03,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:03,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:03,774 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:10 [2018-12-03 01:10:03,789 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 24 treesize of output 18 [2018-12-03 01:10:03,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:03,792 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 18 treesize of output 10 [2018-12-03 01:10:03,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:03,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:03,807 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 24 treesize of output 18 [2018-12-03 01:10:03,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:03,810 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 18 treesize of output 10 [2018-12-03 01:10:03,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:03,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:03,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:03,817 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:10 [2018-12-03 01:10:03,842 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-03 01:10:03,842 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:10:03,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:03,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 01:10:03,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:10:03,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:10:03,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:10:03,844 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand 7 states. [2018-12-03 01:10:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:04,275 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2018-12-03 01:10:04,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 01:10:04,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-03 01:10:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:04,276 INFO L225 Difference]: With dead ends: 118 [2018-12-03 01:10:04,276 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 01:10:04,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-03 01:10:04,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 01:10:04,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-12-03 01:10:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 01:10:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-12-03 01:10:04,278 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 26 [2018-12-03 01:10:04,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:04,278 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-12-03 01:10:04,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:10:04,278 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-12-03 01:10:04,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 01:10:04,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:04,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:04,279 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:10:04,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:04,279 INFO L82 PathProgramCache]: Analyzing trace with hash -787755985, now seen corresponding path program 1 times [2018-12-03 01:10:04,279 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:10:04,279 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 01:10:04,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:04,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:10:04,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 12 treesize of output 15 [2018-12-03 01:10:04,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:04,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-03 01:10:04,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:04,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:04,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 01:10:04,371 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 01:10:04,403 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 15 treesize of output 14 [2018-12-03 01:10:04,403 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:04,426 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:10:04,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:10:04,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:10:04,474 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:92 [2018-12-03 01:10:04,517 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-03 01:10:04,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:04,528 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-03 01:10:04,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:04,532 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 13 treesize of output 6 [2018-12-03 01:10:04,532 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:04,533 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:04,536 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-03 01:10:04,536 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:30, output treesize:7 [2018-12-03 01:10:04,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 7 treesize of output 1 [2018-12-03 01:10:04,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:04,564 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-03 01:10:04,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:04,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-03 01:10:04,568 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:04,569 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:04,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-03 01:10:04,572 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:30, output treesize:7 [2018-12-03 01:10:04,615 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-03 01:10:04,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:04,618 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 13 treesize of output 6 [2018-12-03 01:10:04,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:04,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:04,621 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-03 01:10:04,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:5 [2018-12-03 01:10:04,647 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-03 01:10:04,647 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:10:04,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:04,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 01:10:04,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 01:10:04,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 01:10:04,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-03 01:10:04,649 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 11 states. [2018-12-03 01:10:05,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:05,680 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-12-03 01:10:05,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 01:10:05,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-12-03 01:10:05,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:05,681 INFO L225 Difference]: With dead ends: 141 [2018-12-03 01:10:05,681 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 01:10:05,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2018-12-03 01:10:05,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 01:10:05,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 126. [2018-12-03 01:10:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 01:10:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-12-03 01:10:05,684 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 28 [2018-12-03 01:10:05,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:05,684 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-12-03 01:10:05,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 01:10:05,684 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-12-03 01:10:05,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 01:10:05,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:05,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:05,685 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:10:05,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:05,685 INFO L82 PathProgramCache]: Analyzing trace with hash -787755984, now seen corresponding path program 1 times [2018-12-03 01:10:05,686 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:10:05,686 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:10:05,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:05,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:10:05,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 9 treesize of output 12 [2018-12-03 01:10:05,767 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-03 01:10:05,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:05,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:05,783 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-03 01:10:05,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:30 [2018-12-03 01:10:05,812 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-03 01:10:05,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:05,825 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-03 01:10:05,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:05,828 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 13 treesize of output 6 [2018-12-03 01:10:05,828 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:05,829 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:05,836 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-03 01:10:05,837 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:10 [2018-12-03 01:10:05,855 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-03 01:10:05,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:05,859 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 13 treesize of output 6 [2018-12-03 01:10:05,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:05,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:05,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:05,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:12 [2018-12-03 01:10:05,927 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-03 01:10:05,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:05,929 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 13 treesize of output 6 [2018-12-03 01:10:05,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:05,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:05,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:05,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-12-03 01:10:05,976 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-03 01:10:05,976 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:10:05,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:05,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 01:10:05,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 01:10:05,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 01:10:05,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-03 01:10:05,978 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 12 states. [2018-12-03 01:10:06,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:06,813 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-12-03 01:10:06,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 01:10:06,814 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-12-03 01:10:06,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:06,814 INFO L225 Difference]: With dead ends: 126 [2018-12-03 01:10:06,814 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 01:10:06,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-12-03 01:10:06,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 01:10:06,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 01:10:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 01:10:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2018-12-03 01:10:06,817 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 28 [2018-12-03 01:10:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:06,817 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-12-03 01:10:06,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 01:10:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2018-12-03 01:10:06,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 01:10:06,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:06,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:06,818 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:10:06,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:06,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1950839153, now seen corresponding path program 1 times [2018-12-03 01:10:06,818 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:10:06,818 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 01:10:06,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:06,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:10:06,931 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 9 treesize of output 7 [2018-12-03 01:10:06,932 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-03 01:10:06,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:06,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:06,938 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 9 treesize of output 7 [2018-12-03 01:10:06,939 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-03 01:10:06,939 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:06,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:06,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:06,941 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-12-03 01:10:06,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:10:06,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:06,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:06,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 01:10:07,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 11 treesize of output 8 [2018-12-03 01:10:07,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:10:07,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:07,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:07,139 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-03 01:10:07,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-12-03 01:10:07,253 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-03 01:10:07,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-03 01:10:07,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:07,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:07,259 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-03 01:10:07,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-12-03 01:10:07,293 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-03 01:10:07,293 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:10:07,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:07,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-03 01:10:07,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 01:10:07,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 01:10:07,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-12-03 01:10:07,296 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 16 states. [2018-12-03 01:10:09,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:09,007 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-12-03 01:10:09,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 01:10:09,008 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-12-03 01:10:09,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:09,008 INFO L225 Difference]: With dead ends: 117 [2018-12-03 01:10:09,008 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 01:10:09,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2018-12-03 01:10:09,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 01:10:09,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2018-12-03 01:10:09,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 01:10:09,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-12-03 01:10:09,011 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 35 [2018-12-03 01:10:09,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:09,011 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-12-03 01:10:09,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 01:10:09,011 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-12-03 01:10:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 01:10:09,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:09,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:09,011 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:10:09,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:09,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1950839154, now seen corresponding path program 1 times [2018-12-03 01:10:09,012 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:10:09,012 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:10:09,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:09,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:10:09,149 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 9 treesize of output 7 [2018-12-03 01:10:09,150 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-03 01:10:09,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:09,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:09,156 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 9 treesize of output 7 [2018-12-03 01:10:09,157 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-03 01:10:09,157 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:09,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:09,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:09,159 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-12-03 01:10:09,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03 01:10:09,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:09,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:09,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-03 01:10:09,314 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-03 01:10:09,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 01:10:09,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:09,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:09,336 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-03 01:10:09,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:10:09,339 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:09,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:09,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:10:09,353 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:25 [2018-12-03 01:10:09,493 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-03 01:10:09,495 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-03 01:10:09,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:09,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:09,504 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-03 01:10:09,505 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-03 01:10:09,505 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:09,507 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:09,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:09,510 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-03 01:10:09,550 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-03 01:10:09,550 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:10:09,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:09,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-03 01:10:09,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 01:10:09,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 01:10:09,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-12-03 01:10:09,554 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 16 states. [2018-12-03 01:10:11,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:11,543 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-12-03 01:10:11,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 01:10:11,544 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-12-03 01:10:11,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:11,544 INFO L225 Difference]: With dead ends: 102 [2018-12-03 01:10:11,544 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 01:10:11,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2018-12-03 01:10:11,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 01:10:11,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2018-12-03 01:10:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 01:10:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2018-12-03 01:10:11,547 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 35 [2018-12-03 01:10:11,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:11,548 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2018-12-03 01:10:11,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 01:10:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2018-12-03 01:10:11,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 01:10:11,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:11,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:11,548 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:10:11,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:11,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1221797440, now seen corresponding path program 1 times [2018-12-03 01:10:11,549 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:10:11,549 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 01:10:11,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:11,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:10:11,690 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 9 treesize of output 7 [2018-12-03 01:10:11,692 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-03 01:10:11,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:11,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:11,700 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 9 treesize of output 7 [2018-12-03 01:10:11,702 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-03 01:10:11,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:11,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:11,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:11,710 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-12-03 01:10:11,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 01:10:11,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:11,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:11,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-03 01:10:11,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 01:10:11,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 01:10:11,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:11,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:11,890 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-03 01:10:11,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:10:11,893 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:11,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:11,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:10:11,906 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-12-03 01:10:12,053 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-03 01:10:12,055 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-03 01:10:12,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:12,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:12,064 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-03 01:10:12,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-03 01:10:12,065 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:12,067 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:12,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:12,070 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-03 01:10:12,171 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-03 01:10:12,171 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:10:12,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:12,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-03 01:10:12,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 01:10:12,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 01:10:12,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-12-03 01:10:12,174 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 18 states. [2018-12-03 01:10:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:14,348 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2018-12-03 01:10:14,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 01:10:14,348 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-12-03 01:10:14,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:14,348 INFO L225 Difference]: With dead ends: 100 [2018-12-03 01:10:14,349 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 01:10:14,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 01:10:14,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 01:10:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-12-03 01:10:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 01:10:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2018-12-03 01:10:14,351 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 40 [2018-12-03 01:10:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:14,351 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2018-12-03 01:10:14,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 01:10:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-12-03 01:10:14,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 01:10:14,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:14,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:14,351 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:10:14,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:14,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1034005355, now seen corresponding path program 1 times [2018-12-03 01:10:14,352 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:10:14,352 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:10:14,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:14,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:10:14,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 12 treesize of output 15 [2018-12-03 01:10:14,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:14,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-03 01:10:14,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:14,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:14,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 01:10:14,576 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 01:10:14,601 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 15 treesize of output 14 [2018-12-03 01:10:14,602 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:14,620 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:10:14,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:10:14,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:10:14,662 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:128 [2018-12-03 01:10:14,709 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 9 treesize of output 7 [2018-12-03 01:10:14,711 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-03 01:10:14,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:14,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:14,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:14,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:27 [2018-12-03 01:10:14,746 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-03 01:10:14,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:14,758 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-03 01:10:14,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:14,760 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 13 treesize of output 6 [2018-12-03 01:10:14,760 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:14,761 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:14,765 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-03 01:10:14,765 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:10 [2018-12-03 01:10:14,981 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-03 01:10:14,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:10:14,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:14,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:15,007 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-03 01:10:15,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-12-03 01:10:15,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-03 01:10:15,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:15,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 01:10:15,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:15,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:15,123 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-03 01:10:15,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-12-03 01:10:15,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-03 01:10:15,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-03 01:10:15,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:15,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:15,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 49 [2018-12-03 01:10:15,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:15,322 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 2 case distinctions, treesize of input 35 treesize of output 44 [2018-12-03 01:10:15,322 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 01:10:15,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-12-03 01:10:15,441 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:15,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:10:15,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 01:10:15,549 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:49, output treesize:88 [2018-12-03 01:10:15,878 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2018-12-03 01:10:15,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:15,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:15,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 17 treesize of output 8 [2018-12-03 01:10:15,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:16,003 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 32 treesize of output 26 [2018-12-03 01:10:16,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:16,006 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 26 treesize of output 18 [2018-12-03 01:10:16,007 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:16,012 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:16,025 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-03 01:10:16,025 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:84, output treesize:56 [2018-12-03 01:10:16,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-12-03 01:10:16,136 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-03 01:10:16,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:16,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:16,153 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-03 01:10:16,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:50 [2018-12-03 01:10:16,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 27 [2018-12-03 01:10:16,395 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-03 01:10:16,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:16,401 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 6 treesize of output 4 [2018-12-03 01:10:16,401 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:16,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:16,405 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-03 01:10:16,405 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:7 [2018-12-03 01:10:16,526 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-03 01:10:16,526 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:10:16,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:16,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-12-03 01:10:16,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 01:10:16,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 01:10:16,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2018-12-03 01:10:16,530 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 27 states. [2018-12-03 01:10:18,744 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2018-12-03 01:10:19,048 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-12-03 01:10:19,293 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2018-12-03 01:10:21,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:21,684 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 01:10:21,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 01:10:21,685 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 44 [2018-12-03 01:10:21,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:21,685 INFO L225 Difference]: With dead ends: 100 [2018-12-03 01:10:21,685 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 01:10:21,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=303, Invalid=2453, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 01:10:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 01:10:21,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-12-03 01:10:21,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 01:10:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2018-12-03 01:10:21,687 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 44 [2018-12-03 01:10:21,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:21,688 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2018-12-03 01:10:21,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 01:10:21,688 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2018-12-03 01:10:21,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 01:10:21,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:21,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:21,689 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:10:21,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:21,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1034005356, now seen corresponding path program 1 times [2018-12-03 01:10:21,689 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:10:21,689 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:10:21,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:21,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:10:21,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 12 treesize of output 15 [2018-12-03 01:10:21,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:21,954 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-03 01:10:21,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:21,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:21,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 01:10:21,971 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 01:10:22,012 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 15 treesize of output 14 [2018-12-03 01:10:22,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:22,045 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:10:22,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:10:22,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 9 treesize of output 12 [2018-12-03 01:10:22,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, 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-03 01:10:22,140 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:22,146 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:22,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:10:22,176 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:57, output treesize:179 [2018-12-03 01:10:22,303 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2018-12-03 01:10:22,323 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 65 treesize of output 60 [2018-12-03 01:10:22,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:22,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:22,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:22,400 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 60 treesize of output 52 [2018-12-03 01:10:22,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:22,461 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2018-12-03 01:10:22,461 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:22,512 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 55 treesize of output 48 [2018-12-03 01:10:22,512 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:22,562 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 48 treesize of output 44 [2018-12-03 01:10:22,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:22,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-03 01:10:22,566 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:22,578 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:22,628 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 52 treesize of output 48 [2018-12-03 01:10:22,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:22,633 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 13 treesize of output 6 [2018-12-03 01:10:22,633 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:22,654 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:22,712 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 32 treesize of output 28 [2018-12-03 01:10:22,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:22,716 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 13 treesize of output 6 [2018-12-03 01:10:22,716 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:22,725 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:22,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:22,757 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:131, output treesize:16 [2018-12-03 01:10:23,816 WARN L180 SmtUtils]: Spent 990.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 01:10:24,712 WARN L180 SmtUtils]: Spent 879.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-03 01:10:25,702 WARN L180 SmtUtils]: Spent 966.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-03 01:10:25,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:10:25,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:25,717 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-03 01:10:25,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:25,725 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-03 01:10:25,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:10 [2018-12-03 01:10:25,910 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-03 01:10:25,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 01:10:25,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:25,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:25,948 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-03 01:10:25,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:10:25,951 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:25,955 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:25,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:25,977 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-12-03 01:10:26,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-03 01:10:26,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:26,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 01:10:26,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:26,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-03 01:10:26,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:26,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 01:10:26,130 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:26,143 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:26,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:26,177 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-12-03 01:10:26,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-12-03 01:10:26,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:26,367 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 2 case distinctions, treesize of input 24 treesize of output 49 [2018-12-03 01:10:26,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 01:10:26,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2018-12-03 01:10:26,504 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:26,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:10:26,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 83 [2018-12-03 01:10:26,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:26,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 90 [2018-12-03 01:10:26,745 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-03 01:10:26,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 65 [2018-12-03 01:10:26,985 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:27,096 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:10:27,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2018-12-03 01:10:27,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:27,120 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 45 treesize of output 72 [2018-12-03 01:10:27,121 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:29,158 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:29,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:10:29,281 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:58, output treesize:207 [2018-12-03 01:10:29,496 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-03 01:10:29,829 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2018-12-03 01:10:29,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:30,004 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 2 case distinctions, treesize of input 128 treesize of output 139 [2018-12-03 01:10:30,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-03 01:10:30,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:30,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:30,338 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 129 treesize of output 121 [2018-12-03 01:10:30,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:30,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:30,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:30,345 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 131 treesize of output 123 [2018-12-03 01:10:30,346 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:30,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:30,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:30,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:30,643 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 128 treesize of output 119 [2018-12-03 01:10:30,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:30,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 122 [2018-12-03 01:10:30,907 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:31,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 116 [2018-12-03 01:10:31,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:31,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-03 01:10:31,160 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:31,215 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:31,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 117 [2018-12-03 01:10:31,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:31,433 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 22 treesize of output 14 [2018-12-03 01:10:31,433 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:31,472 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:31,475 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 121 treesize of output 115 [2018-12-03 01:10:31,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:31,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-03 01:10:31,479 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:31,519 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:31,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 100 [2018-12-03 01:10:31,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:31,707 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 22 treesize of output 14 [2018-12-03 01:10:31,707 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:31,736 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:31,929 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 103 treesize of output 97 [2018-12-03 01:10:31,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:31,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-03 01:10:31,934 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:31,962 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:31,965 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 101 treesize of output 95 [2018-12-03 01:10:31,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:31,969 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 22 treesize of output 14 [2018-12-03 01:10:31,969 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:31,995 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:32,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:10:32,144 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 12 variables, input treesize:257, output treesize:233 [2018-12-03 01:10:32,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:32,699 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 01:10:32,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 84 [2018-12-03 01:10:32,707 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 01:10:32,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 25 [2018-12-03 01:10:32,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:32,722 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-03 01:10:32,722 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:32,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:32,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 44 [2018-12-03 01:10:32,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2018-12-03 01:10:32,749 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:32,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 5 treesize of output 1 [2018-12-03 01:10:32,758 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:32,762 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:32,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:32,766 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:123, output treesize:9 [2018-12-03 01:10:32,934 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-03 01:10:32,934 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:10:32,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:32,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-12-03 01:10:32,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 01:10:32,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 01:10:32,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-12-03 01:10:32,938 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 26 states. [2018-12-03 01:10:33,156 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2018-12-03 01:10:34,690 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2018-12-03 01:10:39,163 WARN L180 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-12-03 01:10:41,929 WARN L180 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-12-03 01:10:44,733 WARN L180 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-12-03 01:10:45,156 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-12-03 01:10:45,519 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-12-03 01:10:45,942 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2018-12-03 01:10:47,292 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2018-12-03 01:10:47,946 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 77 [2018-12-03 01:10:48,383 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2018-12-03 01:10:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:51,880 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 01:10:51,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 01:10:51,881 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 44 [2018-12-03 01:10:51,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:51,881 INFO L225 Difference]: With dead ends: 99 [2018-12-03 01:10:51,881 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 01:10:51,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=274, Invalid=2269, Unknown=7, NotChecked=0, Total=2550 [2018-12-03 01:10:51,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 01:10:51,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-12-03 01:10:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 01:10:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-12-03 01:10:51,884 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 44 [2018-12-03 01:10:51,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:51,884 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-12-03 01:10:51,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 01:10:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-12-03 01:10:51,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 01:10:51,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:51,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:51,885 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:10:51,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:51,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1989394924, now seen corresponding path program 1 times [2018-12-03 01:10:51,886 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:10:51,886 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 01:10:51,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:52,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:10:52,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 12 treesize of output 15 [2018-12-03 01:10:52,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:52,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-03 01:10:52,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:52,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:52,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 01:10:52,164 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 01:10:52,190 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 15 treesize of output 14 [2018-12-03 01:10:52,190 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:52,211 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:10:52,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:10:52,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:10:52,254 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:128 [2018-12-03 01:10:52,301 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 9 treesize of output 7 [2018-12-03 01:10:52,303 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-03 01:10:52,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:52,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:52,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:52,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:27 [2018-12-03 01:10:52,331 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-03 01:10:52,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:52,342 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-03 01:10:52,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:52,345 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 13 treesize of output 6 [2018-12-03 01:10:52,345 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:52,346 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:52,349 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-03 01:10:52,349 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:10 [2018-12-03 01:10:52,548 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-03 01:10:52,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:10:52,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:52,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:52,579 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-03 01:10:52,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-12-03 01:10:52,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-12-03 01:10:52,705 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 19 treesize of output 20 [2018-12-03 01:10:52,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:52,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-12-03 01:10:52,757 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:52,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:52,809 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 14 [2018-12-03 01:10:52,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-03 01:10:52,812 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:52,816 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:52,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:10:52,835 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:40, output treesize:38 [2018-12-03 01:10:53,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:53,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:53,049 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-03 01:10:53,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:53,070 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 17 treesize of output 13 [2018-12-03 01:10:53,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:53,074 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 13 treesize of output 6 [2018-12-03 01:10:53,074 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:53,076 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:53,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:10:53,089 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:70, output treesize:46 [2018-12-03 01:10:53,194 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 25 treesize of output 13 [2018-12-03 01:10:53,196 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-03 01:10:53,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:53,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:53,210 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-03 01:10:53,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:47 [2018-12-03 01:10:53,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2018-12-03 01:10:53,403 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-03 01:10:53,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:53,409 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 21 treesize of output 12 [2018-12-03 01:10:53,409 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:53,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:53,417 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-03 01:10:53,417 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:46, output treesize:7 [2018-12-03 01:10:53,525 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-03 01:10:53,525 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:10:53,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:53,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-12-03 01:10:53,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 01:10:53,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 01:10:53,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2018-12-03 01:10:53,528 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 26 states. [2018-12-03 01:10:55,412 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2018-12-03 01:10:57,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:57,649 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-03 01:10:57,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 01:10:57,650 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-12-03 01:10:57,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:57,650 INFO L225 Difference]: With dead ends: 98 [2018-12-03 01:10:57,650 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 01:10:57,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=292, Invalid=2257, Unknown=1, NotChecked=0, Total=2550 [2018-12-03 01:10:57,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 01:10:57,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-12-03 01:10:57,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 01:10:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-03 01:10:57,653 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 45 [2018-12-03 01:10:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:57,653 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-03 01:10:57,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 01:10:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-03 01:10:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 01:10:57,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:57,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:57,654 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:10:57,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:57,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1989394925, now seen corresponding path program 1 times [2018-12-03 01:10:57,654 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:10:57,654 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:10:57,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:57,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:10:57,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 01:10:57,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:57,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-03 01:10:57,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:57,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:57,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 01:10:57,991 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 01:10:58,037 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 15 treesize of output 14 [2018-12-03 01:10:58,038 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:58,073 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:10:58,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:10:58,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 9 treesize of output 12 [2018-12-03 01:10:58,158 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-03 01:10:58,158 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:58,164 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:58,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:10:58,196 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:50, output treesize:158 [2018-12-03 01:10:58,302 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2018-12-03 01:10:58,305 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 46 treesize of output 44 [2018-12-03 01:10:58,307 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-03 01:10:58,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:58,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:58,360 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 46 treesize of output 44 [2018-12-03 01:10:58,363 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-03 01:10:58,363 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:58,374 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:58,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:10:58,412 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:75 [2018-12-03 01:10:58,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:58,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:58,484 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 46 treesize of output 38 [2018-12-03 01:10:58,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:58,539 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 46 treesize of output 39 [2018-12-03 01:10:58,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:58,596 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 38 treesize of output 33 [2018-12-03 01:10:58,597 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:58,639 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-12-03 01:10:58,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:58,677 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 25 [2018-12-03 01:10:58,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:10:58,679 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 13 treesize of output 6 [2018-12-03 01:10:58,680 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:10:58,685 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:58,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:10:58,702 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:93, output treesize:13 [2018-12-03 01:10:59,708 WARN L180 SmtUtils]: Spent 975.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 01:11:00,618 WARN L180 SmtUtils]: Spent 890.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 01:11:01,623 WARN L180 SmtUtils]: Spent 984.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 01:11:01,625 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-03 01:11:01,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:01,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:11:01,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:01,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:01,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:18, output treesize:7 [2018-12-03 01:11:01,801 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-03 01:11:01,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 01:11:01,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:01,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:01,849 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-03 01:11:01,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 10 treesize of output 9 [2018-12-03 01:11:01,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:01,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:01,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:01,879 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-12-03 01:11:01,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-12-03 01:11:01,987 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 22 treesize of output 27 [2018-12-03 01:11:01,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:02,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:02,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 62 [2018-12-03 01:11:02,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2018-12-03 01:11:02,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:02,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 51 [2018-12-03 01:11:02,219 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-03 01:11:02,314 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:11:02,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:11:02,358 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:44, output treesize:95 [2018-12-03 01:11:02,626 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2018-12-03 01:11:02,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:02,737 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 90 treesize of output 97 [2018-12-03 01:11:02,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:02,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:02,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:02,888 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 90 treesize of output 82 [2018-12-03 01:11:02,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:03,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:03,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:03,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:03,009 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 93 treesize of output 84 [2018-12-03 01:11:03,010 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:03,142 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 2 case distinctions, treesize of input 82 treesize of output 89 [2018-12-03 01:11:03,142 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 01:11:03,306 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 85 treesize of output 81 [2018-12-03 01:11:03,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:03,311 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 13 treesize of output 6 [2018-12-03 01:11:03,311 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:03,336 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:03,339 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 83 treesize of output 79 [2018-12-03 01:11:03,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:03,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-03 01:11:03,344 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:03,369 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:03,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2018-12-03 01:11:03,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:03,497 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 13 treesize of output 6 [2018-12-03 01:11:03,497 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:03,520 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:03,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:11:03,627 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 10 variables, input treesize:181, output treesize:187 [2018-12-03 01:11:06,076 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 01:11:06,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 73 [2018-12-03 01:11:06,084 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 01:11:06,084 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-12-03 01:11:06,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:06,100 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-03 01:11:06,100 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:06,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:06,121 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 01:11:06,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-12-03 01:11:06,127 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 19 treesize of output 10 [2018-12-03 01:11:06,127 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:06,134 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-03 01:11:06,135 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:06,138 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:06,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:06,143 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:105, output treesize:9 [2018-12-03 01:11:06,297 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-03 01:11:06,298 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:11:06,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:11:06,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-12-03 01:11:06,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 01:11:06,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 01:11:06,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=575, Unknown=3, NotChecked=0, Total=650 [2018-12-03 01:11:06,301 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 26 states. [2018-12-03 01:11:06,506 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-12-03 01:11:06,783 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2018-12-03 01:11:09,700 WARN L180 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-12-03 01:11:13,540 WARN L180 SmtUtils]: Spent 3.68 s on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-12-03 01:11:16,237 WARN L180 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-12-03 01:11:16,626 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2018-12-03 01:11:16,954 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-12-03 01:11:17,293 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2018-12-03 01:11:18,214 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-12-03 01:11:21,803 WARN L180 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 55 [2018-12-03 01:11:36,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:11:36,438 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 01:11:36,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 01:11:36,439 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-12-03 01:11:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:11:36,439 INFO L225 Difference]: With dead ends: 97 [2018-12-03 01:11:36,439 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 01:11:36,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=274, Invalid=2164, Unknown=12, NotChecked=0, Total=2450 [2018-12-03 01:11:36,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 01:11:36,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 01:11:36,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 01:11:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-03 01:11:36,441 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 45 [2018-12-03 01:11:36,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:11:36,441 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-03 01:11:36,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 01:11:36,441 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-03 01:11:36,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 01:11:36,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:11:36,442 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:11:36,442 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:11:36,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:11:36,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1073148402, now seen corresponding path program 1 times [2018-12-03 01:11:36,443 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:11:36,443 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:11:36,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:11:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:11:36,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:11:36,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 12 treesize of output 15 [2018-12-03 01:11:36,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:36,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-03 01:11:36,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, 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 14 [2018-12-03 01:11:36,719 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:36,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:36,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:36,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 01:11:36,745 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 01:11:36,764 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:11:36,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:11:36,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:11:36,808 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:128 [2018-12-03 01:11:36,853 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 9 treesize of output 7 [2018-12-03 01:11:36,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-03 01:11:36,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:36,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:36,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:36,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:27 [2018-12-03 01:11:36,886 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-03 01:11:36,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:36,897 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-03 01:11:36,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:36,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-03 01:11:36,899 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:36,901 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:36,904 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-03 01:11:36,905 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:10 [2018-12-03 01:11:37,135 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-03 01:11:37,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:11:37,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:37,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:37,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-03 01:11:37,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-12-03 01:11:37,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-03 01:11:37,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:37,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 01:11:37,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:37,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:37,280 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-03 01:11:37,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:36 [2018-12-03 01:11:37,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-12-03 01:11:37,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:37,432 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 2 case distinctions, treesize of input 24 treesize of output 37 [2018-12-03 01:11:37,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 01:11:37,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-12-03 01:11:37,527 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:37,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:11:37,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 01:11:37,616 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:38, output treesize:68 [2018-12-03 01:11:37,931 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2018-12-03 01:11:38,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:38,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:38,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-03 01:11:38,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:38,048 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-03 01:11:38,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:38,065 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 32 treesize of output 26 [2018-12-03 01:11:38,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:38,069 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 26 treesize of output 18 [2018-12-03 01:11:38,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:38,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:38,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:38,084 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:34 [2018-12-03 01:11:38,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-12-03 01:11:38,436 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 6 treesize of output 4 [2018-12-03 01:11:38,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:38,443 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 11 treesize of output 1 [2018-12-03 01:11:38,443 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:38,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:38,447 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-03 01:11:38,447 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:11 [2018-12-03 01:11:38,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2018-12-03 01:11:38,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 21 [2018-12-03 01:11:38,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 01:11:38,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 4 [2018-12-03 01:11:38,723 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:38,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:11:38,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 01:11:38,761 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:51 [2018-12-03 01:11:38,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:38,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03 01:11:38,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:38,930 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-03 01:11:38,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2018-12-03 01:11:39,012 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-03 01:11:39,012 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:11:39,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:11:39,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2018-12-03 01:11:39,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 01:11:39,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 01:11:39,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2018-12-03 01:11:39,016 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 31 states. [2018-12-03 01:11:43,579 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-12-03 01:11:43,914 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-12-03 01:11:44,123 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-12-03 01:11:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:11:48,170 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2018-12-03 01:11:48,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 01:11:48,170 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 54 [2018-12-03 01:11:48,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:11:48,170 INFO L225 Difference]: With dead ends: 128 [2018-12-03 01:11:48,170 INFO L226 Difference]: Without dead ends: 128 [2018-12-03 01:11:48,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=440, Invalid=3458, Unknown=8, NotChecked=0, Total=3906 [2018-12-03 01:11:48,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-03 01:11:48,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 99. [2018-12-03 01:11:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 01:11:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-03 01:11:48,173 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 54 [2018-12-03 01:11:48,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:11:48,173 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-03 01:11:48,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 01:11:48,173 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-03 01:11:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 01:11:48,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:11:48,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:11:48,174 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:11:48,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:11:48,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1073148403, now seen corresponding path program 1 times [2018-12-03 01:11:48,174 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:11:48,175 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 01:11:48,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:11:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:11:48,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:11:48,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-03 01:11:48,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03 01:11:48,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:48,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:48,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 12 treesize of output 15 [2018-12-03 01:11:48,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:48,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-03 01:11:48,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:48,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:48,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 01:11:48,593 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-03 01:11:48,621 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 15 treesize of output 14 [2018-12-03 01:11:48,621 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:48,640 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:11:48,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:11:48,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:11:48,688 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:57, output treesize:179 [2018-12-03 01:11:48,811 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2018-12-03 01:11:48,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:48,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:48,829 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 65 treesize of output 57 [2018-12-03 01:11:48,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:48,897 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 65 treesize of output 58 [2018-12-03 01:11:48,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:48,980 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 57 treesize of output 52 [2018-12-03 01:11:48,980 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:49,046 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-12-03 01:11:49,046 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:49,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-12-03 01:11:49,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:49,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-03 01:11:49,107 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:49,123 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:49,177 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 36 treesize of output 32 [2018-12-03 01:11:49,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:49,180 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 13 treesize of output 6 [2018-12-03 01:11:49,180 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:49,191 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:49,228 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 48 treesize of output 44 [2018-12-03 01:11:49,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:49,231 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 13 treesize of output 6 [2018-12-03 01:11:49,231 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:49,244 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:49,274 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 32 treesize of output 28 [2018-12-03 01:11:49,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:49,276 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 13 treesize of output 6 [2018-12-03 01:11:49,276 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:49,284 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:49,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:49,296 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:131, output treesize:16 [2018-12-03 01:11:50,212 WARN L180 SmtUtils]: Spent 887.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 01:11:51,279 WARN L180 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-03 01:11:52,305 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-03 01:11:52,308 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-03 01:11:52,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:52,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:11:52,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:52,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:52,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:10 [2018-12-03 01:11:52,511 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-03 01:11:52,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:11:52,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:52,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:52,550 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-03 01:11:52,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:11:52,553 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:52,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:52,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:52,581 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-12-03 01:11:52,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-03 01:11:52,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:52,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 01:11:52,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:52,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:52,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-03 01:11:52,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:52,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 01:11:52,753 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:52,765 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:52,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:52,799 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-12-03 01:11:52,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-12-03 01:11:52,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:52,981 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 2 case distinctions, treesize of input 24 treesize of output 49 [2018-12-03 01:11:52,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 01:11:53,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2018-12-03 01:11:53,092 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:53,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:11:53,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2018-12-03 01:11:53,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:53,270 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 45 treesize of output 72 [2018-12-03 01:11:53,270 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:54,344 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:54,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 83 [2018-12-03 01:11:54,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 70 treesize of output 75 [2018-12-03 01:11:54,399 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:54,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:54,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 90 [2018-12-03 01:11:54,601 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-12-03 01:11:54,818 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:11:54,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:11:54,934 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:58, output treesize:195 [2018-12-03 01:11:55,124 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-03 01:11:55,440 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-12-03 01:11:55,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:55,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:55,600 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 128 treesize of output 120 [2018-12-03 01:11:55,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:55,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:55,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:55,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:55,801 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 128 treesize of output 119 [2018-12-03 01:11:55,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:55,982 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 2 case distinctions, treesize of input 120 treesize of output 127 [2018-12-03 01:11:55,982 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 01:11:56,261 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 119 treesize of output 122 [2018-12-03 01:11:56,261 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:56,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 116 [2018-12-03 01:11:56,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:56,489 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 22 treesize of output 14 [2018-12-03 01:11:56,489 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:56,527 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:56,750 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 123 treesize of output 117 [2018-12-03 01:11:56,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:56,756 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 22 treesize of output 14 [2018-12-03 01:11:56,756 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:56,793 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:56,796 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 121 treesize of output 115 [2018-12-03 01:11:56,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:56,802 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 22 treesize of output 14 [2018-12-03 01:11:56,802 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:56,849 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:57,038 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 101 treesize of output 95 [2018-12-03 01:11:57,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:57,041 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 22 treesize of output 14 [2018-12-03 01:11:57,041 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:57,069 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:57,072 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 103 treesize of output 97 [2018-12-03 01:11:57,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:57,076 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 22 treesize of output 14 [2018-12-03 01:11:57,076 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:57,105 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:57,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 96 [2018-12-03 01:11:57,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:57,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-03 01:11:57,271 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:57,302 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:57,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:11:57,446 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 12 variables, input treesize:257, output treesize:233 [2018-12-03 01:11:57,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 50 [2018-12-03 01:11:57,991 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-12-03 01:11:57,992 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-03 01:11:58,001 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-03 01:11:58,001 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:58,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:11:58,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-12-03 01:11:58,023 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:58,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:11:58,030 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:85, output treesize:12 [2018-12-03 01:11:58,325 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 01:11:58,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 83 [2018-12-03 01:11:58,361 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 52 [2018-12-03 01:11:58,362 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-12-03 01:11:58,418 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2018-12-03 01:11:58,419 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:58,422 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 49 treesize of output 43 [2018-12-03 01:11:58,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:58,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 01:11:58,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2018-12-03 01:11:58,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:58,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:11:58,528 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 31 treesize of output 20 [2018-12-03 01:11:58,529 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:58,546 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-03 01:11:58,546 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:58,558 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:11:58,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2018-12-03 01:11:58,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 32 [2018-12-03 01:11:58,582 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-03 01:11:58,601 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 20 treesize of output 13 [2018-12-03 01:11:58,601 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:58,603 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-03 01:11:58,603 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-03 01:11:58,616 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:11:58,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-03 01:11:58,651 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:120, output treesize:67 [2018-12-03 01:11:58,833 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-03 01:11:58,833 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:11:58,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:11:58,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-12-03 01:11:58,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 01:11:58,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 01:11:58,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2018-12-03 01:11:58,838 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 29 states. [2018-12-03 01:11:59,062 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2018-12-03 01:11:59,397 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-03 01:12:03,211 WARN L180 SmtUtils]: Spent 3.54 s on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-03 01:12:06,456 WARN L180 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-03 01:12:09,376 WARN L180 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-03 01:12:09,840 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-12-03 01:12:10,233 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2018-12-03 01:12:10,662 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-12-03 01:12:12,018 WARN L180 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2018-12-03 01:12:12,424 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-12-03 01:12:12,726 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-12-03 01:12:13,937 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2018-12-03 01:12:14,210 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2018-12-03 01:12:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:12:16,953 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 01:12:16,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 01:12:16,954 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-12-03 01:12:16,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:12:16,955 INFO L225 Difference]: With dead ends: 100 [2018-12-03 01:12:16,955 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 01:12:16,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=465, Invalid=3310, Unknown=7, NotChecked=0, Total=3782 [2018-12-03 01:12:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 01:12:16,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-12-03 01:12:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 01:12:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-03 01:12:16,957 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 54 [2018-12-03 01:12:16,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:12:16,957 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-03 01:12:16,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 01:12:16,957 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-03 01:12:16,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 01:12:16,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:12:16,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:12:16,958 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:12:16,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:12:16,958 INFO L82 PathProgramCache]: Analyzing trace with hash 710557809, now seen corresponding path program 1 times [2018-12-03 01:12:16,958 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:12:16,958 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:12:16,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:12:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:17,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:12:17,143 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 9 treesize of output 7 [2018-12-03 01:12:17,145 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-03 01:12:17,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:17,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:17,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:17,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:9, output treesize:1 [2018-12-03 01:12:17,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:12:17,169 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:12:17,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:12:17,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:12:17,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:12:17,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:12:17,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:12:17,173 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 7 states. [2018-12-03 01:12:17,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:12:17,541 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 01:12:17,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 01:12:17,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-12-03 01:12:17,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:12:17,542 INFO L225 Difference]: With dead ends: 97 [2018-12-03 01:12:17,542 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 01:12:17,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:12:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 01:12:17,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 01:12:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 01:12:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-03 01:12:17,544 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 59 [2018-12-03 01:12:17,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:12:17,544 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-03 01:12:17,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:12:17,544 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-03 01:12:17,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 01:12:17,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:12:17,545 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:12:17,545 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:12:17,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:12:17,545 INFO L82 PathProgramCache]: Analyzing trace with hash 710557810, now seen corresponding path program 1 times [2018-12-03 01:12:17,545 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:12:17,545 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 01:12:17,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:12:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:17,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:12:17,890 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-03 01:12:17,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:12:17,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:17,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:17,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 11 treesize of output 8 [2018-12-03 01:12:17,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:12:17,907 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:17,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:17,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:17,915 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:23, output treesize:1 [2018-12-03 01:12:18,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2018-12-03 01:12:18,218 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 82 treesize of output 70 [2018-12-03 01:12:18,218 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-03 01:12:18,308 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 70 treesize of output 59 [2018-12-03 01:12:18,308 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:18,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 65 [2018-12-03 01:12:18,412 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 01:12:18,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:12:18,652 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 61 treesize of output 51 [2018-12-03 01:12:18,656 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 45 treesize of output 20 [2018-12-03 01:12:18,656 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:18,675 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:18,678 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 59 treesize of output 49 [2018-12-03 01:12:18,682 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 45 treesize of output 20 [2018-12-03 01:12:18,683 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:18,702 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:18,705 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 55 treesize of output 45 [2018-12-03 01:12:18,708 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 45 treesize of output 20 [2018-12-03 01:12:18,708 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:18,721 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:18,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:18,745 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:98, output treesize:20 [2018-12-03 01:12:19,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:12:19,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:12:20,182 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 82 treesize of output 86 [2018-12-03 01:12:20,183 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-03 01:12:20,368 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 82 treesize of output 84 [2018-12-03 01:12:20,369 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 01:12:20,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-12-03 01:12:20,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:165, output treesize:267 [2018-12-03 01:12:21,172 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 42 [2018-12-03 01:12:21,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:12:21,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:12:21,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:12:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:21,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:12:21,587 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 61 treesize of output 51 [2018-12-03 01:12:21,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 26 [2018-12-03 01:12:21,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:21,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:21,635 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-03 01:12:21,640 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 7 [2018-12-03 01:12:21,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:21,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:21,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:21,661 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:70, output treesize:20 [2018-12-03 01:12:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:12:21,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:12:22,084 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 82 treesize of output 86 [2018-12-03 01:12:22,085 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-03 01:12:22,270 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 82 treesize of output 84 [2018-12-03 01:12:22,271 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 01:12:22,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-12-03 01:12:22,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:165, output treesize:267 [2018-12-03 01:12:22,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 01:12:22,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 18 [2018-12-03 01:12:22,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 01:12:22,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 01:12:22,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2018-12-03 01:12:22,961 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 19 states. [2018-12-03 01:12:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:12:28,658 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-12-03 01:12:28,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 01:12:28,659 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-12-03 01:12:28,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:12:28,660 INFO L225 Difference]: With dead ends: 113 [2018-12-03 01:12:28,660 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 01:12:28,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=155, Invalid=1327, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 01:12:28,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 01:12:28,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2018-12-03 01:12:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 01:12:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-12-03 01:12:28,662 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 59 [2018-12-03 01:12:28,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:12:28,662 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-12-03 01:12:28,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 01:12:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-12-03 01:12:28,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 01:12:28,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:12:28,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:12:28,662 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:12:28,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:12:28,663 INFO L82 PathProgramCache]: Analyzing trace with hash -124859678, now seen corresponding path program 1 times [2018-12-03 01:12:28,663 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:12:28,663 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 01:12:28,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:12:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:28,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:12:28,831 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 9 treesize of output 7 [2018-12-03 01:12:28,833 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-03 01:12:28,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:28,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:28,833 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-03 01:12:28,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:1 [2018-12-03 01:12:28,843 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 9 treesize of output 7 [2018-12-03 01:12:28,845 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-03 01:12:28,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:28,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:28,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:28,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:9, output treesize:1 [2018-12-03 01:12:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:12:28,886 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:12:28,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:12:28,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 01:12:28,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 01:12:28,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 01:12:28,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:12:28,889 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 9 states. [2018-12-03 01:12:37,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:12:37,510 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2018-12-03 01:12:37,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 01:12:37,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-12-03 01:12:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:12:37,511 INFO L225 Difference]: With dead ends: 106 [2018-12-03 01:12:37,511 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 01:12:37,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-03 01:12:37,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 01:12:37,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 01:12:37,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 01:12:37,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-12-03 01:12:37,512 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 61 [2018-12-03 01:12:37,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:12:37,512 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-12-03 01:12:37,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 01:12:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2018-12-03 01:12:37,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 01:12:37,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:12:37,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:12:37,513 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:12:37,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:12:37,513 INFO L82 PathProgramCache]: Analyzing trace with hash -124859677, now seen corresponding path program 1 times [2018-12-03 01:12:37,513 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:12:37,513 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/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-03 01:12:37,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:12:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:37,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:12:37,730 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-03 01:12:37,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:37,733 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 13 treesize of output 6 [2018-12-03 01:12:37,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:37,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:37,747 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-03 01:12:37,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:37,750 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 13 treesize of output 6 [2018-12-03 01:12:37,750 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:37,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:37,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:37,755 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:10 [2018-12-03 01:12:38,055 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 56 treesize of output 44 [2018-12-03 01:12:38,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:38,060 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 44 treesize of output 30 [2018-12-03 01:12:38,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:38,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:38,085 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 28 treesize of output 22 [2018-12-03 01:12:38,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:38,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-03 01:12:38,088 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:38,092 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:38,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:38,099 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:82, output treesize:11 [2018-12-03 01:12:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 01:12:38,200 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:12:38,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:12:38,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 01:12:38,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 01:12:38,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 01:12:38,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-12-03 01:12:38,204 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 14 states. [2018-12-03 01:12:40,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:12:40,381 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-12-03 01:12:40,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 01:12:40,382 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2018-12-03 01:12:40,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:12:40,382 INFO L225 Difference]: With dead ends: 104 [2018-12-03 01:12:40,382 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 01:12:40,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2018-12-03 01:12:40,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 01:12:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 01:12:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 01:12:40,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-12-03 01:12:40,384 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 61 [2018-12-03 01:12:40,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:12:40,384 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-12-03 01:12:40,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 01:12:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-12-03 01:12:40,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 01:12:40,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:12:40,385 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:12:40,385 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:12:40,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:12:40,385 INFO L82 PathProgramCache]: Analyzing trace with hash -109549283, now seen corresponding path program 1 times [2018-12-03 01:12:40,385 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:12:40,385 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 01:12:40,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:12:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:40,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:12:40,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 01:12:40,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:40,785 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-03 01:12:40,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 14 [2018-12-03 01:12:40,790 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:40,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:40,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:40,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 01:12:40,829 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 01:12:40,866 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:12:40,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:12:40,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 9 treesize of output 12 [2018-12-03 01:12:40,966 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-03 01:12:40,966 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:40,972 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:41,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:12:41,002 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:50, output treesize:158 [2018-12-03 01:12:41,112 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2018-12-03 01:12:41,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 46 treesize of output 44 [2018-12-03 01:12:41,117 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-03 01:12:41,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:41,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:41,171 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 46 treesize of output 44 [2018-12-03 01:12:41,173 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-03 01:12:41,174 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:41,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:41,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:12:41,228 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:75 [2018-12-03 01:12:41,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:41,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:41,295 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 46 treesize of output 38 [2018-12-03 01:12:41,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:41,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-12-03 01:12:41,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:41,424 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-12-03 01:12:41,424 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:41,465 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 38 treesize of output 33 [2018-12-03 01:12:41,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:41,502 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 25 [2018-12-03 01:12:41,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:41,505 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 13 treesize of output 6 [2018-12-03 01:12:41,505 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:41,511 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:41,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:41,527 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:93, output treesize:13 [2018-12-03 01:12:42,516 WARN L180 SmtUtils]: Spent 957.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 01:12:43,543 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 01:12:44,583 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 01:12:44,586 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-03 01:12:44,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:44,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:12:44,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:44,602 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-03 01:12:44,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:18, output treesize:7 [2018-12-03 01:12:44,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 11 treesize of output 8 [2018-12-03 01:12:44,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:12:44,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:44,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:44,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:44,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-03 01:12:44,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-03 01:12:44,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:44,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 01:12:44,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:44,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:44,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:44,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-03 01:12:45,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-12-03 01:12:45,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:45,036 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 2 case distinctions, treesize of input 24 treesize of output 37 [2018-12-03 01:12:45,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 01:12:45,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-12-03 01:12:45,125 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:45,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:12:45,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:12:45,201 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:31, output treesize:54 [2018-12-03 01:12:48,706 WARN L180 SmtUtils]: Spent 3.19 s on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-12-03 01:12:48,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:48,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:48,716 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 82 treesize of output 74 [2018-12-03 01:12:48,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:48,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:48,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 89 [2018-12-03 01:12:48,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:48,942 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 2 case distinctions, treesize of input 74 treesize of output 81 [2018-12-03 01:12:48,942 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 01:12:49,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:49,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:49,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:49,073 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 81 treesize of output 72 [2018-12-03 01:12:49,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:49,192 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 73 treesize of output 67 [2018-12-03 01:12:49,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:49,196 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 26 treesize of output 18 [2018-12-03 01:12:49,196 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:49,216 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:49,218 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 75 treesize of output 69 [2018-12-03 01:12:49,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:49,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-12-03 01:12:49,222 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:49,239 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:49,327 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 72 treesize of output 66 [2018-12-03 01:12:49,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:49,333 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 26 treesize of output 18 [2018-12-03 01:12:49,333 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:49,354 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:49,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:12:49,421 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:165, output treesize:134 [2018-12-03 01:12:49,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-12-03 01:12:49,930 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 6 treesize of output 4 [2018-12-03 01:12:49,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:49,936 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 11 treesize of output 1 [2018-12-03 01:12:49,937 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:49,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:49,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:49,943 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:42, output treesize:12 [2018-12-03 01:12:50,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-12-03 01:12:50,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, 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 4 [2018-12-03 01:12:50,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:50,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 21 [2018-12-03 01:12:50,239 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 01:12:50,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:12:50,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:12:50,266 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:55, output treesize:42 [2018-12-03 01:12:50,429 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-03 01:12:50,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:50,438 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-03 01:12:50,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-12-03 01:12:50,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:50,629 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-03 01:12:50,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:50,654 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-03 01:12:50,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:31 [2018-12-03 01:12:51,188 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-03 01:12:51,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:51,190 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-03 01:12:51,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:1 [2018-12-03 01:12:51,202 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:12:51,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:12:52,511 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-12-03 01:12:52,734 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2018-12-03 01:12:52,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 43 treesize of output 37 [2018-12-03 01:12:52,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:52,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-03 01:12:52,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:52,894 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-03 01:12:52,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:117, output treesize:75 [2018-12-03 01:12:53,277 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-12-03 01:12:53,635 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-03 01:12:53,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:12:53,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:12:53,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:12:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:53,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:12:53,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 9 treesize of output 12 [2018-12-03 01:12:53,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03 01:12:53,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:53,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:53,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 01:12:53,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:53,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-03 01:12:53,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:53,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:53,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 01:12:53,822 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-03 01:12:53,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 14 [2018-12-03 01:12:53,845 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:53,862 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:12:53,876 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:12:53,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:12:53,900 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:39, output treesize:125 [2018-12-03 01:12:54,421 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 47 treesize of output 40 [2018-12-03 01:12:54,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:54,468 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2018-12-03 01:12:54,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:54,509 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 47 treesize of output 42 [2018-12-03 01:12:54,509 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:54,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:54,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:54,546 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 42 treesize of output 34 [2018-12-03 01:12:54,546 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:54,581 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 34 treesize of output 32 [2018-12-03 01:12:54,582 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-03 01:12:54,583 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:54,592 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:54,620 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 27 treesize of output 25 [2018-12-03 01:12:54,621 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-03 01:12:54,621 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:54,630 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:54,655 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 30 treesize of output 28 [2018-12-03 01:12:54,657 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-03 01:12:54,657 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:54,666 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:54,688 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 21 [2018-12-03 01:12:54,690 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-03 01:12:54,690 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:54,697 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:54,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:54,709 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:95, output treesize:16 [2018-12-03 01:12:55,916 WARN L180 SmtUtils]: Spent 924.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-03 01:12:57,114 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-03 01:12:57,117 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-03 01:12:57,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:57,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:12:57,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:57,138 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-03 01:12:57,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:10 [2018-12-03 01:12:57,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 11 treesize of output 8 [2018-12-03 01:12:57,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 01:12:57,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:57,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:57,822 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-03 01:12:57,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:12:57,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:57,829 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:57,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:57,853 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-12-03 01:12:58,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-03 01:12:58,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:58,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 01:12:58,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:58,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:58,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-03 01:12:58,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:58,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 01:12:58,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:58,157 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:58,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:58,201 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2018-12-03 01:12:58,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 56 [2018-12-03 01:12:58,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-12-03 01:12:58,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:58,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:58,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 67 [2018-12-03 01:12:58,703 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-03 01:12:58,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:12:58,943 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 01:12:58,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-12-03 01:12:58,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:58,966 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 52 treesize of output 63 [2018-12-03 01:12:58,966 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:59,004 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:59,007 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 01:12:59,064 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 01:12:59,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2018-12-03 01:12:59,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:59,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2018-12-03 01:12:59,081 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:59,111 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:12:59,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 71 [2018-12-03 01:12:59,167 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 64 treesize of output 69 [2018-12-03 01:12:59,167 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 01:12:59,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:59,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:12:59,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 90 [2018-12-03 01:12:59,376 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-03 01:12:59,493 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:13:01,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:13:01,661 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:66, output treesize:187 [2018-12-03 01:13:02,172 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-03 01:13:02,768 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2018-12-03 01:13:03,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:13:03,103 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 110 treesize of output 117 [2018-12-03 01:13:03,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:03,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:13:03,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:13:03,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:13:03,281 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 113 treesize of output 104 [2018-12-03 01:13:03,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:03,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:13:03,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:13:03,424 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 110 treesize of output 102 [2018-12-03 01:13:03,424 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:03,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 109 [2018-12-03 01:13:03,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 01:13:03,798 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 103 treesize of output 99 [2018-12-03 01:13:03,801 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 19 [2018-12-03 01:13:03,801 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:03,840 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:13:03,843 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 105 treesize of output 101 [2018-12-03 01:13:03,846 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 19 [2018-12-03 01:13:03,846 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:03,882 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:13:04,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 100 [2018-12-03 01:13:04,069 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 19 [2018-12-03 01:13:04,069 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:04,101 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:13:04,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 93 [2018-12-03 01:13:04,262 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 7 [2018-12-03 01:13:04,262 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:04,291 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:13:04,454 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 96 treesize of output 92 [2018-12-03 01:13:04,456 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 7 [2018-12-03 01:13:04,457 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:04,485 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:13:04,487 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 98 treesize of output 94 [2018-12-03 01:13:04,490 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 7 [2018-12-03 01:13:04,490 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:04,518 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:13:04,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:13:04,659 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 12 variables, input treesize:221, output treesize:241 [2018-12-03 01:13:05,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:13:05,688 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 01:13:05,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2018-12-03 01:13:05,697 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-03 01:13:05,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:05,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 21 [2018-12-03 01:13:05,730 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 01:13:05,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:13:05,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2018-12-03 01:13:05,803 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 4 [2018-12-03 01:13:05,803 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:05,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:13:05,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:13:05,829 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 27 treesize of output 20 [2018-12-03 01:13:05,829 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:05,836 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:13:05,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-12-03 01:13:05,846 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 4 [2018-12-03 01:13:05,846 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:05,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 28 [2018-12-03 01:13:05,896 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-03 01:13:05,913 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:13:05,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 01:13:05,936 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:105, output treesize:41 [2018-12-03 01:13:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:13:07,274 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 01:13:07,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 01:13:07,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [36] total 59 [2018-12-03 01:13:07,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 01:13:07,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 01:13:07,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=4256, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 01:13:07,290 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 59 states. [2018-12-03 01:13:07,575 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-12-03 01:13:07,939 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-12-03 01:13:08,242 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-12-03 01:13:12,728 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-12-03 01:13:16,598 WARN L180 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-12-03 01:13:20,798 WARN L180 SmtUtils]: Spent 3.97 s on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-12-03 01:13:21,378 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2018-12-03 01:13:21,854 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-12-03 01:13:22,394 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-12-03 01:13:24,452 WARN L180 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2018-12-03 01:13:25,076 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-12-03 01:13:25,562 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-12-03 01:13:27,199 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2018-12-03 01:13:27,591 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2018-12-03 01:13:29,730 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2018-12-03 01:13:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:13:31,190 INFO L93 Difference]: Finished difference Result 68 states and 67 transitions. [2018-12-03 01:13:31,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 01:13:31,191 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 63 [2018-12-03 01:13:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:13:31,191 INFO L225 Difference]: With dead ends: 68 [2018-12-03 01:13:31,191 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 01:13:31,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 66 SyntacticMatches, 6 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 36.9s TimeCoverageRelationStatistics Valid=736, Invalid=9164, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 01:13:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 01:13:31,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 01:13:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 01:13:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 67 transitions. [2018-12-03 01:13:31,195 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 67 transitions. Word has length 63 [2018-12-03 01:13:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:13:31,195 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 67 transitions. [2018-12-03 01:13:31,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 01:13:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 67 transitions. [2018-12-03 01:13:31,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 01:13:31,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:13:31,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:13:31,196 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err6REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 01:13:31,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:13:31,196 INFO L82 PathProgramCache]: Analyzing trace with hash 938308599, now seen corresponding path program 1 times [2018-12-03 01:13:31,197 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 01:13:31,197 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 01:13:31,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:13:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:13:31,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:13:31,528 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2018-12-03 01:13:31,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:13:31,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 21 [2018-12-03 01:13:31,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:13:31,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:13:31,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 01:13:31,555 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 01:13:31,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 14 [2018-12-03 01:13:31,580 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:31,601 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:13:31,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 01:13:31,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2018-12-03 01:13:31,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:13:31,631 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2018-12-03 01:13:31,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03 01:13:31,635 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:31,644 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:13:31,652 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:13:31,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 01:13:31,683 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:42, output treesize:107 [2018-12-03 01:13:31,738 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 9 treesize of output 7 [2018-12-03 01:13:31,740 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-03 01:13:31,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:31,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:13:31,753 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 9 treesize of output 7 [2018-12-03 01:13:31,755 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-03 01:13:31,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:31,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:13:31,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:13:31,759 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:11 [2018-12-03 01:13:31,774 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-03 01:13:31,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:31,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:13:31,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-12-03 01:13:31,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:13:31,832 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 5 [2018-12-03 01:13:31,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:31,836 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-03 01:13:31,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-12-03 01:13:31,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 11 treesize of output 8 [2018-12-03 01:13:31,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:13:31,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:31,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:13:31,924 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-03 01:13:31,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-12-03 01:13:32,031 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-03 01:13:32,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:32,041 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-03 01:13:32,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:10 [2018-12-03 01:13:32,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 20 treesize of output 16 [2018-12-03 01:13:32,151 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 16 treesize of output 12 [2018-12-03 01:13:32,152 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-03 01:13:32,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:13:32,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:13:32,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2018-12-03 01:13:43,304 WARN L180 SmtUtils]: Spent 833.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 01:13:43,306 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 5 [2018-12-03 01:13:43,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:13:43,310 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-03 01:13:43,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-12-03 01:14:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:14:03,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:14:04,119 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_alloc_13_~p~0.base_12 (_ BitVec 32))) (or (not (= (select |c_#valid| v_alloc_13_~p~0.base_12) (_ bv0 1))) (= (store |c_#valid| v_alloc_13_~p~0.base_12 (_ bv0 1)) |c_old(#valid)|))) is different from false [2018-12-03 01:14:04,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:14:04,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:14:04,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:14:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:14:04,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:14:04,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:14:04,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-12-03 01:14:04,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:14:04,294 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-03 01:14:04,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-12-03 01:14:04,428 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-03 01:14:04,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 01:14:04,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:14:04,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:14:04,444 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-03 01:14:04,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2018-12-03 01:14:04,604 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-03 01:14:04,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:14:04,611 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-03 01:14:04,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-12-03 01:14:04,815 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 20 treesize of output 16 [2018-12-03 01:14:04,817 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 16 treesize of output 12 [2018-12-03 01:14:04,817 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-03 01:14:04,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:14:04,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:14:04,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:12 [2018-12-03 01:14:05,722 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_224 (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| v_arrayElimCell_224 (_ bv0 1))) (= (select |c_old(#valid)| v_arrayElimCell_224) (_ bv0 1)))) is different from true [2018-12-03 01:14:05,723 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 5 [2018-12-03 01:14:05,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 01:14:05,725 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-03 01:14:05,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-12-03 01:14:23,792 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_131 (_ BitVec 32))) (= (select |c_#valid| v_prenex_131) (_ bv0 1))) (exists ((v_arrayElimCell_224 (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| v_arrayElimCell_224 (_ bv0 1))) (= (select |c_old(#valid)| v_arrayElimCell_224) (_ bv0 1))))) is different from true [2018-12-03 01:14:23,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:14:23,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:14:24,616 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_alloc_13_~p~0.base_19 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_alloc_13_~p~0.base_19))) (= (store |c_#valid| v_alloc_13_~p~0.base_19 (_ bv0 1)) |c_old(#valid)|))) is different from false [2018-12-03 01:14:24,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 01:14:24,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 39 [2018-12-03 01:14:24,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 01:14:24,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 01:14:24,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1230, Unknown=24, NotChecked=300, Total=1722 [2018-12-03 01:14:24,633 INFO L87 Difference]: Start difference. First operand 68 states and 67 transitions. Second operand 40 states. [2018-12-03 01:15:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:15:38,998 INFO L93 Difference]: Finished difference Result 67 states and 66 transitions. [2018-12-03 01:15:38,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 01:15:38,998 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 67 [2018-12-03 01:15:38,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:15:38,998 INFO L225 Difference]: With dead ends: 67 [2018-12-03 01:15:38,998 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 01:15:38,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 81.6s TimeCoverageRelationStatistics Valid=428, Invalid=2973, Unknown=37, NotChecked=468, Total=3906 [2018-12-03 01:15:38,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 01:15:38,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 01:15:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 01:15:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 01:15:38,999 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2018-12-03 01:15:39,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:15:39,000 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 01:15:39,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 01:15:39,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 01:15:39,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 01:15:39,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 01:15:39 BoogieIcfgContainer [2018-12-03 01:15:39,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 01:15:39,003 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 01:15:39,003 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 01:15:39,003 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 01:15:39,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:05:46" (3/4) ... [2018-12-03 01:15:39,006 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 01:15:39,010 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2018-12-03 01:15:39,010 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2018-12-03 01:15:39,010 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 01:15:39,010 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_13 [2018-12-03 01:15:39,010 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2018-12-03 01:15:39,010 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_13 [2018-12-03 01:15:39,011 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 01:15:39,011 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2018-12-03 01:15:39,011 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2018-12-03 01:15:39,011 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2018-12-03 01:15:39,011 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2018-12-03 01:15:39,014 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2018-12-03 01:15:39,014 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-03 01:15:39,014 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 01:15:39,040 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c43af0e5-95f6-4d10-9bb7-affdb3b10063/bin-2019/utaipan/witness.graphml [2018-12-03 01:15:39,040 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 01:15:39,041 INFO L168 Benchmark]: Toolchain (without parser) took 593689.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 938.0 MB in the beginning and 854.0 MB in the end (delta: 84.0 MB). Peak memory consumption was 199.9 MB. Max. memory is 11.5 GB. [2018-12-03 01:15:39,041 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:15:39,041 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -134.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2018-12-03 01:15:39,041 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.48 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-03 01:15:39,041 INFO L168 Benchmark]: Boogie Preprocessor took 21.48 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-03 01:15:39,041 INFO L168 Benchmark]: RCFGBuilder took 330.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: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2018-12-03 01:15:39,042 INFO L168 Benchmark]: TraceAbstraction took 592912.23 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.2 MB). Free memory was 1.0 GB in the beginning and 860.6 MB in the end (delta: 174.1 MB). Peak memory consumption was 178.3 MB. Max. memory is 11.5 GB. [2018-12-03 01:15:39,042 INFO L168 Benchmark]: Witness Printer took 37.05 ms. Allocated memory is still 1.1 GB. Free memory was 860.6 MB in the beginning and 854.0 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-03 01:15:39,043 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 363.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -134.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.48 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 21.48 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 330.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: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 592912.23 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.2 MB). Free memory was 1.0 GB in the beginning and 860.6 MB in the end (delta: 174.1 MB). Peak memory consumption was 178.3 MB. Max. memory is 11.5 GB. * Witness Printer took 37.05 ms. Allocated memory is still 1.1 GB. Free memory was 860.6 MB in the beginning and 854.0 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1121]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1121]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1115]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1116]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1115]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1116]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1453]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1453]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1463]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1100]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1099]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1100]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1099]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1131]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1131]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1131]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1131]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1109]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1110]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1107]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1109]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1108]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1107]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1108]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1110]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 100 locations, 31 error locations. SAFE Result, 592.8s OverallTime, 31 OverallIterations, 2 TraceHistogramMax, 450.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1805 SDtfs, 3748 SDslu, 7219 SDs, 0 SdLazy, 18828 SolverSat, 1658 SolverUnsat, 196 SolverUnknown, 0 SolverNotchecked, 267.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1699 GetRequests, 805 SyntacticMatches, 59 SemanticMatches, 835 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 8162 ImplicationChecksByTransitivity, 284.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 363 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 137.0s InterpolantComputationTime, 1305 NumberOfCodeBlocks, 1305 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1271 ConstructedInterpolants, 261 QuantifiedInterpolants, 1267316 SizeOfPredicates, 664 NumberOfNonLiveVariables, 6666 ConjunctsInSsa, 1420 ConjunctsInUnsatCore, 34 InterpolantComputations, 29 PerfectInterpolantSequences, 18/32 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...