./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse_true-unreach-call_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_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 cfdde8b1798318c3bb26b76a748741913b280952 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 cfdde8b1798318c3bb26b76a748741913b280952 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 07:32:10,324 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 07:32:10,325 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 07:32:10,331 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 07:32:10,331 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 07:32:10,332 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 07:32:10,332 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 07:32:10,333 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 07:32:10,334 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 07:32:10,334 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 07:32:10,334 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 07:32:10,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 07:32:10,335 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 07:32:10,335 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 07:32:10,336 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 07:32:10,336 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 07:32:10,337 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 07:32:10,337 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 07:32:10,338 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 07:32:10,339 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 07:32:10,339 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 07:32:10,340 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 07:32:10,341 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 07:32:10,341 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 07:32:10,341 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 07:32:10,342 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 07:32:10,342 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 07:32:10,342 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 07:32:10,343 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 07:32:10,343 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 07:32:10,343 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 07:32:10,344 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 07:32:10,344 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 07:32:10,344 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 07:32:10,344 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 07:32:10,345 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 07:32:10,345 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-03 07:32:10,352 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 07:32:10,352 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 07:32:10,352 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 07:32:10,352 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 07:32:10,353 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 07:32:10,353 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 07:32:10,353 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 07:32:10,353 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 07:32:10,353 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 07:32:10,353 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 07:32:10,353 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 07:32:10,353 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 07:32:10,353 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 07:32:10,354 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 07:32:10,354 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 07:32:10,354 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 07:32:10,354 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 07:32:10,354 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 07:32:10,354 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 07:32:10,354 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 07:32:10,354 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 07:32:10,354 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 07:32:10,354 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 07:32:10,354 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 07:32:10,355 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 07:32:10,355 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 07:32:10,355 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 07:32:10,355 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 07:32:10,355 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 07:32:10,355 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 07:32:10,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:32:10,355 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 07:32:10,355 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 07:32:10,355 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 07:32:10,356 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 07:32:10,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 07:32:10,356 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_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 -> cfdde8b1798318c3bb26b76a748741913b280952 [2018-12-03 07:32:10,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 07:32:10,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 07:32:10,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 07:32:10,381 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 07:32:10,382 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 07:32:10,382 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:32:10,416 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/data/f6880b608/730e3748408840b4adc2bdf304f0df29/FLAGe6e7d0955 [2018-12-03 07:32:10,879 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 07:32:10,880 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/sv-benchmarks/c/list-simple/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:32:10,886 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/data/f6880b608/730e3748408840b4adc2bdf304f0df29/FLAGe6e7d0955 [2018-12-03 07:32:10,894 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/data/f6880b608/730e3748408840b4adc2bdf304f0df29 [2018-12-03 07:32:10,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 07:32:10,897 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 07:32:10,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 07:32:10,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 07:32:10,899 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 07:32:10,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:32:10" (1/1) ... [2018-12-03 07:32:10,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b5df9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:32:10, skipping insertion in model container [2018-12-03 07:32:10,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:32:10" (1/1) ... [2018-12-03 07:32:10,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 07:32:10,930 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 07:32:11,106 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:32:11,147 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 07:32:11,176 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:32:11,198 INFO L195 MainTranslator]: Completed translation [2018-12-03 07:32:11,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:32:11 WrapperNode [2018-12-03 07:32:11,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 07:32:11,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 07:32:11,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 07:32:11,199 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 07:32:11,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:32:11" (1/1) ... [2018-12-03 07:32:11,213 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:32:11" (1/1) ... [2018-12-03 07:32:11,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 07:32:11,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 07:32:11,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 07:32:11,218 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 07:32:11,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:32:11" (1/1) ... [2018-12-03 07:32:11,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:32:11" (1/1) ... [2018-12-03 07:32:11,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:32:11" (1/1) ... [2018-12-03 07:32:11,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:32:11" (1/1) ... [2018-12-03 07:32:11,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:32:11" (1/1) ... [2018-12-03 07:32:11,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:32:11" (1/1) ... [2018-12-03 07:32:11,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:32:11" (1/1) ... [2018-12-03 07:32:11,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 07:32:11,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 07:32:11,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 07:32:11,239 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 07:32:11,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:32:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:32:11,270 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-03 07:32:11,270 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-03 07:32:11,270 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-03 07:32:11,270 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-03 07:32:11,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 07:32:11,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 07:32:11,270 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2018-12-03 07:32:11,270 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2018-12-03 07:32:11,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 07:32:11,270 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2018-12-03 07:32:11,271 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2018-12-03 07:32:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 07:32:11,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 07:32:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 07:32:11,271 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 07:32:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 07:32:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 07:32:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 07:32:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-03 07:32:11,271 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-03 07:32:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 07:32:11,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 07:32:11,506 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 07:32:11,506 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-03 07:32:11,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:32:11 BoogieIcfgContainer [2018-12-03 07:32:11,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 07:32:11,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 07:32:11,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 07:32:11,510 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 07:32:11,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 07:32:10" (1/3) ... [2018-12-03 07:32:11,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff1893d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:32:11, skipping insertion in model container [2018-12-03 07:32:11,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:32:11" (2/3) ... [2018-12-03 07:32:11,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff1893d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:32:11, skipping insertion in model container [2018-12-03 07:32:11,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:32:11" (3/3) ... [2018-12-03 07:32:11,512 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:32:11,518 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 07:32:11,523 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-12-03 07:32:11,533 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-12-03 07:32:11,549 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 07:32:11,549 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 07:32:11,549 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 07:32:11,549 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 07:32:11,549 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 07:32:11,549 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 07:32:11,549 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 07:32:11,550 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 07:32:11,560 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2018-12-03 07:32:11,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 07:32:11,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:32:11,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:32:11,568 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION]=== [2018-12-03 07:32:11,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:11,572 INFO L82 PathProgramCache]: Analyzing trace with hash 645081098, now seen corresponding path program 1 times [2018-12-03 07:32:11,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:32:11,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:11,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:11,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:11,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:32:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:11,685 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 07:32:11,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:32:11,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 07:32:11,687 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:32:11,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:32:11,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:32:11,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:32:11,699 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 3 states. [2018-12-03 07:32:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:32:11,752 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2018-12-03 07:32:11,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:32:11,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-03 07:32:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:32:11,760 INFO L225 Difference]: With dead ends: 84 [2018-12-03 07:32:11,761 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 07:32:11,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:32:11,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 07:32:11,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-12-03 07:32:11,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 07:32:11,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-12-03 07:32:11,787 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 11 [2018-12-03 07:32:11,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:32:11,787 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-12-03 07:32:11,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:32:11,787 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-12-03 07:32:11,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 07:32:11,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:32:11,788 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:32:11,788 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION]=== [2018-12-03 07:32:11,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:11,788 INFO L82 PathProgramCache]: Analyzing trace with hash 645081099, now seen corresponding path program 1 times [2018-12-03 07:32:11,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:32:11,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:11,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:11,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:11,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:32:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:11,843 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 07:32:11,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:32:11,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 07:32:11,843 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:32:11,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:32:11,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:32:11,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:32:11,844 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 3 states. [2018-12-03 07:32:11,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:32:11,871 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-12-03 07:32:11,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:32:11,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-03 07:32:11,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:32:11,872 INFO L225 Difference]: With dead ends: 74 [2018-12-03 07:32:11,872 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 07:32:11,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:32:11,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 07:32:11,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-12-03 07:32:11,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 07:32:11,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-12-03 07:32:11,876 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 11 [2018-12-03 07:32:11,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:32:11,876 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-12-03 07:32:11,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:32:11,876 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-12-03 07:32:11,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 07:32:11,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:32:11,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:32:11,877 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION]=== [2018-12-03 07:32:11,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:11,877 INFO L82 PathProgramCache]: Analyzing trace with hash -379752050, now seen corresponding path program 1 times [2018-12-03 07:32:11,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:32:11,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:11,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:11,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:11,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:32:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:11,904 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 07:32:11,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:32:11,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:32:11,904 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:32:11,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:32:11,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:32:11,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:32:11,905 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 3 states. [2018-12-03 07:32:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:32:11,919 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-12-03 07:32:11,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:32:11,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 07:32:11,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:32:11,920 INFO L225 Difference]: With dead ends: 80 [2018-12-03 07:32:11,920 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 07:32:11,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:32:11,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 07:32:11,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2018-12-03 07:32:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 07:32:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-12-03 07:32:11,924 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 15 [2018-12-03 07:32:11,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:32:11,925 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-12-03 07:32:11,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:32:11,925 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-12-03 07:32:11,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 07:32:11,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:32:11,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:32:11,925 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION]=== [2018-12-03 07:32:11,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:11,926 INFO L82 PathProgramCache]: Analyzing trace with hash -888134484, now seen corresponding path program 1 times [2018-12-03 07:32:11,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:32:11,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:11,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:11,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:11,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:32:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:11,960 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 07:32:11,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:32:11,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:32:11,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:32:11,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:32:11,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:32:11,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:32:11,961 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 5 states. [2018-12-03 07:32:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:32:11,989 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-12-03 07:32:11,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:32:11,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-03 07:32:11,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:32:11,989 INFO L225 Difference]: With dead ends: 80 [2018-12-03 07:32:11,990 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 07:32:11,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:32:11,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 07:32:11,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-12-03 07:32:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 07:32:11,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-12-03 07:32:11,993 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 18 [2018-12-03 07:32:11,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:32:11,993 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-12-03 07:32:11,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:32:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-12-03 07:32:11,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 07:32:11,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:32:11,994 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:32:11,994 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION]=== [2018-12-03 07:32:11,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:11,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1185765675, now seen corresponding path program 1 times [2018-12-03 07:32:11,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:32:11,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:11,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:11,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:11,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:32:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:32:12,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:32:12,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:32:12,052 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-03 07:32:12,053 INFO L205 CegarAbsIntRunner]: [43], [108], [109], [115], [124], [130], [132], [135], [138], [143], [145], [148], [150], [159], [169], [170], [171] [2018-12-03 07:32:12,073 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:32:12,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:32:12,186 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:32:12,187 INFO L272 AbstractInterpreter]: Visited 17 different actions 24 times. Merged at 6 different actions 6 times. Never widened. Performed 255 root evaluator evaluations with a maximum evaluation depth of 3. Performed 255 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-03 07:32:12,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:12,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:32:12,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:32:12,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:32:12,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:12,199 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:32:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:12,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:32:12,253 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 07:32:12,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:12,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:12,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 07:32:12,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:32:12,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:32:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:32:12,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:32:12,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 07:32:12,308 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:32:12,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:32:12,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:32:12,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:32:12,309 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 6 states. [2018-12-03 07:32:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:32:12,390 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-12-03 07:32:12,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:32:12,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-03 07:32:12,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:32:12,391 INFO L225 Difference]: With dead ends: 76 [2018-12-03 07:32:12,391 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 07:32:12,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:32:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 07:32:12,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-12-03 07:32:12,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 07:32:12,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-12-03 07:32:12,395 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 22 [2018-12-03 07:32:12,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:32:12,395 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-12-03 07:32:12,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:32:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-12-03 07:32:12,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 07:32:12,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:32:12,396 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:32:12,396 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION]=== [2018-12-03 07:32:12,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:12,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1185765674, now seen corresponding path program 1 times [2018-12-03 07:32:12,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:32:12,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:12,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:12,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:12,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:32:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:12,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:32:12,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:32:12,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:32:12,484 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-03 07:32:12,484 INFO L205 CegarAbsIntRunner]: [43], [108], [109], [115], [124], [130], [132], [135], [138], [143], [146], [148], [150], [159], [169], [170], [171] [2018-12-03 07:32:12,485 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:32:12,485 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:32:12,524 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:32:12,524 INFO L272 AbstractInterpreter]: Visited 17 different actions 24 times. Merged at 6 different actions 6 times. Never widened. Performed 256 root evaluator evaluations with a maximum evaluation depth of 3. Performed 256 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-03 07:32:12,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:12,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:32:12,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:32:12,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:32:12,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:12,532 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:32:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:12,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:32:12,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:12,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:12,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-03 07:32:12,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:12,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-03 07:32:12,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:12,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:32:12,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-12-03 07:32:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:32:12,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:32:12,718 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 7 treesize of output 5 [2018-12-03 07:32:12,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:12,721 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 07:32:12,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:10 [2018-12-03 07:32:12,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:32:12,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:32:12,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 14 [2018-12-03 07:32:12,749 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:32:12,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 07:32:12,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 07:32:12,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-12-03 07:32:12,750 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 11 states. [2018-12-03 07:32:12,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:32:12,871 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-12-03 07:32:12,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:32:12,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-12-03 07:32:12,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:32:12,872 INFO L225 Difference]: With dead ends: 79 [2018-12-03 07:32:12,872 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 07:32:12,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-12-03 07:32:12,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 07:32:12,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2018-12-03 07:32:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 07:32:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-12-03 07:32:12,876 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 22 [2018-12-03 07:32:12,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:32:12,876 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-12-03 07:32:12,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 07:32:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-12-03 07:32:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 07:32:12,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:32:12,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] [2018-12-03 07:32:12,877 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION]=== [2018-12-03 07:32:12,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:12,877 INFO L82 PathProgramCache]: Analyzing trace with hash 322115077, now seen corresponding path program 1 times [2018-12-03 07:32:12,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:32:12,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:12,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:12,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:12,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:32:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:12,915 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 07:32:12,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:32:12,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 07:32:12,915 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:32:12,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:32:12,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:32:12,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:32:12,916 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 9 states. [2018-12-03 07:32:13,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:32:13,050 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-12-03 07:32:13,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:32:13,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-12-03 07:32:13,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:32:13,051 INFO L225 Difference]: With dead ends: 80 [2018-12-03 07:32:13,051 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 07:32:13,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-03 07:32:13,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 07:32:13,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-12-03 07:32:13,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 07:32:13,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-12-03 07:32:13,054 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 25 [2018-12-03 07:32:13,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:32:13,054 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-12-03 07:32:13,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:32:13,054 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-12-03 07:32:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 07:32:13,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:32:13,055 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] [2018-12-03 07:32:13,055 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION]=== [2018-12-03 07:32:13,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:13,055 INFO L82 PathProgramCache]: Analyzing trace with hash 322115078, now seen corresponding path program 1 times [2018-12-03 07:32:13,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:32:13,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:13,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:13,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:13,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:32:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:13,098 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 07:32:13,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:32:13,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:32:13,098 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-03 07:32:13,099 INFO L205 CegarAbsIntRunner]: [0], [7], [19], [43], [45], [53], [108], [109], [115], [122], [124], [130], [132], [135], [138], [148], [150], [154], [155], [159], [160], [161], [169], [170], [171] [2018-12-03 07:32:13,100 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:32:13,100 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:32:13,136 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:32:13,136 INFO L272 AbstractInterpreter]: Visited 16 different actions 23 times. Merged at 6 different actions 6 times. Never widened. Performed 249 root evaluator evaluations with a maximum evaluation depth of 3. Performed 249 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-12-03 07:32:13,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:13,138 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:32:13,193 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 76.36% of their original sizes. [2018-12-03 07:32:13,193 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:32:13,229 INFO L418 sIntCurrentIteration]: We unified 24 AI predicates to 24 [2018-12-03 07:32:13,230 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:32:13,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:32:13,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-03 07:32:13,230 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:32:13,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:32:13,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:32:13,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:32:13,231 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 9 states. [2018-12-03 07:32:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:32:13,460 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-12-03 07:32:13,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:32:13,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-12-03 07:32:13,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:32:13,461 INFO L225 Difference]: With dead ends: 86 [2018-12-03 07:32:13,461 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 07:32:13,461 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-03 07:32:13,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 07:32:13,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-12-03 07:32:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 07:32:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-12-03 07:32:13,464 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 25 [2018-12-03 07:32:13,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:32:13,464 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-12-03 07:32:13,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:32:13,464 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-12-03 07:32:13,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 07:32:13,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:32:13,465 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:32:13,465 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION]=== [2018-12-03 07:32:13,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:13,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1328238362, now seen corresponding path program 1 times [2018-12-03 07:32:13,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:32:13,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:13,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:13,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:13,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:32:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:13,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 07:32:13,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:32:13,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:32:13,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:32:13,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:32:13,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:32:13,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:32:13,492 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 6 states. [2018-12-03 07:32:13,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:32:13,526 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-12-03 07:32:13,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:32:13,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-12-03 07:32:13,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:32:13,527 INFO L225 Difference]: With dead ends: 84 [2018-12-03 07:32:13,528 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 07:32:13,528 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 07:32:13,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 07:32:13,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2018-12-03 07:32:13,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 07:32:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2018-12-03 07:32:13,532 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 33 [2018-12-03 07:32:13,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:32:13,532 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2018-12-03 07:32:13,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:32:13,532 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2018-12-03 07:32:13,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 07:32:13,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:32:13,533 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:32:13,533 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION]=== [2018-12-03 07:32:13,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:13,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1328238417, now seen corresponding path program 1 times [2018-12-03 07:32:13,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:32:13,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:13,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:13,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:13,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:32:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 07:32:13,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:32:13,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 07:32:13,620 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:32:13,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:32:13,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:32:13,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:32:13,620 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand 9 states. [2018-12-03 07:32:13,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:32:13,741 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2018-12-03 07:32:13,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:32:13,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-12-03 07:32:13,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:32:13,742 INFO L225 Difference]: With dead ends: 84 [2018-12-03 07:32:13,743 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 07:32:13,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-03 07:32:13,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 07:32:13,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2018-12-03 07:32:13,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 07:32:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2018-12-03 07:32:13,747 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 33 [2018-12-03 07:32:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:32:13,747 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2018-12-03 07:32:13,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:32:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2018-12-03 07:32:13,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 07:32:13,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:32:13,748 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:32:13,748 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION]=== [2018-12-03 07:32:13,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:13,748 INFO L82 PathProgramCache]: Analyzing trace with hash 16935945, now seen corresponding path program 1 times [2018-12-03 07:32:13,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:32:13,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:13,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:13,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:13,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:32:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:32:13,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:32:13,963 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:32:13,963 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-12-03 07:32:13,963 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [10], [13], [18], [43], [45], [53], [108], [109], [115], [122], [124], [130], [132], [135], [138], [143], [144], [148], [150], [154], [155], [159], [160], [161], [169], [170], [171] [2018-12-03 07:32:13,964 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:32:13,964 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:32:14,014 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:32:14,015 INFO L272 AbstractInterpreter]: Visited 30 different actions 51 times. Merged at 9 different actions 16 times. Never widened. Performed 514 root evaluator evaluations with a maximum evaluation depth of 4. Performed 514 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 3 different actions. Largest state had 27 variables. [2018-12-03 07:32:14,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:14,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:32:14,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:32:14,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:32:14,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:14,026 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:32:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:14,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:32:14,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:14,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:14,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-03 07:32:14,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:14,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:14,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-03 07:32:14,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:32:14,116 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 10 treesize of output 9 [2018-12-03 07:32:14,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:14,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:14,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:14,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-12-03 07:32:14,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:32:14,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:14,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:32:14,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:14,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:14,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:14,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-03 07:32:14,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-12-03 07:32:14,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-12-03 07:32:14,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:14,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:14,175 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 07:32:14,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2018-12-03 07:32:14,354 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 55 treesize of output 39 [2018-12-03 07:32:14,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:14,357 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 18 [2018-12-03 07:32:14,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:14,362 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 07:32:14,362 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:14,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:14,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:14,367 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:55, output treesize:5 [2018-12-03 07:32:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:32:14,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:32:14,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-03 07:32:14,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:14,596 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 07:32:14,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:19 [2018-12-03 07:32:14,685 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-03 07:32:14,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:14,685 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 07:32:14,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:1 [2018-12-03 07:32:14,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 07:32:14,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:32:14,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 11] total 34 [2018-12-03 07:32:14,703 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:32:14,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 07:32:14,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 07:32:14,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1094, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 07:32:14,704 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 27 states. [2018-12-03 07:32:16,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:32:16,287 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2018-12-03 07:32:16,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 07:32:16,287 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-12-03 07:32:16,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:32:16,288 INFO L225 Difference]: With dead ends: 126 [2018-12-03 07:32:16,288 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 07:32:16,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=385, Invalid=2921, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 07:32:16,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 07:32:16,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 83. [2018-12-03 07:32:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 07:32:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2018-12-03 07:32:16,294 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 36 [2018-12-03 07:32:16,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:32:16,294 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2018-12-03 07:32:16,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 07:32:16,294 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2018-12-03 07:32:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 07:32:16,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:32:16,295 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:32:16,295 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION]=== [2018-12-03 07:32:16,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:16,295 INFO L82 PathProgramCache]: Analyzing trace with hash 16935946, now seen corresponding path program 1 times [2018-12-03 07:32:16,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:32:16,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:16,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:16,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:16,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:32:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:32:16,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:32:16,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:32:16,546 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-12-03 07:32:16,546 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [10], [13], [19], [43], [45], [53], [108], [109], [115], [122], [124], [130], [132], [135], [138], [143], [144], [148], [150], [154], [155], [159], [160], [161], [169], [170], [171] [2018-12-03 07:32:16,547 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:32:16,547 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:32:16,587 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:32:16,587 INFO L272 AbstractInterpreter]: Visited 30 different actions 65 times. Merged at 13 different actions 28 times. Never widened. Performed 645 root evaluator evaluations with a maximum evaluation depth of 4. Performed 645 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 4 different actions. Largest state had 27 variables. [2018-12-03 07:32:16,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:16,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:32:16,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:32:16,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:32:16,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:16,603 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:32:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:16,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:32:16,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:16,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:16,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-03 07:32:16,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:16,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:16,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-03 07:32:16,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:32:16,687 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 10 treesize of output 9 [2018-12-03 07:32:16,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:16,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:16,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:32:16,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:32:16,696 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:16,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:16,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:16,701 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-12-03 07:32:16,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:32:16,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:16,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:32:16,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:16,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:16,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:32:16,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:16,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:32:16,750 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:16,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:16,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:16,759 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-12-03 07:32:16,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 101 [2018-12-03 07:32:16,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21 [2018-12-03 07:32:16,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:16,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:16,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 85 [2018-12-03 07:32:16,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 22 treesize of output 21 [2018-12-03 07:32:16,812 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:16,818 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:16,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:16,827 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:119, output treesize:99 [2018-12-03 07:32:17,073 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 90 treesize of output 72 [2018-12-03 07:32:17,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-03 07:32:17,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:17,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:17,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 41 [2018-12-03 07:32:17,083 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:17,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:17,095 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 56 treesize of output 48 [2018-12-03 07:32:17,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 11 treesize of output 1 [2018-12-03 07:32:17,097 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:17,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:17,118 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 33 treesize of output 19 [2018-12-03 07:32:17,119 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:17,122 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:17,126 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 07:32:17,126 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:117, output treesize:11 [2018-12-03 07:32:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:32:17,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:32:17,549 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-12-03 07:32:17,853 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 48 treesize of output 52 [2018-12-03 07:32:17,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:17,861 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 28 treesize of output 26 [2018-12-03 07:32:17,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:17,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:32:17,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:60 [2018-12-03 07:32:17,966 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-03 07:32:17,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:17,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 39 treesize of output 31 [2018-12-03 07:32:17,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, 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 10 [2018-12-03 07:32:17,987 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:17,993 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 07:32:17,995 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 3 [2018-12-03 07:32:17,995 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:17,996 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:18,000 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:32:18,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:32:18,013 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:120, output treesize:11 [2018-12-03 07:32:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:32:18,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:32:18,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 42 [2018-12-03 07:32:18,118 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:32:18,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 07:32:18,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 07:32:18,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1671, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 07:32:18,119 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand 30 states. [2018-12-03 07:32:18,950 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 100 [2018-12-03 07:32:20,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:32:20,114 INFO L93 Difference]: Finished difference Result 186 states and 217 transitions. [2018-12-03 07:32:20,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 07:32:20,115 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2018-12-03 07:32:20,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:32:20,116 INFO L225 Difference]: With dead ends: 186 [2018-12-03 07:32:20,116 INFO L226 Difference]: Without dead ends: 186 [2018-12-03 07:32:20,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=510, Invalid=3912, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 07:32:20,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-03 07:32:20,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 98. [2018-12-03 07:32:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 07:32:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2018-12-03 07:32:20,121 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 36 [2018-12-03 07:32:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:32:20,122 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2018-12-03 07:32:20,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 07:32:20,122 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2018-12-03 07:32:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 07:32:20,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:32:20,123 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-12-03 07:32:20,123 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION]=== [2018-12-03 07:32:20,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:20,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2029185305, now seen corresponding path program 2 times [2018-12-03 07:32:20,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:32:20,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:20,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:20,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:20,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:32:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 07:32:20,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:32:20,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 07:32:20,155 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:32:20,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:32:20,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:32:20,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:32:20,156 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 7 states. [2018-12-03 07:32:20,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:32:20,204 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-12-03 07:32:20,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:32:20,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-12-03 07:32:20,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:32:20,205 INFO L225 Difference]: With dead ends: 74 [2018-12-03 07:32:20,205 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 07:32:20,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:32:20,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 07:32:20,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 07:32:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 07:32:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-12-03 07:32:20,207 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 39 [2018-12-03 07:32:20,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:32:20,207 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-12-03 07:32:20,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:32:20,207 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-12-03 07:32:20,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 07:32:20,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:32:20,207 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:32:20,208 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION]=== [2018-12-03 07:32:20,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:20,208 INFO L82 PathProgramCache]: Analyzing trace with hash -544417206, now seen corresponding path program 1 times [2018-12-03 07:32:20,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:32:20,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:20,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:32:20,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:20,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:32:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:20,249 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 07:32:20,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:32:20,249 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:32:20,250 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-12-03 07:32:20,250 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [10], [13], [17], [20], [43], [45], [51], [53], [56], [60], [66], [86], [95], [97], [108], [109], [115], [122], [124], [130], [132], [135], [138], [143], [144], [148], [150], [154], [155], [159], [160], [161], [162], [165], [169], [170], [171] [2018-12-03 07:32:20,251 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:32:20,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:32:20,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:32:20,342 INFO L272 AbstractInterpreter]: Visited 40 different actions 117 times. Merged at 18 different actions 42 times. Never widened. Performed 1049 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1049 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 12 fixpoints after 7 different actions. Largest state had 27 variables. [2018-12-03 07:32:20,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:20,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:32:20,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:32:20,346 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:32:20,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:20,353 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:32:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:20,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:32:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 07:32:20,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:32:20,431 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 07:32:20,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:32:20,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-12-03 07:32:20,447 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:32:20,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 07:32:20,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 07:32:20,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:32:20,448 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 10 states. [2018-12-03 07:32:20,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:32:20,567 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-12-03 07:32:20,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 07:32:20,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-12-03 07:32:20,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:32:20,568 INFO L225 Difference]: With dead ends: 89 [2018-12-03 07:32:20,568 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 07:32:20,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-12-03 07:32:20,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 07:32:20,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2018-12-03 07:32:20,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 07:32:20,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-12-03 07:32:20,571 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 46 [2018-12-03 07:32:20,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:32:20,571 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-12-03 07:32:20,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 07:32:20,572 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-12-03 07:32:20,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 07:32:20,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:32:20,572 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2018-12-03 07:32:20,573 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION]=== [2018-12-03 07:32:20,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:20,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1196176101, now seen corresponding path program 1 times [2018-12-03 07:32:20,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:32:20,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:20,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:20,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:20,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:32:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:20,607 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 07:32:20,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:32:20,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 07:32:20,607 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:32:20,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:32:20,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:32:20,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:32:20,608 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 7 states. [2018-12-03 07:32:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:32:20,665 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-12-03 07:32:20,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:32:20,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-12-03 07:32:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:32:20,666 INFO L225 Difference]: With dead ends: 72 [2018-12-03 07:32:20,666 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 07:32:20,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:32:20,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 07:32:20,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 07:32:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 07:32:20,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-12-03 07:32:20,667 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 47 [2018-12-03 07:32:20,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:32:20,667 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-12-03 07:32:20,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:32:20,667 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-12-03 07:32:20,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 07:32:20,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:32:20,668 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2018-12-03 07:32:20,668 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION]=== [2018-12-03 07:32:20,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:20,668 INFO L82 PathProgramCache]: Analyzing trace with hash -397462785, now seen corresponding path program 1 times [2018-12-03 07:32:20,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:32:20,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:20,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:20,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:20,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:32:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:20,750 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-03 07:32:20,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:32:20,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 07:32:20,751 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:32:20,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:32:20,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:32:20,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:32:20,751 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 9 states. [2018-12-03 07:32:20,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:32:20,883 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-12-03 07:32:20,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:32:20,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-12-03 07:32:20,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:32:20,884 INFO L225 Difference]: With dead ends: 78 [2018-12-03 07:32:20,884 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 07:32:20,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-03 07:32:20,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 07:32:20,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-12-03 07:32:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 07:32:20,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-12-03 07:32:20,886 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 54 [2018-12-03 07:32:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:32:20,886 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-12-03 07:32:20,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:32:20,886 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-12-03 07:32:20,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 07:32:20,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:32:20,886 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2018-12-03 07:32:20,887 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION]=== [2018-12-03 07:32:20,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:20,887 INFO L82 PathProgramCache]: Analyzing trace with hash 409590367, now seen corresponding path program 1 times [2018-12-03 07:32:20,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:32:20,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:20,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:20,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:20,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:32:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-03 07:32:20,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:32:20,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 07:32:20,930 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:32:20,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:32:20,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:32:20,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:32:20,931 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 9 states. [2018-12-03 07:32:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:32:21,000 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-12-03 07:32:21,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:32:21,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-12-03 07:32:21,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:32:21,001 INFO L225 Difference]: With dead ends: 77 [2018-12-03 07:32:21,001 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 07:32:21,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-03 07:32:21,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 07:32:21,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2018-12-03 07:32:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 07:32:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-12-03 07:32:21,003 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 57 [2018-12-03 07:32:21,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:32:21,004 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-12-03 07:32:21,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:32:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-12-03 07:32:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 07:32:21,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:32:21,004 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-03 07:32:21,004 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION]=== [2018-12-03 07:32:21,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:21,005 INFO L82 PathProgramCache]: Analyzing trace with hash -121851382, now seen corresponding path program 1 times [2018-12-03 07:32:21,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:32:21,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:21,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:21,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:32:21,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:32:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:21,609 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 07:32:21,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:32:21,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:32:21,610 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-12-03 07:32:21,610 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [10], [13], [17], [20], [43], [45], [51], [53], [56], [60], [66], [86], [95], [96], [97], [99], [101], [103], [108], [109], [115], [122], [124], [130], [132], [135], [138], [143], [144], [148], [150], [154], [155], [159], [160], [161], [162], [165], [169], [170], [171] [2018-12-03 07:32:21,611 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:32:21,611 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:32:21,674 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:32:21,674 INFO L272 AbstractInterpreter]: Visited 44 different actions 135 times. Merged at 23 different actions 55 times. Never widened. Performed 1185 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1185 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 14 fixpoints after 8 different actions. Largest state had 27 variables. [2018-12-03 07:32:21,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:32:21,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:32:21,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:32:21,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:32:21,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:32:21,687 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:32:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:32:21,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:32:21,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:21,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:21,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-03 07:32:21,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:21,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:21,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-03 07:32:21,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:32:21,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 07:32:21,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:21,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:21,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:21,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-12-03 07:32:21,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:32:21,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:21,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:32:21,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:21,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:21,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:21,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-03 07:32:21,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-12-03 07:32:21,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-12-03 07:32:21,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:21,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:21,896 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 07:32:21,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:41 [2018-12-03 07:32:24,206 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-03 07:32:24,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2018-12-03 07:32:24,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-12-03 07:32:24,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:24,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:32:24,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:32:24,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:90 [2018-12-03 07:32:24,297 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 25 [2018-12-03 07:32:24,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:24,299 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 25 treesize of output 18 [2018-12-03 07:32:24,300 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 07:32:24,303 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 07:32:24,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:32:24,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:9 [2018-12-03 07:32:24,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-12-03 07:32:24,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:24,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:24,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:24,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2018-12-03 07:32:24,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:24,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:24,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:32:24,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:42 [2018-12-03 07:32:24,569 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 40 treesize of output 32 [2018-12-03 07:32:24,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:24,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2018-12-03 07:32:24,580 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-03 07:32:24,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-03 07:32:24,622 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 4 xjuncts. [2018-12-03 07:32:24,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:87 [2018-12-03 07:32:24,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:24,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-03 07:32:24,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:24,806 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 07:32:24,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-12-03 07:32:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:32:24,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:32:25,055 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 07:32:25,057 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 07:32:25,058 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 07:32:25,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:15 [2018-12-03 07:32:29,271 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 07:32:29,273 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 07:32:29,277 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 07:32:29,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:37 [2018-12-03 07:32:46,181 WARN L180 SmtUtils]: Spent 2.68 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-03 07:32:49,663 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 24 treesize of output 11 [2018-12-03 07:32:49,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:49,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-03 07:32:49,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:49,673 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:32:49,674 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:32:49,675 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:32:49,677 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:32:49,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-03 07:32:49,681 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:62, output treesize:68 [2018-12-03 07:32:49,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-12-03 07:32:49,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:49,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-12-03 07:32:49,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:49,894 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:32:49,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:32:49,897 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:32:49,899 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:32:49,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-03 07:32:49,906 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:114 [2018-12-03 07:32:53,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 211 treesize of output 143 [2018-12-03 07:32:53,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 78 treesize of output 71 [2018-12-03 07:32:53,233 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,234 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 71 treesize of output 73 [2018-12-03 07:32:53,234 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:53,240 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:53,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 2 case distinctions, treesize of input 66 treesize of output 68 [2018-12-03 07:32:53,299 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,307 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 52 treesize of output 64 [2018-12-03 07:32:53,308 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:53,346 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,347 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 59 treesize of output 48 [2018-12-03 07:32:53,365 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2018-12-03 07:32:53,369 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:53,370 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2018-12-03 07:32:53,376 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:53,377 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,378 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 35 treesize of output 18 [2018-12-03 07:32:53,378 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:53,395 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:32:53,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:53,397 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 68 treesize of output 57 [2018-12-03 07:32:53,399 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 59 [2018-12-03 07:32:53,412 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,414 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 78 [2018-12-03 07:32:53,559 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 97 [2018-12-03 07:32:53,561 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,562 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 38 treesize of output 29 [2018-12-03 07:32:53,562 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:53,564 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 48 [2018-12-03 07:32:53,572 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-12-03 07:32:53,574 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 48 [2018-12-03 07:32:53,582 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-12-03 07:32:53,724 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,724 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 41 [2018-12-03 07:32:53,729 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:53,731 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,732 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 65 [2018-12-03 07:32:53,751 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 7 xjuncts. [2018-12-03 07:32:53,897 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,900 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 82 [2018-12-03 07:32:53,921 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 14 xjuncts. [2018-12-03 07:32:53,922 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,924 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:53,935 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 55 [2018-12-03 07:32:53,936 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 4 xjuncts. [2018-12-03 07:32:54,120 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:54,122 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:54,127 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 46 [2018-12-03 07:32:54,128 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:54,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 31 [2018-12-03 07:32:54,138 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:54,265 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:54,273 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 33 treesize of output 38 [2018-12-03 07:32:54,274 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 4 xjuncts. [2018-12-03 07:32:54,275 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:54,278 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:54,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 65 [2018-12-03 07:32:54,292 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 7 xjuncts. [2018-12-03 07:32:54,386 INFO L267 ElimStorePlain]: Start of recursive call 13: 5 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-12-03 07:32:54,451 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:54,473 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 1 new quantified variables, introduced 7 case distinctions, treesize of input 36 treesize of output 79 [2018-12-03 07:32:54,732 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 177 [2018-12-03 07:32:54,735 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:54,740 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 43 [2018-12-03 07:32:54,740 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:54,742 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:54,743 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 38 treesize of output 29 [2018-12-03 07:32:54,744 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:54,745 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:54,749 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 43 [2018-12-03 07:32:54,750 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:55,060 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:55,062 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:55,073 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 55 [2018-12-03 07:32:55,074 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 4 xjuncts. [2018-12-03 07:32:55,075 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:55,078 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:55,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 82 [2018-12-03 07:32:55,098 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 14 xjuncts. [2018-12-03 07:32:55,474 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:55,482 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 33 treesize of output 38 [2018-12-03 07:32:55,482 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 4 xjuncts. [2018-12-03 07:32:55,483 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:55,485 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:55,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 65 [2018-12-03 07:32:55,497 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 7 xjuncts. [2018-12-03 07:32:56,075 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:56,076 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:56,078 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:56,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 46 [2018-12-03 07:32:56,083 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:56,087 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 1 case distinctions, treesize of input 32 treesize of output 30 [2018-12-03 07:32:56,088 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:56,339 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:56,339 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 34 treesize of output 25 [2018-12-03 07:32:56,340 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:56,342 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:56,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 44 [2018-12-03 07:32:56,353 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 4 xjuncts. [2018-12-03 07:32:56,592 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:56,593 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:56,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 65 [2018-12-03 07:32:56,607 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 6 xjuncts. [2018-12-03 07:32:56,609 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:56,616 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 33 treesize of output 38 [2018-12-03 07:32:56,617 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 4 xjuncts. [2018-12-03 07:32:56,859 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:56,863 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 1 case distinctions, treesize of input 40 treesize of output 35 [2018-12-03 07:32:56,863 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:56,865 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:56,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 54 [2018-12-03 07:32:56,875 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 3 xjuncts. [2018-12-03 07:32:57,047 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:57,049 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:57,054 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 46 [2018-12-03 07:32:57,055 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:57,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 31 [2018-12-03 07:32:57,064 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:57,200 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:57,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 57 [2018-12-03 07:32:57,218 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 8 xjuncts. [2018-12-03 07:32:57,219 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:57,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 84 [2018-12-03 07:32:57,242 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-03 07:32:57,244 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 20 xjuncts. [2018-12-03 07:32:57,393 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:57,409 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 67 [2018-12-03 07:32:57,410 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 10 xjuncts. [2018-12-03 07:32:57,417 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 1 case distinctions, treesize of input 26 treesize of output 22 [2018-12-03 07:32:57,417 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:57,517 INFO L267 ElimStorePlain]: Start of recursive call 25: 11 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-12-03 07:32:57,591 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-12-03 07:32:57,669 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-12-03 07:32:57,786 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 40 [2018-12-03 07:32:57,790 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:57,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 52 [2018-12-03 07:32:57,863 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:57,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 57 [2018-12-03 07:32:57,878 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 3 xjuncts. [2018-12-03 07:32:57,879 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:57,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 57 [2018-12-03 07:32:57,895 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 3 xjuncts. [2018-12-03 07:32:57,897 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:57,904 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 35 treesize of output 40 [2018-12-03 07:32:57,905 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:57,975 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:57,979 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2018-12-03 07:32:57,980 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:57,984 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 1 case distinctions, treesize of input 22 treesize of output 18 [2018-12-03 07:32:57,984 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:58,035 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 1 case distinctions, treesize of input 22 treesize of output 18 [2018-12-03 07:32:58,035 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:58,037 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:58,042 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2018-12-03 07:32:58,043 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:58,072 INFO L267 ElimStorePlain]: Start of recursive call 48: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-03 07:32:58,094 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-03 07:32:58,183 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 13 xjuncts. [2018-12-03 07:32:58,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 12 xjuncts. [2018-12-03 07:32:58,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-12-03 07:32:58,354 INFO L202 ElimStorePlain]: Needed 55 recursive calls to eliminate 5 variables, input treesize:236, output treesize:112 [2018-12-03 07:33:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:33:02,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:33:02,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28, 28] total 76 [2018-12-03 07:33:02,128 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:33:02,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 07:33:02,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 07:33:02,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=5543, Unknown=10, NotChecked=0, Total=5852 [2018-12-03 07:33:02,130 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 52 states. [2018-12-03 07:33:12,873 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2018-12-03 07:33:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:33:21,662 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-12-03 07:33:21,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 07:33:21,663 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 59 [2018-12-03 07:33:21,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:33:21,663 INFO L225 Difference]: With dead ends: 87 [2018-12-03 07:33:21,663 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 07:33:21,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 68 SyntacticMatches, 7 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2423 ImplicationChecksByTransitivity, 51.6s TimeCoverageRelationStatistics Valid=787, Invalid=9911, Unknown=14, NotChecked=0, Total=10712 [2018-12-03 07:33:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 07:33:21,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2018-12-03 07:33:21,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 07:33:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-12-03 07:33:21,667 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 59 [2018-12-03 07:33:21,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:33:21,667 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-12-03 07:33:21,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 07:33:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-12-03 07:33:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 07:33:21,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:33:21,668 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-03 07:33:21,668 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION]=== [2018-12-03 07:33:21,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:33:21,668 INFO L82 PathProgramCache]: Analyzing trace with hash -121851381, now seen corresponding path program 1 times [2018-12-03 07:33:21,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:33:21,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:33:21,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:33:21,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:33:21,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:33:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:33:22,423 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 07:33:22,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:33:22,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:33:22,423 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-12-03 07:33:22,423 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [10], [13], [17], [20], [43], [45], [51], [53], [56], [60], [66], [86], [95], [96], [98], [99], [101], [103], [108], [109], [115], [122], [124], [130], [132], [135], [138], [143], [144], [148], [150], [154], [155], [159], [160], [161], [162], [165], [169], [170], [171] [2018-12-03 07:33:22,424 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:33:22,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:33:22,482 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:33:22,482 INFO L272 AbstractInterpreter]: Visited 44 different actions 126 times. Merged at 23 different actions 47 times. Never widened. Performed 1121 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1121 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 13 fixpoints after 8 different actions. Largest state had 27 variables. [2018-12-03 07:33:22,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:33:22,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:33:22,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:33:22,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:33:22,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:33:22,493 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:33:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:33:22,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:33:22,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 6 treesize of output 5 [2018-12-03 07:33:22,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 07:33:22,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:33:22,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:33:22,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-03 07:33:22,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 07:33:22,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-12-03 07:33:22,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:33:22,630 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 10 treesize of output 9 [2018-12-03 07:33:22,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:33:22,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 07:33:22,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,653 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:42 [2018-12-03 07:33:22,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:33:22,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:33:22,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:33:22,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:33:22,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:33:22,716 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:33:22,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 36 [2018-12-03 07:33:22,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,730 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:60 [2018-12-03 07:33:22,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2018-12-03 07:33:22,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 14 treesize of output 13 [2018-12-03 07:33:22,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-12-03 07:33:22,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:33:22,800 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,804 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:22,815 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:106, output treesize:86 [2018-12-03 07:33:23,058 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 30 [2018-12-03 07:33:23,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:33:23,061 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 15 treesize of output 8 [2018-12-03 07:33:23,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:23,067 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 07:33:23,067 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:23,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:23,081 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 44 treesize of output 37 [2018-12-03 07:33:23,083 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 07:33:23,083 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:23,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:33:23,090 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 25 treesize of output 18 [2018-12-03 07:33:23,090 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:33:23,095 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 07:33:23,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:33:23,103 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:92, output treesize:21 [2018-12-03 07:33:49,519 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 38 [2018-12-03 07:33:49,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 58 [2018-12-03 07:33:49,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 17 [2018-12-03 07:33:49,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 07:33:49,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:33:49,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 84 [2018-12-03 07:33:49,584 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 30 treesize of output 3 [2018-12-03 07:33:49,584 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:49,591 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:49,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 94 [2018-12-03 07:33:49,604 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 30 treesize of output 17 [2018-12-03 07:33:49,604 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-03 07:33:49,614 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:33:49,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-03 07:33:49,645 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:166, output treesize:175 [2018-12-03 07:33:49,723 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 25 [2018-12-03 07:33:49,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:33:49,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-12-03 07:33:49,726 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 07:33:49,729 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 07:33:49,741 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 19 treesize of output 15 [2018-12-03 07:33:49,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:33:49,743 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 15 treesize of output 8 [2018-12-03 07:33:49,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:49,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:49,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:33:49,751 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:21 [2018-12-03 07:33:49,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 37 [2018-12-03 07:33:49,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:33:49,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:33:49,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:33:49,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2018-12-03 07:33:49,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:49,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:49,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-12-03 07:33:49,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:33:49,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:33:49,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:33:49,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-12-03 07:33:49,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:49,888 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:49,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-03 07:33:49,900 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:104, output treesize:74 [2018-12-03 07:33:50,046 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 40 treesize of output 32 [2018-12-03 07:33:50,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:33:50,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2018-12-03 07:33:50,061 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-03 07:33:50,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-03 07:33:50,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-03 07:33:50,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:33:50,120 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 22 treesize of output 33 [2018-12-03 07:33:50,120 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 07:33:50,127 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:33:50,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 8 xjuncts. [2018-12-03 07:33:50,153 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:78, output treesize:281 [2018-12-03 07:33:50,457 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 07:33:50,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:33:50,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:50,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:50,970 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:33:50,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:33:51,010 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:33:51,013 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:33:51,029 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 07:33:51,032 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:33:51,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 07:33:51,041 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:91, output treesize:34 [2018-12-03 07:33:51,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:51,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:51,393 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:33:51,400 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:33:51,422 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:33:51,428 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:33:51,447 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 07:33:51,452 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:33:51,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 07:33:51,468 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:157, output treesize:117 [2018-12-03 07:33:53,668 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 56 [2018-12-03 07:33:53,845 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 07:33:53,850 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 07:33:53,868 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:53,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:53,884 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:33:53,885 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:33:53,893 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 07:33:53,895 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:33:53,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-12-03 07:33:53,900 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:172, output treesize:94 [2018-12-03 07:33:56,066 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 44 [2018-12-03 07:33:56,539 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-12-03 07:33:56,742 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:33:56,743 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:344) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:217) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-03 07:33:56,748 INFO L168 Benchmark]: Toolchain (without parser) took 105851.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -104.4 MB). Peak memory consumption was 104.3 MB. Max. memory is 11.5 GB. [2018-12-03 07:33:56,749 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:33:56,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-03 07:33:56,749 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.65 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 07:33:56,750 INFO L168 Benchmark]: Boogie Preprocessor took 20.11 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 07:33:56,750 INFO L168 Benchmark]: RCFGBuilder took 268.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-03 07:33:56,750 INFO L168 Benchmark]: TraceAbstraction took 105240.27 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 91.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 108.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:33:56,751 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 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 301.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.65 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 20.11 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 268.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 105240.27 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 91.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 108.7 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:344) 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 07:33:57,966 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 07:33:57,967 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 07:33:57,973 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 07:33:57,974 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 07:33:57,974 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 07:33:57,975 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 07:33:57,976 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 07:33:57,978 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 07:33:57,978 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 07:33:57,979 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 07:33:57,979 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 07:33:57,979 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 07:33:57,980 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 07:33:57,980 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 07:33:57,981 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 07:33:57,982 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 07:33:57,983 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 07:33:57,984 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 07:33:57,984 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 07:33:57,985 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 07:33:57,986 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 07:33:57,988 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 07:33:57,988 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 07:33:57,988 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 07:33:57,988 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 07:33:57,989 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 07:33:57,989 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 07:33:57,990 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 07:33:57,990 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 07:33:57,990 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 07:33:57,991 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 07:33:57,991 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 07:33:57,991 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 07:33:57,991 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 07:33:57,992 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 07:33:57,992 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-03 07:33:58,000 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 07:33:58,001 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 07:33:58,001 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 07:33:58,001 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 07:33:58,001 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 07:33:58,001 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 07:33:58,001 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 07:33:58,002 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 07:33:58,002 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 07:33:58,002 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 07:33:58,002 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 07:33:58,002 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 07:33:58,002 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 07:33:58,002 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 07:33:58,003 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 07:33:58,003 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 07:33:58,003 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 07:33:58,003 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 07:33:58,003 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 07:33:58,003 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 07:33:58,003 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 07:33:58,003 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 07:33:58,003 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-03 07:33:58,003 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-03 07:33:58,003 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 07:33:58,004 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 07:33:58,004 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 07:33:58,004 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 07:33:58,004 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 07:33:58,004 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 07:33:58,004 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:33:58,004 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 07:33:58,004 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 07:33:58,004 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-03 07:33:58,004 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 07:33:58,004 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-03 07:33:58,005 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_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 -> cfdde8b1798318c3bb26b76a748741913b280952 [2018-12-03 07:33:58,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 07:33:58,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 07:33:58,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 07:33:58,032 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 07:33:58,032 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 07:33:58,032 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:33:58,067 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/data/44b213cd7/cbe0314b34cd43cdb72dd7abaa71383f/FLAGcb451b773 [2018-12-03 07:33:58,438 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 07:33:58,438 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/sv-benchmarks/c/list-simple/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:33:58,445 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/data/44b213cd7/cbe0314b34cd43cdb72dd7abaa71383f/FLAGcb451b773 [2018-12-03 07:33:58,810 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/data/44b213cd7/cbe0314b34cd43cdb72dd7abaa71383f [2018-12-03 07:33:58,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 07:33:58,818 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 07:33:58,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 07:33:58,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 07:33:58,824 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 07:33:58,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:33:58" (1/1) ... [2018-12-03 07:33:58,827 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 07:33:58, skipping insertion in model container [2018-12-03 07:33:58,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:33:58" (1/1) ... [2018-12-03 07:33:58,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 07:33:58,852 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 07:33:59,011 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:33:59,019 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 07:33:59,049 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:33:59,109 INFO L195 MainTranslator]: Completed translation [2018-12-03 07:33:59,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:33:59 WrapperNode [2018-12-03 07:33:59,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 07:33:59,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 07:33:59,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 07:33:59,109 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 07:33:59,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:33:59" (1/1) ... [2018-12-03 07:33:59,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:33:59" (1/1) ... [2018-12-03 07:33:59,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 07:33:59,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 07:33:59,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 07:33:59,132 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 07:33:59,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:33:59" (1/1) ... [2018-12-03 07:33:59,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:33:59" (1/1) ... [2018-12-03 07:33:59,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:33:59" (1/1) ... [2018-12-03 07:33:59,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:33:59" (1/1) ... [2018-12-03 07:33:59,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:33:59" (1/1) ... [2018-12-03 07:33:59,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:33:59" (1/1) ... [2018-12-03 07:33:59,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:33:59" (1/1) ... [2018-12-03 07:33:59,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 07:33:59,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 07:33:59,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 07:33:59,157 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 07:33:59,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:33:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:33:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-03 07:33:59,188 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-03 07:33:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-03 07:33:59,188 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-03 07:33:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 07:33:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-03 07:33:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2018-12-03 07:33:59,189 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2018-12-03 07:33:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2018-12-03 07:33:59,189 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2018-12-03 07:33:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 07:33:59,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 07:33:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 07:33:59,189 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 07:33:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 07:33:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 07:33:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 07:33:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-03 07:33:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-03 07:33:59,190 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-03 07:33:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 07:33:59,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 07:33:59,467 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 07:33:59,467 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-03 07:33:59,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:33:59 BoogieIcfgContainer [2018-12-03 07:33:59,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 07:33:59,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 07:33:59,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 07:33:59,470 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 07:33:59,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 07:33:58" (1/3) ... [2018-12-03 07:33:59,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4588eb48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:33:59, skipping insertion in model container [2018-12-03 07:33:59,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:33:59" (2/3) ... [2018-12-03 07:33:59,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4588eb48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:33:59, skipping insertion in model container [2018-12-03 07:33:59,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:33:59" (3/3) ... [2018-12-03 07:33:59,472 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:33:59,478 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 07:33:59,482 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-12-03 07:33:59,491 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-12-03 07:33:59,506 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 07:33:59,506 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 07:33:59,507 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 07:33:59,507 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 07:33:59,507 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 07:33:59,507 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 07:33:59,507 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 07:33:59,507 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 07:33:59,507 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 07:33:59,516 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-12-03 07:33:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 07:33:59,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:33:59,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:33:59,523 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:33:59,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:33:59,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1814732104, now seen corresponding path program 1 times [2018-12-03 07:33:59,528 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:33:59,529 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:33:59,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:33:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:33:59,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:33:59,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:33:59,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:59,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:59,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 07:33:59,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 07:33:59,623 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:33:59,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:33:59,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 07:33:59,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:33:59,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:33:59,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:33:59,638 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-12-03 07:33:59,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:33:59,736 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-12-03 07:33:59,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:33:59,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-03 07:33:59,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:33:59,744 INFO L225 Difference]: With dead ends: 83 [2018-12-03 07:33:59,744 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 07:33:59,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:33:59,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 07:33:59,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-12-03 07:33:59,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 07:33:59,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-12-03 07:33:59,768 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 11 [2018-12-03 07:33:59,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:33:59,768 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-12-03 07:33:59,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:33:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-12-03 07:33:59,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 07:33:59,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:33:59,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:33:59,769 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:33:59,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:33:59,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1814732105, now seen corresponding path program 1 times [2018-12-03 07:33:59,770 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:33:59,770 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:33:59,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:33:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:33:59,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:33:59,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:33:59,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:59,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:59,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 07:33:59,828 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 07:33:59,829 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:33:59,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:33:59,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 07:33:59,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:33:59,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:33:59,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:33:59,832 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 3 states. [2018-12-03 07:33:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:33:59,919 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-12-03 07:33:59,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:33:59,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-03 07:33:59,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:33:59,922 INFO L225 Difference]: With dead ends: 73 [2018-12-03 07:33:59,922 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 07:33:59,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:33:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 07:33:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-12-03 07:33:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 07:33:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-12-03 07:33:59,928 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 11 [2018-12-03 07:33:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:33:59,929 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-12-03 07:33:59,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:33:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-12-03 07:33:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 07:33:59,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:33:59,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:33:59,930 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:33:59,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:33:59,930 INFO L82 PathProgramCache]: Analyzing trace with hash -272916596, now seen corresponding path program 1 times [2018-12-03 07:33:59,931 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:33:59,931 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:33:59,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:33:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:33:59,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:33:59,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:33:59,985 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:33:59,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:33:59,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:33:59,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:33:59,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:33:59,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:33:59,987 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 3 states. [2018-12-03 07:34:00,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:34:00,020 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-12-03 07:34:00,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:34:00,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 07:34:00,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:34:00,022 INFO L225 Difference]: With dead ends: 79 [2018-12-03 07:34:00,022 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 07:34:00,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:34:00,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 07:34:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-12-03 07:34:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 07:34:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-12-03 07:34:00,028 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 15 [2018-12-03 07:34:00,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:34:00,029 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-12-03 07:34:00,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:34:00,029 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-12-03 07:34:00,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 07:34:00,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:34:00,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:34:00,030 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:34:00,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:34:00,030 INFO L82 PathProgramCache]: Analyzing trace with hash -694338034, now seen corresponding path program 1 times [2018-12-03 07:34:00,030 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:34:00,031 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:34:00,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:34:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:34:00,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:34:00,093 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 07:34:00,093 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:34:00,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:34:00,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:34:00,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:34:00,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:34:00,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:34:00,095 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 5 states. [2018-12-03 07:34:00,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:34:00,143 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-12-03 07:34:00,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:34:00,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-03 07:34:00,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:34:00,144 INFO L225 Difference]: With dead ends: 79 [2018-12-03 07:34:00,145 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 07:34:00,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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 07:34:00,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 07:34:00,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-12-03 07:34:00,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 07:34:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-12-03 07:34:00,148 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 18 [2018-12-03 07:34:00,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:34:00,148 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-12-03 07:34:00,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:34:00,149 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-12-03 07:34:00,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 07:34:00,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:34:00,149 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:34:00,149 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:34:00,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:34:00,150 INFO L82 PathProgramCache]: Analyzing trace with hash -589776010, now seen corresponding path program 1 times [2018-12-03 07:34:00,150 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:34:00,150 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:34:00,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:34:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:34:00,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:34:00,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:34:00,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:00,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:00,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 07:34:00,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 07:34:00,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:00,262 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 07:34:00,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-03 07:34:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:34:00,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:34:00,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:34:00,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:34:00,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:34:00,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:34:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:34:00,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:34:00,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:34:00,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:00,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:00,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 07:34:00,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:00,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:00,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-03 07:34:00,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:00,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:34:00,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2018-12-03 07:34:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:34:00,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:34:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:34:00,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:34:00,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4, 4] total 6 [2018-12-03 07:34:00,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:34:00,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:34:00,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:34:00,428 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 7 states. [2018-12-03 07:34:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:34:00,672 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-12-03 07:34:00,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:34:00,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-03 07:34:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:34:00,674 INFO L225 Difference]: With dead ends: 79 [2018-12-03 07:34:00,674 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 07:34:00,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:34:00,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 07:34:00,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2018-12-03 07:34:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 07:34:00,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-12-03 07:34:00,679 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 22 [2018-12-03 07:34:00,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:34:00,679 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-12-03 07:34:00,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:34:00,679 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-12-03 07:34:00,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 07:34:00,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:34:00,680 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:34:00,680 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:34:00,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:34:00,681 INFO L82 PathProgramCache]: Analyzing trace with hash -589776009, now seen corresponding path program 1 times [2018-12-03 07:34:00,681 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:34:00,681 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:34:00,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:34:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:34:00,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:34:00,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:34:00,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:00,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:34:00,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:00,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:00,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-03 07:34:00,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:00,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:00,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 07:34:00,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:00,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 14 treesize of output 17 [2018-12-03 07:34:00,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:00,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:34:00,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-12-03 07:34:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:34:00,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:34:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:34:01,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:34:01,054 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:34:01,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:34:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:34:01,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:34:01,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:34:01,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:01,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:34:01,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:01,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:01,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-03 07:34:01,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:01,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-03 07:34:01,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:01,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:01,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:01,126 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 07:34:01,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:01,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:34:01,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-12-03 07:34:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:34:01,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:34:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:34:01,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:34:01,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 5] total 8 [2018-12-03 07:34:01,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:34:01,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:34:01,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:34:01,327 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 9 states. [2018-12-03 07:34:01,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:34:01,780 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-12-03 07:34:01,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:34:01,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-12-03 07:34:01,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:34:01,781 INFO L225 Difference]: With dead ends: 78 [2018-12-03 07:34:01,782 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 07:34:01,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-03 07:34:01,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 07:34:01,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2018-12-03 07:34:01,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 07:34:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-12-03 07:34:01,785 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 22 [2018-12-03 07:34:01,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:34:01,786 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-12-03 07:34:01,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:34:01,786 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-12-03 07:34:01,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 07:34:01,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:34:01,786 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] [2018-12-03 07:34:01,787 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:34:01,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:34:01,787 INFO L82 PathProgramCache]: Analyzing trace with hash 84976100, now seen corresponding path program 1 times [2018-12-03 07:34:01,787 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:34:01,787 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:34:01,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:34:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:34:01,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:34:01,893 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 07:34:01,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:34:01,981 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 07:34:01,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:34:01,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:34:01,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:34:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:34:02,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:34:02,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:34:02,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:02,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:02,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 07:34:02,109 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 07:34:02,109 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:34:02,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 07:34:02,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 6] total 16 [2018-12-03 07:34:02,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 07:34:02,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 07:34:02,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-12-03 07:34:02,125 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 16 states. [2018-12-03 07:34:03,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:34:03,211 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-12-03 07:34:03,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 07:34:03,212 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-12-03 07:34:03,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:34:03,212 INFO L225 Difference]: With dead ends: 90 [2018-12-03 07:34:03,212 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 07:34:03,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-12-03 07:34:03,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 07:34:03,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2018-12-03 07:34:03,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 07:34:03,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-12-03 07:34:03,215 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 25 [2018-12-03 07:34:03,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:34:03,215 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-12-03 07:34:03,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 07:34:03,216 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-12-03 07:34:03,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 07:34:03,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:34:03,216 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] [2018-12-03 07:34:03,216 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:34:03,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:34:03,216 INFO L82 PathProgramCache]: Analyzing trace with hash 701718863, now seen corresponding path program 1 times [2018-12-03 07:34:03,217 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:34:03,217 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:34:03,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:34:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:34:03,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:34:03,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:34:03,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:34:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:34:03,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:34:03,278 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:34:03,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:34:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:34:03,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:34:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:34:03,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:34:03,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:34:03,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:34:03,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4] total 4 [2018-12-03 07:34:03,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:34:03,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:34:03,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:34:03,341 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 4 states. [2018-12-03 07:34:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:34:03,411 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-12-03 07:34:03,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:34:03,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-03 07:34:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:34:03,412 INFO L225 Difference]: With dead ends: 78 [2018-12-03 07:34:03,412 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 07:34:03,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:34:03,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 07:34:03,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 07:34:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 07:34:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-12-03 07:34:03,416 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 32 [2018-12-03 07:34:03,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:34:03,417 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-12-03 07:34:03,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:34:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-12-03 07:34:03,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 07:34:03,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:34:03,418 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:34:03,418 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:34:03,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:34:03,418 INFO L82 PathProgramCache]: Analyzing trace with hash -649114503, now seen corresponding path program 1 times [2018-12-03 07:34:03,419 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:34:03,419 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:34:03,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:34:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:34:03,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:34:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 07:34:03,537 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:34:03,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:34:03,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:34:03,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:34:03,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:34:03,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:34:03,539 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 6 states. [2018-12-03 07:34:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:34:03,580 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-12-03 07:34:03,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:34:03,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-12-03 07:34:03,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:34:03,581 INFO L225 Difference]: With dead ends: 81 [2018-12-03 07:34:03,581 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 07:34:03,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 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 07:34:03,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 07:34:03,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-12-03 07:34:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 07:34:03,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2018-12-03 07:34:03,583 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 33 [2018-12-03 07:34:03,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:34:03,584 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2018-12-03 07:34:03,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:34:03,584 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2018-12-03 07:34:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 07:34:03,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:34:03,584 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:34:03,584 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:34:03,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:34:03,584 INFO L82 PathProgramCache]: Analyzing trace with hash -649114448, now seen corresponding path program 1 times [2018-12-03 07:34:03,585 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:34:03,585 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:34:03,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:34:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:34:03,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:34:03,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:34:03,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:03,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:03,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 07:34:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 07:34:03,752 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:34:03,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:34:03,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 07:34:03,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:34:03,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:34:03,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:34:03,755 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 9 states. [2018-12-03 07:34:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:34:04,234 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-12-03 07:34:04,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:34:04,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-12-03 07:34:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:34:04,235 INFO L225 Difference]: With dead ends: 78 [2018-12-03 07:34:04,235 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 07:34:04,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-03 07:34:04,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 07:34:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-12-03 07:34:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 07:34:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-12-03 07:34:04,238 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 33 [2018-12-03 07:34:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:34:04,238 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-12-03 07:34:04,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:34:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-12-03 07:34:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 07:34:04,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:34:04,239 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:34:04,239 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:34:04,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:34:04,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1825800630, now seen corresponding path program 1 times [2018-12-03 07:34:04,239 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:34:04,239 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:34:04,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:34:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:34:04,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:34:04,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:34:04,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:04,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:04,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 07:34:04,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:04,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:04,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-03 07:34:04,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:04,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:04,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:19 [2018-12-03 07:34:04,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:34:04,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 07:34:04,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:04,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:04,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:04,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-12-03 07:34:04,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:34:04,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:04,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:34:04,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:04,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:04,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:04,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-12-03 07:34:04,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-12-03 07:34:04,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-12-03 07:34:04,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:04,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:04,520 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 07:34:04,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:55 [2018-12-03 07:34:04,855 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 46 treesize of output 32 [2018-12-03 07:34:04,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2018-12-03 07:34:04,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:04,878 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 07:34:04,878 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:04,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:04,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:34:04,892 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:16 [2018-12-03 07:34:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:34:05,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:34:05,606 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-12-03 07:34:05,798 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-03 07:34:05,901 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-03 07:34:06,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 43 treesize of output 35 [2018-12-03 07:34:06,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 11 treesize of output 10 [2018-12-03 07:34:06,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:06,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 24 treesize of output 20 [2018-12-03 07:34:06,412 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 7 [2018-12-03 07:34:06,413 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:06,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:06,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:06,416 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 07:34:06,417 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:7 [2018-12-03 07:34:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:34:06,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:34:06,543 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:34:06,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:34:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:34:06,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:34:06,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:34:06,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:06,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:06,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 07:34:06,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:06,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:06,703 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 07:34:06,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:06,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:06,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-03 07:34:06,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:34:06,783 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 10 treesize of output 9 [2018-12-03 07:34:06,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:06,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:06,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:06,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:17 [2018-12-03 07:34:06,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:34:06,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:06,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:34:06,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:06,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:06,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:06,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:26 [2018-12-03 07:34:06,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-12-03 07:34: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 16 treesize of output 15 [2018-12-03 07:34:06,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:06,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:06,971 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 07:34:06,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:51 [2018-12-03 07:34:07,628 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 47 treesize of output 33 [2018-12-03 07:34:07,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, 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 07:34:07,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:07,644 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 07:34:07,644 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:07,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:07,651 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 07:34:07,651 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:47, output treesize:7 [2018-12-03 07:34:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:34:07,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:34:08,031 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2018-12-03 07:34:08,328 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 30 treesize of output 25 [2018-12-03 07:34:08,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:08,333 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 07:34:08,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-12-03 07:34:08,506 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:08,506 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 2 variables, input treesize:62, output treesize:1 [2018-12-03 07:34:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 07:34:08,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:34:08,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 16, 12] total 40 [2018-12-03 07:34:08,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 07:34:08,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 07:34:08,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1485, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 07:34:08,526 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 41 states. [2018-12-03 07:34:11,619 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-12-03 07:34:12,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:34:12,389 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2018-12-03 07:34:12,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 07:34:12,390 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 36 [2018-12-03 07:34:12,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:34:12,391 INFO L225 Difference]: With dead ends: 91 [2018-12-03 07:34:12,391 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 07:34:12,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 98 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=353, Invalid=2509, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 07:34:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 07:34:12,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2018-12-03 07:34:12,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 07:34:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2018-12-03 07:34:12,394 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 36 [2018-12-03 07:34:12,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:34:12,394 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2018-12-03 07:34:12,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 07:34:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2018-12-03 07:34:12,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 07:34:12,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:34:12,395 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:34:12,395 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:34:12,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:34:12,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1825800629, now seen corresponding path program 1 times [2018-12-03 07:34:12,396 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:34:12,396 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:34:12,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:34:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:34:12,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:34:12,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:34:12,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:34:12,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-03 07:34:12,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:12,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-03 07:34:12,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:12,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:12,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 07:34:12,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2018-12-03 07:34:12,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:34:12,635 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 10 treesize of output 9 [2018-12-03 07:34:12,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:34:12,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:34:12,665 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,668 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,683 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-12-03 07:34:12,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:34:12,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:12,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:34:12,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:34:12,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:12,770 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:12,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 36 [2018-12-03 07:34:12,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,777 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,798 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2018-12-03 07:34:12,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2018-12-03 07:34:12,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-03 07:34:12,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-12-03 07:34:12,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:34:12,908 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:12,940 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:83 [2018-12-03 07:34:13,346 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 33 treesize of output 29 [2018-12-03 07:34:13,351 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 07:34:13,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:13,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:13,375 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 43 treesize of output 29 [2018-12-03 07:34:13,379 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 10 [2018-12-03 07:34:13,379 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:13,388 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 07:34:13,388 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:13,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:13,400 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 07:34:13,400 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:82, output treesize:20 [2018-12-03 07:34:13,499 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:34:13,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:34:14,934 WARN L180 SmtUtils]: Spent 824.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-12-03 07:34:15,281 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-03 07:34:15,646 WARN L180 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-03 07:34:16,014 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-03 07:34:17,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 77 treesize of output 49 [2018-12-03 07:34:17,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10 [2018-12-03 07:34:17,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:17,190 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 21 treesize of output 19 [2018-12-03 07:34:17,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-03 07:34:17,194 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:17,200 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:17,205 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 07:34:17,209 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 5 [2018-12-03 07:34:17,209 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:17,213 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:17,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-03 07:34:17,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 39 treesize of output 31 [2018-12-03 07:34:17,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-03 07:34:17,433 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:17,458 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 21 treesize of output 19 [2018-12-03 07:34:17,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-03 07:34:17,460 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:17,465 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:17,467 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 07:34:17,469 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 3 [2018-12-03 07:34:17,469 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:17,471 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:17,487 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-03 07:34:17,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 79 treesize of output 71 [2018-12-03 07:34:17,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-03 07:34:17,682 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:17,741 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 60 treesize of output 56 [2018-12-03 07:34:17,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 56 treesize of output 43 [2018-12-03 07:34:17,746 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:17,752 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:17,756 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 21 treesize of output 19 [2018-12-03 07:34:17,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-03 07:34:17,759 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:17,772 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:17,827 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-03 07:34:18,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 43 treesize of output 35 [2018-12-03 07:34:18,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10 [2018-12-03 07:34:18,095 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:18,107 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 07:34:18,110 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 7 [2018-12-03 07:34:18,110 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:18,112 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:18,115 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:18,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 54 treesize of output 45 [2018-12-03 07:34:18,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-03 07:34:18,174 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:18,191 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 10 treesize of output 8 [2018-12-03 07:34:18,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-03 07:34:18,194 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:18,197 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:18,208 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:18,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-12-03 07:34:18,265 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 4 variables, input treesize:196, output treesize:73 [2018-12-03 07:34:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:34:18,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:34:18,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:34:18,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:34:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:34:18,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:34:18,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:34:18,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:18,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:34:18,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:18,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:18,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-03 07:34:18,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:18,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-03 07:34:18,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:19,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:19,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 07:34:19,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2018-12-03 07:34:19,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:34:19,028 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 10 treesize of output 9 [2018-12-03 07:34:19,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:34:19,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 07:34:19,059 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,062 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,078 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:41 [2018-12-03 07:34:19,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:34:19,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:19,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:34:19,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:34:19,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:34:19,137 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:19,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 36 [2018-12-03 07:34:19,138 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,166 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:59 [2018-12-03 07:34:19,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 84 [2018-12-03 07:34:19,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:34:19,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-12-03 07:34:19,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:34:19,240 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:116, output treesize:85 [2018-12-03 07:34:19,378 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 33 treesize of output 29 [2018-12-03 07:34:19,381 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 07:34:19,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,402 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 43 treesize of output 29 [2018-12-03 07:34:19,404 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 07:34:19,404 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,413 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 10 [2018-12-03 07:34:19,413 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:19,424 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 07:34:19,424 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:82, output treesize:20 [2018-12-03 07:34:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:34:19,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:34:21,444 WARN L180 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2018-12-03 07:34:21,784 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-03 07:34:22,026 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-03 07:34:22,285 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-03 07:34:25,180 WARN L180 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 108 DAG size of output: 66 [2018-12-03 07:34:25,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 108 treesize of output 90 [2018-12-03 07:34:25,308 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2018-12-03 07:34:25,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 20 [2018-12-03 07:34:25,320 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:25,321 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:25,322 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 37 [2018-12-03 07:34:25,322 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:25,339 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:25,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-12-03 07:34:25,378 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:25,378 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:25,379 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 16 [2018-12-03 07:34:25,379 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:25,388 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:25,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:25,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 65 treesize of output 64 [2018-12-03 07:34:25,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 39 treesize of output 37 [2018-12-03 07:34:25,692 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:25,692 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:25,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2018-12-03 07:34:25,693 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:25,710 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:25,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 07:34:25,717 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:25,718 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:25,718 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 37 [2018-12-03 07:34:25,719 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:25,733 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:25,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-12-03 07:34:25,834 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:25,835 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:25,836 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 14 [2018-12-03 07:34:25,836 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:25,859 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:34:25,863 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 33 treesize of output 27 [2018-12-03 07:34:25,868 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:25,869 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:25,869 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 14 [2018-12-03 07:34:25,869 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:25,887 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:25,944 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:34:26,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 109 [2018-12-03 07:34:26,879 WARN L180 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2018-12-03 07:34:26,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 20 [2018-12-03 07:34:26,960 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:26,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 20 treesize of output 28 [2018-12-03 07:34:26,968 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:27,049 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:27,166 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 07:34:27,195 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:27,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-12-03 07:34:27,203 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:27,238 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:27,323 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:27,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 68 [2018-12-03 07:34:27,775 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2018-12-03 07:34:27,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 43 treesize of output 41 [2018-12-03 07:34:27,815 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:27,816 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:27,817 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 41 treesize of output 55 [2018-12-03 07:34:27,817 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:27,866 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:27,900 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 39 treesize of output 33 [2018-12-03 07:34:27,932 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:27,932 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:34:27,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-12-03 07:34:27,934 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:27,954 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-03 07:34:27,954 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:27,989 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:28,012 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:28,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-03 07:34:28,103 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 4 variables, input treesize:309, output treesize:132 [2018-12-03 07:34:28,681 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-12-03 07:34:30,134 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2018-12-03 07:34:30,451 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-12-03 07:34:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:34:30,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:34:30,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15, 19] total 37 [2018-12-03 07:34:30,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 07:34:30,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 07:34:30,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1241, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 07:34:30,740 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand 38 states. [2018-12-03 07:34:31,394 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-12-03 07:34:31,892 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-12-03 07:34:32,688 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2018-12-03 07:35:43,174 WARN L180 SmtUtils]: Spent 1.17 m on a formula simplification. DAG size of input: 108 DAG size of output: 101 [2018-12-03 07:35:44,888 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-12-03 07:35:46,278 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2018-12-03 07:35:46,948 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2018-12-03 07:35:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:35:48,894 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2018-12-03 07:35:48,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 07:35:48,895 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 36 [2018-12-03 07:35:48,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:35:48,896 INFO L225 Difference]: With dead ends: 120 [2018-12-03 07:35:48,897 INFO L226 Difference]: Without dead ends: 120 [2018-12-03 07:35:48,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 97 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 80.2s TimeCoverageRelationStatistics Valid=528, Invalid=2552, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 07:35:48,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-03 07:35:48,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2018-12-03 07:35:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 07:35:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2018-12-03 07:35:48,904 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 36 [2018-12-03 07:35:48,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:35:48,904 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2018-12-03 07:35:48,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 07:35:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2018-12-03 07:35:48,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 07:35:48,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:35:48,905 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-12-03 07:35:48,905 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:35:48,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:35:48,905 INFO L82 PathProgramCache]: Analyzing trace with hash -959110344, now seen corresponding path program 2 times [2018-12-03 07:35:48,906 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:35:48,906 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:35:48,927 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-03 07:35:49,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:35:49,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:35:49,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:35:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 07:35:49,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:35:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 07:35:49,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:35:49,123 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:35:49,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-03 07:35:49,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:35:49,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:35:49,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:35:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 07:35:49,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:35:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 07:35:49,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:35:49,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 9] total 19 [2018-12-03 07:35:49,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 07:35:49,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 07:35:49,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-12-03 07:35:49,451 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand 19 states. [2018-12-03 07:35:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:35:50,378 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2018-12-03 07:35:50,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 07:35:50,378 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2018-12-03 07:35:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:35:50,379 INFO L225 Difference]: With dead ends: 130 [2018-12-03 07:35:50,379 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 07:35:50,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=933, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 07:35:50,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 07:35:50,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 119. [2018-12-03 07:35:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-03 07:35:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 142 transitions. [2018-12-03 07:35:50,381 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 142 transitions. Word has length 39 [2018-12-03 07:35:50,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:35:50,381 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 142 transitions. [2018-12-03 07:35:50,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 07:35:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 142 transitions. [2018-12-03 07:35:50,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 07:35:50,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:35:50,382 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:35:50,382 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:35:50,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:35:50,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1818957814, now seen corresponding path program 1 times [2018-12-03 07:35:50,383 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:35:50,383 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:35:50,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:35:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:35:50,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:35:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 07:35:50,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:35:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 07:35:50,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:35:50,529 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:35:50,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:35:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:35:50,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:35:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 07:35:50,668 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:35:50,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 07:35:50,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 5] total 16 [2018-12-03 07:35:50,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 07:35:50,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 07:35:50,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-12-03 07:35:50,684 INFO L87 Difference]: Start difference. First operand 119 states and 142 transitions. Second operand 16 states. [2018-12-03 07:35:51,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:35:51,614 INFO L93 Difference]: Finished difference Result 130 states and 152 transitions. [2018-12-03 07:35:51,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 07:35:51,614 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-12-03 07:35:51,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:35:51,615 INFO L225 Difference]: With dead ends: 130 [2018-12-03 07:35:51,615 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 07:35:51,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2018-12-03 07:35:51,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 07:35:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 120. [2018-12-03 07:35:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 07:35:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 144 transitions. [2018-12-03 07:35:51,620 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 144 transitions. Word has length 46 [2018-12-03 07:35:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:35:51,620 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 144 transitions. [2018-12-03 07:35:51,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 07:35:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 144 transitions. [2018-12-03 07:35:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 07:35:51,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:35:51,621 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2018-12-03 07:35:51,621 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:35:51,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:35:51,621 INFO L82 PathProgramCache]: Analyzing trace with hash -546426460, now seen corresponding path program 1 times [2018-12-03 07:35:51,621 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:35:51,621 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:35:51,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:35:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:35:51,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:35:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 07:35:51,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:35:51,832 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 07:35:51,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:35:51,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:35:51,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:35:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:35:51,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:35:51,872 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 07:35:51,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:35:52,121 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 07:35:52,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:35:52,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 9] total 19 [2018-12-03 07:35:52,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 07:35:52,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 07:35:52,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-12-03 07:35:52,138 INFO L87 Difference]: Start difference. First operand 120 states and 144 transitions. Second operand 19 states. [2018-12-03 07:35:52,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:35:52,299 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-12-03 07:35:52,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 07:35:52,299 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-12-03 07:35:52,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:35:52,300 INFO L225 Difference]: With dead ends: 81 [2018-12-03 07:35:52,300 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 07:35:52,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-12-03 07:35:52,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 07:35:52,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2018-12-03 07:35:52,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 07:35:52,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-12-03 07:35:52,301 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 47 [2018-12-03 07:35:52,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:35:52,302 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-12-03 07:35:52,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 07:35:52,302 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-12-03 07:35:52,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 07:35:52,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:35:52,302 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2018-12-03 07:35:52,302 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:35:52,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:35:52,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1884227615, now seen corresponding path program 1 times [2018-12-03 07:35:52,303 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:35:52,303 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:35:52,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:35:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:35:52,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:35:52,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:35:52,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:35:52,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:35:52,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 07:35:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-03 07:35:52,563 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:35:52,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:35:52,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 07:35:52,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 07:35:52,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 07:35:52,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:35:52,566 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 10 states. [2018-12-03 07:35:53,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:35:53,068 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-12-03 07:35:53,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 07:35:53,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-12-03 07:35:53,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:35:53,069 INFO L225 Difference]: With dead ends: 72 [2018-12-03 07:35:53,069 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 07:35:53,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-03 07:35:53,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 07:35:53,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-12-03 07:35:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 07:35:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2018-12-03 07:35:53,072 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 54 [2018-12-03 07:35:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:35:53,072 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2018-12-03 07:35:53,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 07:35:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-12-03 07:35:53,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 07:35:53,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:35:53,073 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2018-12-03 07:35:53,073 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:35:53,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:35:53,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2095869278, now seen corresponding path program 1 times [2018-12-03 07:35:53,073 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:35:53,073 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:35:53,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:35:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:35:53,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:35:53,175 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-03 07:35:53,175 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:35:53,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:35:53,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 07:35:53,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:35:53,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:35:53,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:35:53,177 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 9 states. [2018-12-03 07:35:53,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:35:53,448 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-12-03 07:35:53,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:35:53,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-12-03 07:35:53,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:35:53,450 INFO L225 Difference]: With dead ends: 72 [2018-12-03 07:35:53,450 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 07:35:53,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-03 07:35:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 07:35:53,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-12-03 07:35:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 07:35:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-12-03 07:35:53,451 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 57 [2018-12-03 07:35:53,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:35:53,451 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-12-03 07:35:53,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:35:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-12-03 07:35:53,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 07:35:53,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:35:53,452 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-03 07:35:53,452 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:35:53,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:35:53,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1189511465, now seen corresponding path program 1 times [2018-12-03 07:35:53,452 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:35:53,452 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:35:53,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:35:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:35:53,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:35:53,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:35:53,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:35:53,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:35:53,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 07:35:53,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:35:53,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:35:53,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 07:35:53,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:35:53,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:35:53,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-03 07:35:53,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:35:53,732 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 10 treesize of output 9 [2018-12-03 07:35:53,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:35:53,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:35:53,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:35:53,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-12-03 07:35:53,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:35:53,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:35:53,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:35:53,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:35:53,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:35:53,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:35:53,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-12-03 07:35:53,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-12-03 07:35:53,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-12-03 07:35:53,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:35:53,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:35:53,845 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 07:35:53,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:51 [2018-12-03 07:35:54,080 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 40 treesize of output 33 [2018-12-03 07:35:54,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-03 07:35:54,085 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 07:35:54,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-03 07:35:54,096 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:35:54,100 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 07:35:54,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:35:54,107 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:11 [2018-12-03 07:36:10,458 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-03 07:36:10,465 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:36:10,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 82 [2018-12-03 07:36:10,511 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 30 treesize of output 41 [2018-12-03 07:36:10,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 07:36:10,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:36:10,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 07:36:10,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:81, output treesize:88 [2018-12-03 07:36:12,687 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 21 [2018-12-03 07:36:12,689 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 21 treesize of output 12 [2018-12-03 07:36:12,689 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 07:36:12,693 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 07:36:12,699 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 07:36:12,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:11 [2018-12-03 07:36:14,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-12-03 07:36:14,833 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:36:14,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:36:14,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:36:14,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 44 [2018-12-03 07:36:14,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:36:14,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:36:14,866 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 07:36:14,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:39 [2018-12-03 07:36:21,109 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 34 treesize of output 26 [2018-12-03 07:36:21,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 07:36:21,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:36:21,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:36:21,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:36:21,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:12 [2018-12-03 07:36:25,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:36:25,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-03 07:36:25,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:36:25,251 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 07:36:25,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-03 07:36:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 07:36:27,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:36:39,866 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 07:36:39,868 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 07:36:39,887 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:36:39,889 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:36:39,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 07:36:39,896 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:30 [2018-12-03 07:36:42,104 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 07:36:42,124 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 07:36:42,180 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:36:42,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:36:42,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 07:36:42,236 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:102, output treesize:88 [2018-12-03 07:36:42,563 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 07:36:42,568 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 07:36:42,592 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:36:42,596 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:36:42,608 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 2 xjuncts. [2018-12-03 07:36:42,609 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:64 [2018-12-03 07:36:44,780 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 07:36:44,795 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 07:36:44,851 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:36:44,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:36:44,906 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 2 xjuncts. [2018-12-03 07:36:44,906 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:102, output treesize:88 [2018-12-03 07:36:47,013 WARN L180 SmtUtils]: Spent 1.99 s on a formula simplification that was a NOOP. DAG size: 40 [2018-12-03 07:36:48,325 WARN L180 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 39 [2018-12-03 07:36:50,191 WARN L180 SmtUtils]: Spent 1.71 s on a formula simplification that was a NOOP. DAG size: 44 [2018-12-03 07:36:52,784 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-12-03 07:36:52,886 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-03 07:36:59,440 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 30 treesize of output 25 [2018-12-03 07:36:59,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:36:59,469 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 27 treesize of output 20 [2018-12-03 07:36:59,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:36:59,492 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 07:36:59,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:40 [2018-12-03 07:36:59,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 40 treesize of output 32 [2018-12-03 07:36:59,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10 [2018-12-03 07:36:59,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:36:59,951 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 21 treesize of output 17 [2018-12-03 07:36:59,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-12-03 07:36:59,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:36:59,955 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:36:59,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:36:59,965 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 07:36:59,965 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:80, output treesize:4 [2018-12-03 07:37:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 07:37:00,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:37:00,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:37:00,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:37:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:37:00,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:37:00,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:37:00,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:37:00,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:37:00,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 07:37:06,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:37:06,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:37:06,341 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 07:37:06,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:37:06,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:37:06,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-03 07:37:06,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:37:06,355 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 10 treesize of output 9 [2018-12-03 07:37:06,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:37:06,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:37:06,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:37:06,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:17 [2018-12-03 07:37:06,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:37:06,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:37:06,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:37:06,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:37:06,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:37:06,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:37:06,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:26 [2018-12-03 07:37:06,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-12-03 07:37:06,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-12-03 07:37:06,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:37:06,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:37:06,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:37:06,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:49 [2018-12-03 07:37:06,574 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 40 treesize of output 33 [2018-12-03 07:37:06,576 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 07:37:06,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:37:06,584 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 21 treesize of output 12 [2018-12-03 07:37:06,585 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:37:06,589 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 07:37:06,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:37:06,595 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:11 [2018-12-03 07:37:06,634 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:37:06,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 74 [2018-12-03 07:37:06,676 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 32 treesize of output 21 [2018-12-03 07:37:06,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 07:37:06,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:37:06,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 07:37:06,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:81, output treesize:86 [2018-12-03 07:37:08,835 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 21 [2018-12-03 07:37:08,839 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 21 treesize of output 12 [2018-12-03 07:37:08,839 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 07:37:08,843 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 07:37:08,849 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 07:37:08,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:11 [2018-12-03 07:37:08,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-12-03 07:37:08,895 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:37:08,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:37:08,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:37:08,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 44 [2018-12-03 07:37:08,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:37:08,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:37:08,927 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 07:37:08,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:39 [2018-12-03 07:37:13,071 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 34 treesize of output 26 [2018-12-03 07:37:13,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, 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 07:37:13,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:37:13,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:37:13,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:37:13,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:12 [2018-12-03 07:37:13,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:37:13,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-03 07:37:13,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:37:13,092 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 07:37:13,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-03 07:37:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 07:37:15,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:37:19,355 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 07:37:19,357 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 07:37:19,378 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:37:19,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:37:19,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 07:37:19,389 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:30 [2018-12-03 07:37:21,500 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 07:37:21,515 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 07:37:21,567 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:37:21,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:37:21,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 07:37:21,627 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:102, output treesize:86 [2018-12-03 07:37:21,950 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 07:37:21,954 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 07:37:21,980 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:37:21,985 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:37:21,999 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 2 xjuncts. [2018-12-03 07:37:21,999 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:62 [2018-12-03 07:37:24,165 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 07:37:24,179 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 07:37:24,229 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:37:24,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:37:24,283 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 2 xjuncts. [2018-12-03 07:37:24,283 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:102, output treesize:86 [2018-12-03 07:37:25,111 WARN L180 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2018-12-03 07:37:25,301 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-03 07:37:25,392 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 30 treesize of output 25 [2018-12-03 07:37:25,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:37:25,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 27 treesize of output 20 [2018-12-03 07:37:25,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:37:25,440 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 07:37:25,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:40 [2018-12-03 07:37:26,656 WARN L180 SmtUtils]: Spent 902.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-03 07:37:26,716 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-03 07:37:26,716 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 4 variables, input treesize:126, output treesize:17 [2018-12-03 07:37:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 07:37:27,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:37:27,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 24, 25] total 45 [2018-12-03 07:37:27,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 07:37:27,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 07:37:27,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1891, Unknown=18, NotChecked=0, Total=2070 [2018-12-03 07:37:27,282 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 46 states. [2018-12-03 07:37:45,889 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-12-03 07:37:59,953 WARN L180 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-12-03 07:38:14,672 WARN L180 SmtUtils]: Spent 8.28 s on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2018-12-03 07:38:18,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:38:18,485 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-12-03 07:38:18,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 07:38:18,485 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 59 [2018-12-03 07:38:18,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:38:18,486 INFO L225 Difference]: With dead ends: 86 [2018-12-03 07:38:18,486 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 07:38:18,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 156 SyntacticMatches, 34 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 131.2s TimeCoverageRelationStatistics Valid=466, Invalid=3937, Unknown=19, NotChecked=0, Total=4422 [2018-12-03 07:38:18,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 07:38:18,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2018-12-03 07:38:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 07:38:18,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-12-03 07:38:18,489 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 59 [2018-12-03 07:38:18,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:38:18,489 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-12-03 07:38:18,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 07:38:18,489 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-12-03 07:38:18,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 07:38:18,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:38:18,490 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-03 07:38:18,490 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:38:18,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:38:18,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1189511466, now seen corresponding path program 1 times [2018-12-03 07:38:18,491 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:38:18,491 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:38:18,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:38:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:38:18,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:38:18,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:38:18,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:18,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:38:18,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:18,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:18,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-03 07:38:18,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:18,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-03 07:38:18,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:18,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:18,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:18,837 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 07:38:18,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:18,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:18,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2018-12-03 07:38:18,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:38:18,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:38:18,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:18,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:18,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:38:18,896 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 10 treesize of output 9 [2018-12-03 07:38:18,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:18,899 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:18,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:18,915 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-12-03 07:38:18,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:38:18,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:18,953 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:38:18,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 36 [2018-12-03 07:38:18,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:18,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:19,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:38:19,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:19,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:38:19,007 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:19,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:19,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:19,035 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2018-12-03 07:38:19,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-12-03 07:38:19,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:38:19,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:19,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:19,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-12-03 07:38:19,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:38:19,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:19,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:19,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:19,175 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:105, output treesize:85 [2018-12-03 07:38:19,442 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 47 treesize of output 38 [2018-12-03 07:38:19,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-12-03 07:38:19,446 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 07:38:19,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 07:38:19,458 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:19,465 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 07:38:19,486 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 22 treesize of output 20 [2018-12-03 07:38:19,487 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:19,497 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 1 xjuncts. [2018-12-03 07:38:19,497 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:21 [2018-12-03 07:38:19,914 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:38:19,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 138 [2018-12-03 07:38:19,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:19,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2018-12-03 07:38:19,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:19,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:20,050 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:38:20,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 77 [2018-12-03 07:38:20,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:20,085 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 42 treesize of output 24 [2018-12-03 07:38:20,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:20,099 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:20,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:20,136 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:173, output treesize:87 [2018-12-03 07:38:20,207 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 47 treesize of output 38 [2018-12-03 07:38:20,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-12-03 07:38:20,211 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 07:38:20,221 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 07:38:20,221 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:20,227 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 07:38:20,244 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 22 treesize of output 20 [2018-12-03 07:38:20,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:20,254 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 1 xjuncts. [2018-12-03 07:38:20,254 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:21 [2018-12-03 07:38:20,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2018-12-03 07:38:20,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:20,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:20,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-03 07:38:20,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:20,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:20,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-12-03 07:38:20,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:20,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:20,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 57 [2018-12-03 07:38:20,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:20,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:20,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:20,655 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:115, output treesize:85 [2018-12-03 07:38:20,888 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 33 treesize of output 29 [2018-12-03 07:38:20,891 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 07:38:20,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:20,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:20,912 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 43 treesize of output 29 [2018-12-03 07:38:20,915 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 07:38:20,915 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:20,925 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 10 [2018-12-03 07:38:20,925 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:20,929 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:20,936 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 07:38:20,936 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:80, output treesize:18 [2018-12-03 07:38:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:38:21,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:38:22,234 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 07:38:22,250 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 07:38:22,382 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:22,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:22,499 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:22,519 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:22,608 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:22,620 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:22,693 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:22,697 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:22,733 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:22,736 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:22,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-03 07:38:22,760 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:149, output treesize:65 [2018-12-03 07:38:23,240 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 07:38:23,289 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 07:38:23,702 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:23,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:24,062 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:24,100 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:24,494 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 07:38:24,540 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:24,817 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:24,854 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:25,098 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:25,129 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:25,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-03 07:38:25,304 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:305, output treesize:249 [2018-12-03 07:38:25,866 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-12-03 07:38:26,354 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 07:38:26,377 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 07:38:26,538 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:26,562 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:26,715 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:26,735 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:26,908 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 07:38:26,914 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:27,026 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:27,032 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:27,105 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:27,112 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:27,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-03 07:38:27,169 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:329, output treesize:180 [2018-12-03 07:38:27,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:38:27,689 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:38:27,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:38:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:38:27,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:38:27,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:38:27,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:27,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:38:27,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:27,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:27,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-03 07:38:27,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:27,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:27,765 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 07:38:27,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:27,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-03 07:38:27,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:27,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:27,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2018-12-03 07:38:27,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:38:27,803 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 10 treesize of output 9 [2018-12-03 07:38:27,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:27,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:27,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:38:27,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:38:27,835 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:27,838 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:27,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:27,854 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:41 [2018-12-03 07:38:27,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:38:27,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:27,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:38:27,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:27,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:27,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:38:27,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:27,910 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:38:27,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 36 [2018-12-03 07:38:27,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:27,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:27,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:27,937 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:59 [2018-12-03 07:38:27,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2018-12-03 07:38:27,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:38:27,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:27,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:28,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-12-03 07:38:28,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-03 07:38:28,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:28,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:28,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:28,043 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:114, output treesize:83 [2018-12-03 07:38:28,111 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 26 treesize of output 24 [2018-12-03 07:38:28,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:28,130 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 36 treesize of output 29 [2018-12-03 07:38:28,132 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 07:38:28,132 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:28,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-03 07:38:28,141 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:28,145 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:28,153 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 1 xjuncts. [2018-12-03 07:38:28,153 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:21 [2018-12-03 07:38:28,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:28,461 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:38:28,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 137 treesize of output 148 [2018-12-03 07:38:28,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:28,513 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 42 treesize of output 24 [2018-12-03 07:38:28,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:28,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:28,611 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:38:28,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 77 [2018-12-03 07:38:28,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:28,642 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 42 treesize of output 24 [2018-12-03 07:38:28,642 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:28,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:28,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:28,688 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:182, output treesize:89 [2018-12-03 07:38:28,748 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 47 treesize of output 38 [2018-12-03 07:38:28,751 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 07:38:28,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:28,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-12-03 07:38:28,762 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:28,768 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 07:38:28,784 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 22 treesize of output 20 [2018-12-03 07:38:28,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:28,796 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 1 xjuncts. [2018-12-03 07:38:28,796 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:21 [2018-12-03 07:38:28,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2018-12-03 07:38:28,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:28,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:28,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 55 [2018-12-03 07:38:28,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:28,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:28,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2018-12-03 07:38:28,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:28,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:29,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-03 07:38:29,000 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:29,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:29,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:29,048 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:113, output treesize:83 [2018-12-03 07:38:29,112 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 33 treesize of output 29 [2018-12-03 07:38:29,115 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 07:38:29,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:29,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:29,140 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 43 treesize of output 29 [2018-12-03 07:38:29,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 07:38:29,143 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:29,154 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 10 [2018-12-03 07:38:29,154 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:29,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:29,164 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 07:38:29,164 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:80, output treesize:18 [2018-12-03 07:38:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:38:29,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:38:29,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:29,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:29,548 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:29,562 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:29,718 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:29,733 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:29,824 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 07:38:29,827 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:29,887 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:29,891 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:29,928 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:29,932 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:29,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-03 07:38:29,950 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:149, output treesize:65 [2018-12-03 07:38:30,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:30,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:30,508 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:30,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:30,823 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:30,887 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:31,207 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:31,239 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:31,537 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:31,593 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:31,815 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:31,861 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:32,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-03 07:38:32,042 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:305, output treesize:249 [2018-12-03 07:38:33,075 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 07:38:33,111 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 07:38:33,537 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:33,558 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:33,827 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:33,855 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:34,082 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 07:38:34,097 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:34,301 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:34,332 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:34,478 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:34,500 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:34,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-03 07:38:34,601 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:359, output treesize:213 [2018-12-03 07:38:35,047 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-03 07:38:35,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 07:38:35,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-12-03 07:38:35,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 07:38:35,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 07:38:35,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 07:38:35,064 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 24 states. [2018-12-03 07:38:37,551 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-12-03 07:38:40,019 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-12-03 07:38:40,324 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-12-03 07:38:40,610 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-12-03 07:38:41,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:38:41,393 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-12-03 07:38:41,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 07:38:41,393 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-12-03 07:38:41,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:38:41,394 INFO L225 Difference]: With dead ends: 81 [2018-12-03 07:38:41,394 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 07:38:41,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 109 SyntacticMatches, 19 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=294, Invalid=2462, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 07:38:41,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 07:38:41,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-12-03 07:38:41,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 07:38:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-12-03 07:38:41,397 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 59 [2018-12-03 07:38:41,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:38:41,397 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-12-03 07:38:41,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 07:38:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-12-03 07:38:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 07:38:41,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:38:41,398 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:38:41,398 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:38:41,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:38:41,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1040493453, now seen corresponding path program 1 times [2018-12-03 07:38:41,399 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:38:41,399 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:38:41,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:38:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:38:41,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:38:41,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 07:38:41,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:41,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:41,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-12-03 07:38:41,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:41,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:41,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 07:38:41,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:41,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:41,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:12 [2018-12-03 07:38:41,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:38:41,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 07:38:41,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:41,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:41,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:41,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-03 07:38:41,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:38:41,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:41,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:41,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-03 07:38:41,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:41,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:41,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:41,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-12-03 07:38:41,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-12-03 07:38:41,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 16 treesize of output 15 [2018-12-03 07:38:41,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:41,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:41,810 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 07:38:41,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:48 [2018-12-03 07:38:44,279 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) (bvadd |c_dll_update_at_#in~head.offset| (_ bv4 32))))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| .cse0) dll_update_at_~head.offset)))))) is different from true [2018-12-03 07:38:44,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 64 [2018-12-03 07:38:44,361 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 32 treesize of output 21 [2018-12-03 07:38:44,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 07:38:44,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:38:44,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:38:44,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-12-03 07:38:44,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-12-03 07:38:44,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:44,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:44,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 50 [2018-12-03 07:38:44,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:44,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:44,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:44,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:33 [2018-12-03 07:38:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2018-12-03 07:38:45,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:38:45,627 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 07:38:45,630 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 07:38:45,632 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 07:38:45,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:13 [2018-12-03 07:38:45,781 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 07:38:45,785 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 07:38:45,796 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 07:38:45,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:28 [2018-12-03 07:38:46,072 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 07:38:46,076 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 07:38:46,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:46,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:30 [2018-12-03 07:38:46,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:38:46,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:38:46,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:38:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:38:46,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:38:46,258 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 07:38:46,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:46,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:46,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-12-03 07:38:46,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:46,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:46,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 07:38:46,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:46,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:46,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:12 [2018-12-03 07:38:46,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:38:46,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 07:38:46,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:46,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:46,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:46,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:21 [2018-12-03 07:38:46,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:38:46,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:46,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:46,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-03 07:38:46,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:46,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:46,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:46,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:30 [2018-12-03 07:38:46,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-12-03 07:38:46,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-12-03 07:38:46,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:46,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:46,556 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 07:38:46,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:48 [2018-12-03 07:38:46,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 64 [2018-12-03 07:38:46,704 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 32 treesize of output 21 [2018-12-03 07:38:46,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 07:38:46,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:38:46,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:38:46,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-12-03 07:38:46,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-12-03 07:38:46,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:46,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:46,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 50 [2018-12-03 07:38:46,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:46,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:46,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:46,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:33 [2018-12-03 07:38:46,862 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2018-12-03 07:38:46,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:38:46,984 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 07:38:46,986 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 07:38:46,989 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 07:38:46,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:13 [2018-12-03 07:38:47,052 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 07:38:47,056 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 07:38:47,068 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 07:38:47,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:28 [2018-12-03 07:38:47,332 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 07:38:47,336 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 07:38:47,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:47,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:30 [2018-12-03 07:38:47,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 07:38:47,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 26 [2018-12-03 07:38:47,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 07:38:47,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 07:38:47,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1009, Unknown=1, NotChecked=64, Total=1190 [2018-12-03 07:38:47,480 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 26 states. [2018-12-03 07:38:49,037 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-12-03 07:38:51,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:38:51,254 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-12-03 07:38:51,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 07:38:51,254 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-12-03 07:38:51,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:38:51,254 INFO L225 Difference]: With dead ends: 81 [2018-12-03 07:38:51,254 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 07:38:51,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 127 SyntacticMatches, 12 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=331, Invalid=2642, Unknown=1, NotChecked=106, Total=3080 [2018-12-03 07:38:51,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 07:38:51,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2018-12-03 07:38:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 07:38:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-12-03 07:38:51,256 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 62 [2018-12-03 07:38:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:38:51,257 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-12-03 07:38:51,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 07:38:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-12-03 07:38:51,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 07:38:51,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:38:51,257 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-03 07:38:51,257 INFO L423 AbstractCegarLoop]: === Iteration 21 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:38:51,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:38:51,257 INFO L82 PathProgramCache]: Analyzing trace with hash -2082998530, now seen corresponding path program 2 times [2018-12-03 07:38:51,258 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:38:51,258 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:38:51,271 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-03 07:38:51,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:38:51,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:38:51,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:38:51,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 6 treesize of output 5 [2018-12-03 07:38:51,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-03 07:38:51,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 07:38:51,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:38:51,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 07:38:51,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:38:51,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,599 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,611 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-12-03 07:38:51,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:38:51,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:51,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:38:51,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:38:51,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:51,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:38:51,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,680 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,692 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-12-03 07:38:51,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:51,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:51,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 07:38:51,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:47 [2018-12-03 07:38:51,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-12-03 07:38:51,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 12 treesize of output 1 [2018-12-03 07:38:51,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-12-03 07:38:51,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1 [2018-12-03 07:38:51,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,854 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,869 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:47 [2018-12-03 07:38:51,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-03 07:38:51,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:38:51,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-03 07:38:51,946 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 10 treesize of output 9 [2018-12-03 07:38:51,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,954 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:51,978 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:73, output treesize:65 [2018-12-03 07:38:52,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 52 [2018-12-03 07:38:52,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:52,042 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:38:52,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 36 [2018-12-03 07:38:52,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:52,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:52,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 66 [2018-12-03 07:38:52,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:52,120 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 44 treesize of output 57 [2018-12-03 07:38:52,120 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:52,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:52,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:52,166 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:95 [2018-12-03 07:38:52,246 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:38:52,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-12-03 07:38:52,249 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 30 treesize of output 30 [2018-12-03 07:38:52,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:52,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:52,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:52,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 82 [2018-12-03 07:38:52,313 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 34 treesize of output 41 [2018-12-03 07:38:52,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:52,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:52,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:52,357 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:139, output treesize:97 [2018-12-03 07:38:53,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:53,091 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:38:53,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 127 [2018-12-03 07:38:53,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:53,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:53,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2018-12-03 07:38:53,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:53,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:53,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:53,245 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:38:53,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:53,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:53,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 141 [2018-12-03 07:38:53,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:53,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:53,340 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 92 [2018-12-03 07:38:53,341 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 07:38:53,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:53,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:53,403 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:171, output treesize:91 [2018-12-03 07:38:53,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:53,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:53,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:53,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 80 [2018-12-03 07:38:53,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:53,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:53,721 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 103 [2018-12-03 07:38:53,722 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:38:53,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:53,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:53,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2018-12-03 07:38:53,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:53,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:53,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-03 07:38:53,893 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:53,908 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:53,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:53,930 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:81 [2018-12-03 07:38:54,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:54,487 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 50 treesize of output 36 [2018-12-03 07:38:54,507 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 07:38:54,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 07:38:54,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:38:54,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:54,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:54,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 38 [2018-12-03 07:38:54,584 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 27 [2018-12-03 07:38:54,585 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:54,610 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 07:38:54,611 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-03 07:38:54,625 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:38:54,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:38:54,642 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:104, output treesize:37 [2018-12-03 07:38:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:38:54,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:38:55,843 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 07:38:55,859 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 07:38:55,936 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:55,949 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:55,990 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:55,994 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:56,016 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 07:38:56,020 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:56,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 07:38:56,032 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:93, output treesize:49 [2018-12-03 07:38:56,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:38:56,261 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/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 07:38:56,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-03 07:38:56,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:38:56,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:38:56,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:38:56,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:38:56,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-03 07:38:56,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 07:38:56,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 07:38:56,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 07:38:56,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:38:56,355 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,356 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,364 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:27 [2018-12-03 07:38:56,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:38:56,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:56,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:38:56,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:38:56,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:56,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:38:56,410 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,415 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,426 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:45 [2018-12-03 07:38:56,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:56,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:56,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 07:38:56,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:47 [2018-12-03 07:38:56,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-12-03 07:38:56,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1 [2018-12-03 07:38:56,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-12-03 07:38:56,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1 [2018-12-03 07:38:56,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,542 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:47 [2018-12-03 07:38:56,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-03 07:38:56,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 07:38:56,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2018-12-03 07:38:56,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 07:38:56,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,625 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,651 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:77 [2018-12-03 07:38:56,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 52 [2018-12-03 07:38:56,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:56,700 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:38:56,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 36 [2018-12-03 07:38:56,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 66 [2018-12-03 07:38:56,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:56,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 57 [2018-12-03 07:38:56,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,799 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,832 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:96, output treesize:95 [2018-12-03 07:38:56,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:56,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 105 [2018-12-03 07:38:56,860 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 34 treesize of output 41 [2018-12-03 07:38:56,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:56,945 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:38:56,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-12-03 07:38:56,949 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 30 treesize of output 30 [2018-12-03 07:38:56,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:56,996 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:139, output treesize:97 [2018-12-03 07:38:57,006 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:38:57,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:57,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:57,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:57,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 182 [2018-12-03 07:38:57,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:57,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:57,118 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 92 [2018-12-03 07:38:57,119 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:38:57,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:57,236 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:38:57,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:57,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 82 [2018-12-03 07:38:57,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:57,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:57,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2018-12-03 07:38:57,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:57,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:57,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:57,317 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:171, output treesize:91 [2018-12-03 07:38:57,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:57,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:57,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:57,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 80 [2018-12-03 07:38:57,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:57,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:57,478 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 103 [2018-12-03 07:38:57,478 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:38:57,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:57,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:57,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2018-12-03 07:38:57,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:57,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:57,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-03 07:38:57,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:57,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:57,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:57,678 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:81 [2018-12-03 07:38:57,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:57,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 50 treesize of output 36 [2018-12-03 07:38:57,831 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 07:38:57,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 07:38:57,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:38:57,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:57,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:38:57,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 38 [2018-12-03 07:38:57,906 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 27 [2018-12-03 07:38:57,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:57,933 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 07:38:57,934 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-03 07:38:57,949 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:38:57,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:38:57,967 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:104, output treesize:37 [2018-12-03 07:38:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:38:57,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:38:58,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:38:58,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:38:58,195 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:58,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:58,248 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:58,252 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:58,276 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 07:38:58,280 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:38:58,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 07:38:58,291 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:93, output treesize:49 [2018-12-03 07:38:58,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 07:38:58,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-12-03 07:38:58,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 07:38:58,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 07:38:58,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1379, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 07:38:58,508 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 30 states. [2018-12-03 07:39:01,244 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-12-03 07:39:03,200 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-12-03 07:39:03,514 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-12-03 07:39:04,226 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-12-03 07:39:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:39:05,500 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-12-03 07:39:05,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 07:39:05,501 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2018-12-03 07:39:05,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:39:05,501 INFO L225 Difference]: With dead ends: 115 [2018-12-03 07:39:05,501 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 07:39:05,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 121 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=284, Invalid=3256, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 07:39:05,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 07:39:05,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2018-12-03 07:39:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 07:39:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2018-12-03 07:39:05,504 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 64 [2018-12-03 07:39:05,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:39:05,504 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2018-12-03 07:39:05,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 07:39:05,504 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2018-12-03 07:39:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 07:39:05,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:39:05,505 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-03 07:39:05,505 INFO L423 AbstractCegarLoop]: === Iteration 22 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:39:05,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:39:05,505 INFO L82 PathProgramCache]: Analyzing trace with hash -923102594, now seen corresponding path program 2 times [2018-12-03 07:39:05,505 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:39:05,505 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/cvc4 Starting monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:39:05,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-03 07:39:05,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:39:05,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:39:05,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:39:05,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:39:05,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:39:05,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:39:05,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 07:39:05,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:39:05,938 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 10 treesize of output 9 [2018-12-03 07:39:05,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:39:05,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:39:05,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:39:05,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-12-03 07:39:05,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:39:05,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:05,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:05,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-03 07:39:05,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:39:06,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:39:06,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:39:06,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-12-03 07:39:06,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:06,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 89 [2018-12-03 07:39:06,077 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 16 treesize of output 15 [2018-12-03 07:39:06,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:39:06,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:39:06,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 07:39:06,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:82 [2018-12-03 07:39:10,197 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-03 07:39:12,400 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-03 07:39:12,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:12,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 52 [2018-12-03 07:39:12,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2018-12-03 07:39:12,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:39:12,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:39:12,712 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 38 treesize of output 31 [2018-12-03 07:39:12,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:12,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-12-03 07:39:12,716 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:39:12,727 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 07:39:12,728 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 07:39:12,731 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:39:12,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:39:12,739 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:75, output treesize:23 [2018-12-03 07:39:19,148 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-03 07:39:19,155 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:39:19,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:19,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 105 [2018-12-03 07:39:19,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2018-12-03 07:39:19,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 07:39:19,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:39:19,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-03 07:39:19,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:131, output treesize:150 [2018-12-03 07:39:21,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:21,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-03 07:39:21,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:21,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-12-03 07:39:21,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:39:21,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:39:21,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-03 07:39:21,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:21,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-12-03 07:39:21,709 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:39:21,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:39:21,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:39:21,721 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:23 [2018-12-03 07:39:23,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2018-12-03 07:39:23,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:23,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:23,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:23,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 62 [2018-12-03 07:39:23,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:39:23,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:39:23,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:39:23,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:68 [2018-12-03 07:39:26,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:26,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-03 07:39:26,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:26,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:26,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-03 07:39:26,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:39:26,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:39:26,107 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 07:39:26,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:31 [2018-12-03 07:39:27,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 95 treesize of output 83 [2018-12-03 07:39:27,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 62 [2018-12-03 07:39:27,460 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 07:39:27,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2018-12-03 07:39:27,516 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:39:27,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:27,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 45 [2018-12-03 07:39:27,565 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:39:27,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 07:39:27,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-03 07:39:27,656 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:103, output treesize:75 [2018-12-03 07:39:29,662 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_200 (_ BitVec 32)) (main_~s~0.base (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| v_arrayElimCell_200 (_ bv1 1)))) (and (= |c_#valid| (store (store .cse0 main_~s~0.base (_ bv0 1)) v_arrayElimCell_200 (_ bv0 1))) (= (select (store .cse0 main_~s~0.base (_ bv1 1)) (_ bv0 32)) (_ bv0 1)) (= (_ bv0 1) (select .cse0 main_~s~0.base)) (= (select |c_old(#valid)| v_arrayElimCell_200) (_ bv0 1))))) (exists ((v_arrayElimCell_202 (_ BitVec 32)) (v_prenex_69 (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| v_arrayElimCell_202 (_ bv1 1)))) (and (= (select |c_old(#valid)| v_arrayElimCell_202) (_ bv0 1)) (= (select .cse1 v_prenex_69) (_ bv0 1)) (= |c_#valid| (store (store .cse1 v_prenex_69 (_ bv0 1)) v_arrayElimCell_202 (_ bv0 1))) (= (_ bv0 1) (select (store .cse1 v_prenex_69 (_ bv1 1)) (_ bv0 32))))))) is different from true [2018-12-03 07:39:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 07:39:29,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:39:31,423 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 07:39:31,428 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 07:39:31,437 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 07:39:31,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:34 [2018-12-03 07:39:31,662 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 07:39:31,679 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 07:39:31,748 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:39:31,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:39:31,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 07:39:31,813 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-12-03 07:39:41,959 WARN L180 SmtUtils]: Spent 8.18 s on a formula simplification that was a NOOP. DAG size: 40 [2018-12-03 07:39:42,157 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 07:39:42,167 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 07:39:42,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:39:42,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:68 [2018-12-03 07:39:42,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:39:42,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:39:42,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-03 07:39:42,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:39:42,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:39:42,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:39:43,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 07:39:43,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 07:39:43,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:39:43,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:39:43,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:39:43,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:35 [2018-12-03 07:39:43,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 07:39:43,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:43,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:39:43,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:39:43,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:39:43,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:39:43,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:44 [2018-12-03 07:39:43,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:43,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 79 [2018-12-03 07:39:43,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-03 07:39:43,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:39:43,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:39:43,700 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 07:39:43,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:68 [2018-12-03 07:39:47,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:47,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-03 07:39:47,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:39:47,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-12-03 07:39:47,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:39:47,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:39:47,128 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 39 treesize of output 32 [2018-12-03 07:39:47,130 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 07:39:47,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:39:47,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-03 07:39:47,139 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 07:39:47,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:39:47,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:39:47,149 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:58, output treesize:19 [2018-12-03 07:40:26,246 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-03 07:40:26,254 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:40:26,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:40:26,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 97 [2018-12-03 07:40:26,353 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 32 treesize of output 21 [2018-12-03 07:40:26,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 07:40:26,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:40:26,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-03 07:40:26,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:106, output treesize:136 [2018-12-03 07:40:41,046 WARN L180 SmtUtils]: Spent 12.09 s on a formula simplification. DAG size of input: 55 DAG size of output: 23 [2018-12-03 07:40:41,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:40:41,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-03 07:40:41,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:40:41,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-12-03 07:40:41,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:40:41,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:40:41,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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 07:40:41,081 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 20 treesize of output 11 [2018-12-03 07:40:41,085 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:40:41,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:40:41,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:40:41,097 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2018-12-03 07:40:43,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2018-12-03 07:40:43,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:40:43,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:40:43,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 50 [2018-12-03 07:40:43,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:40:43,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:40:43,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:40:43,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:60 [2018-12-03 07:40:47,847 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 15 treesize of output 8 [2018-12-03 07:40:47,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:40:47,854 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 07:40:47,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2018-12-03 07:40:50,157 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2018-12-03 07:40:50,161 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 45 treesize of output 30 [2018-12-03 07:40:50,162 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 07:40:50,215 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2018-12-03 07:40:50,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:40:50,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-12-03 07:40:50,267 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:40:50,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 07:40:50,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-03 07:40:50,335 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:53 [2018-12-03 07:40:51,533 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_74 (_ BitVec 32)) (v_arrayElimCell_216 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| v_arrayElimCell_216 (_ bv1 1)))) (and (= |c_#valid| (store (store .cse0 v_prenex_74 (_ bv0 1)) v_arrayElimCell_216 (_ bv0 1))) (= (select .cse0 v_prenex_74) (_ bv0 1)) (= (select |c_old(#valid)| v_arrayElimCell_216) (_ bv0 1))))) (exists ((v_arrayElimCell_215 (_ BitVec 32)) (main_~s~0.base (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| v_arrayElimCell_215 (_ bv1 1)))) (and (= |c_#valid| (store (store .cse1 main_~s~0.base (_ bv0 1)) v_arrayElimCell_215 (_ bv0 1))) (= (select .cse1 main_~s~0.base) (_ bv0 1)) (= (select |c_old(#valid)| v_arrayElimCell_215) (_ bv0 1)))))) is different from true [2018-12-03 07:40:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 07:40:51,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:40:53,619 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 07:40:53,622 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 07:40:53,625 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 07:40:53,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2018-12-03 07:40:54,009 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 07:40:54,014 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 07:40:54,019 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 07:40:54,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:35 [2018-12-03 07:41:02,535 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 07:41:02,539 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 07:41:02,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:41:02,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:35 [2018-12-03 07:41:04,064 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_146 (_ BitVec 32)) (v_dll_update_at_~head.offset_113 (_ BitVec 32))) (= (store (store |c_#valid| c_main_~s~0.base (_ bv0 1)) (let ((.cse1 (bvadd c_main_~s~0.offset (_ bv4 32)))) (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_main_~s~0.base) .cse1))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) v_dll_update_at_~head.offset_113 v_DerPreprocessor_146))) c_main_~s~0.base) .cse1)) (_ bv0 1)) |c_old(#valid)|)) is different from false [2018-12-03 07:41:04,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 07:41:04,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27] total 57 [2018-12-03 07:41:04,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 07:41:04,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 07:41:04,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=5741, Unknown=33, NotChecked=468, Total=6642 [2018-12-03 07:41:04,084 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand 58 states. [2018-12-03 07:41:47,259 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-12-03 07:41:57,882 WARN L180 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2018-12-03 07:42:10,775 WARN L180 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2018-12-03 07:42:28,971 WARN L180 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 07:43:00,822 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-12-03 07:43:01,318 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2018-12-03 07:43:01,836 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2018-12-03 07:43:02,164 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2018-12-03 07:43:14,085 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 80 DAG size of output: 37 [2018-12-03 07:43:16,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:43:16,242 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2018-12-03 07:43:16,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 07:43:16,242 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 67 [2018-12-03 07:43:16,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:43:16,243 INFO L225 Difference]: With dead ends: 125 [2018-12-03 07:43:16,243 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 07:43:16,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 99 SyntacticMatches, 13 SemanticMatches, 104 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3997 ImplicationChecksByTransitivity, 176.4s TimeCoverageRelationStatistics Valid=786, Invalid=9683, Unknown=49, NotChecked=612, Total=11130 [2018-12-03 07:43:16,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 07:43:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 07:43:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 07:43:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-12-03 07:43:16,246 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 67 [2018-12-03 07:43:16,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:43:16,246 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-12-03 07:43:16,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 07:43:16,246 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-12-03 07:43:16,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 07:43:16,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:43:16,246 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-03 07:43:16,246 INFO L423 AbstractCegarLoop]: === Iteration 23 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:43:16,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:43:16,246 INFO L82 PathProgramCache]: Analyzing trace with hash -987935254, now seen corresponding path program 3 times [2018-12-03 07:43:16,247 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:43:16,247 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:43:16,263 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-03 07:43:16,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 07:43:16,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:43:16,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:43:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-03 07:43:16,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:43:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-03 07:43:17,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:43:17,272 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:43:17,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 07:43:31,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 07:43:31,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:43:31,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:43:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-03 07:43:31,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:43:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-03 07:43:31,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:43:31,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 15 [2018-12-03 07:43:31,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 07:43:31,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 07:43:31,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-12-03 07:43:31,160 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 15 states. [2018-12-03 07:43:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:43:31,645 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2018-12-03 07:43:31,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 07:43:31,646 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-12-03 07:43:31,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:43:31,646 INFO L225 Difference]: With dead ends: 100 [2018-12-03 07:43:31,646 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 07:43:31,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 271 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-12-03 07:43:31,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 07:43:31,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2018-12-03 07:43:31,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 07:43:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2018-12-03 07:43:31,648 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 72 [2018-12-03 07:43:31,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:43:31,648 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-12-03 07:43:31,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 07:43:31,648 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-12-03 07:43:31,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 07:43:31,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:43:31,648 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-12-03 07:43:31,648 INFO L423 AbstractCegarLoop]: === Iteration 24 === [dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 07:43:31,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:43:31,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1648166698, now seen corresponding path program 4 times [2018-12-03 07:43:31,649 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:43:31,649 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:43:31,662 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 07:43:31,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 07:43:31,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:43:31,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:43:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 07:43:31,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:43:32,072 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 07:43:32,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:43:32,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:43:32,082 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 07:43:32,128 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 07:43:32,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:43:32,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:43:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 07:43:32,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:43:32,176 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 07:43:32,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:43:32,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7] total 11 [2018-12-03 07:43:32,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 07:43:32,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 07:43:32,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-03 07:43:32,193 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 11 states. [2018-12-03 07:43:32,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:43:32,344 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 07:43:32,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:43:32,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2018-12-03 07:43:32,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:43:32,345 INFO L225 Difference]: With dead ends: 43 [2018-12-03 07:43:32,345 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 07:43:32,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-12-03 07:43:32,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 07:43:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 07:43:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 07:43:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 07:43:32,346 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2018-12-03 07:43:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:43:32,346 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 07:43:32,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 07:43:32,346 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 07:43:32,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 07:43:32,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 07:43:32 BoogieIcfgContainer [2018-12-03 07:43:32,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 07:43:32,349 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 07:43:32,349 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 07:43:32,350 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 07:43:32,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:33:59" (3/4) ... [2018-12-03 07:43:32,352 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 07:43:32,356 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_update_at [2018-12-03 07:43:32,356 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 07:43:32,356 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-03 07:43:32,356 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create [2018-12-03 07:43:32,357 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_get_data_at [2018-12-03 07:43:32,357 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 07:43:32,357 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_destroy [2018-12-03 07:43:32,360 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-12-03 07:43:32,360 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-03 07:43:32,360 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 07:43:32,386 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bc0f4ae3-c4d5-458b-a542-674f730038a5/bin-2019/utaipan/witness.graphml [2018-12-03 07:43:32,386 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 07:43:32,387 INFO L168 Benchmark]: Toolchain (without parser) took 573570.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.2 MB). Free memory was 938.0 MB in the beginning and 907.4 MB in the end (delta: 30.6 MB). Peak memory consumption was 228.8 MB. Max. memory is 11.5 GB. [2018-12-03 07:43:32,387 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:43:32,387 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -190.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2018-12-03 07:43:32,388 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.53 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:43:32,388 INFO L168 Benchmark]: Boogie Preprocessor took 24.84 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 07:43:32,388 INFO L168 Benchmark]: RCFGBuilder took 310.30 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: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2018-12-03 07:43:32,388 INFO L168 Benchmark]: TraceAbstraction took 572881.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 915.2 MB in the end (delta: 168.9 MB). Peak memory consumption was 230.3 MB. Max. memory is 11.5 GB. [2018-12-03 07:43:32,388 INFO L168 Benchmark]: Witness Printer took 36.94 ms. Allocated memory is still 1.2 GB. Free memory was 915.2 MB in the beginning and 907.4 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2018-12-03 07:43:32,389 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 290.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -190.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.53 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 310.30 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: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 572881.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 915.2 MB in the end (delta: 168.9 MB). Peak memory consumption was 230.3 MB. Max. memory is 11.5 GB. * Witness Printer took 36.94 ms. Allocated memory is still 1.2 GB. Free memory was 915.2 MB in the beginning and 907.4 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 601]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 601]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 84 locations, 21 error locations. SAFE Result, 572.8s OverallTime, 24 OverallIterations, 4 TraceHistogramMax, 288.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1160 SDtfs, 1565 SDslu, 6963 SDs, 0 SdLazy, 8941 SolverSat, 526 SolverUnsat, 36 SolverUnknown, 0 SolverNotchecked, 98.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3086 GetRequests, 2344 SyntacticMatches, 112 SemanticMatches, 630 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 9194 ImplicationChecksByTransitivity, 417.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 160 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 17.0s SatisfiabilityAnalysisTime, 265.9s InterpolantComputationTime, 1768 NumberOfCodeBlocks, 1768 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 2667 ConstructedInterpolants, 338 QuantifiedInterpolants, 2144281 SizeOfPredicates, 434 NumberOfNonLiveVariables, 6989 ConjunctsInSsa, 931 ConjunctsInUnsatCore, 62 InterpolantComputations, 10 PerfectInterpolantSequences, 633/1162 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...