./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-sorted_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-sorted_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/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 614aedb1ca0b3c75ba5d43ccd1ce8931602b4981 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-sorted_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/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 614aedb1ca0b3c75ba5d43ccd1ce8931602b4981 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_558 term size 40 --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:25:20,116 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:25:20,118 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:25:20,126 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:25:20,126 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:25:20,127 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:25:20,131 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:25:20,132 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:25:20,133 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:25:20,134 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:25:20,135 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:25:20,135 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:25:20,136 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:25:20,137 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:25:20,138 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:25:20,138 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:25:20,139 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:25:20,140 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:25:20,142 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:25:20,143 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:25:20,144 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:25:20,145 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:25:20,147 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:25:20,147 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:25:20,147 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:25:20,148 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:25:20,149 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:25:20,149 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:25:20,150 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:25:20,151 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:25:20,151 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:25:20,152 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:25:20,152 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:25:20,152 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:25:20,153 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:25:20,153 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:25:20,153 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-10 10:25:20,165 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:25:20,165 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:25:20,166 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:25:20,166 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 10:25:20,166 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 10:25:20,166 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 10:25:20,166 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 10:25:20,167 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 10:25:20,167 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 10:25:20,167 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 10:25:20,167 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 10:25:20,167 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:25:20,168 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:25:20,168 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:25:20,168 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:25:20,168 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:25:20,168 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:25:20,168 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:25:20,168 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:25:20,169 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 10:25:20,169 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 10:25:20,169 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 10:25:20,169 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:25:20,169 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:25:20,169 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:25:20,169 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:25:20,170 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:25:20,170 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:25:20,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:25:20,170 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:25:20,170 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:25:20,170 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 10:25:20,170 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:25:20,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:25:20,171 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_3fa7a5fe-0b96-47a2-9046-d36e986364c4/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 -> 614aedb1ca0b3c75ba5d43ccd1ce8931602b4981 [2018-11-10 10:25:20,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:25:20,205 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:25:20,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:25:20,208 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:25:20,209 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:25:20,209 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-11-10 10:25:20,258 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/data/7b24ed72a/8993f18a150a4d4cb2d08c5c8226f77e/FLAGc06ce21e9 [2018-11-10 10:25:20,635 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:25:20,636 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/sv-benchmarks/c/forester-heap/dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-11-10 10:25:20,646 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/data/7b24ed72a/8993f18a150a4d4cb2d08c5c8226f77e/FLAGc06ce21e9 [2018-11-10 10:25:20,655 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/data/7b24ed72a/8993f18a150a4d4cb2d08c5c8226f77e [2018-11-10 10:25:20,658 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:25:20,660 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:25:20,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:25:20,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:25:20,663 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:25:20,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:25:20" (1/1) ... [2018-11-10 10:25:20,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c01ba6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:20, skipping insertion in model container [2018-11-10 10:25:20,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:25:20" (1/1) ... [2018-11-10 10:25:20,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:25:20,704 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:25:20,915 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:25:20,923 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:25:20,962 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:25:20,987 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:25:20,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:20 WrapperNode [2018-11-10 10:25:20,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:25:20,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:25:20,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:25:20,988 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:25:21,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:20" (1/1) ... [2018-11-10 10:25:21,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:20" (1/1) ... [2018-11-10 10:25:21,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:25:21,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:25:21,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:25:21,074 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:25:21,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:20" (1/1) ... [2018-11-10 10:25:21,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:20" (1/1) ... [2018-11-10 10:25:21,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:20" (1/1) ... [2018-11-10 10:25:21,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:20" (1/1) ... [2018-11-10 10:25:21,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:20" (1/1) ... [2018-11-10 10:25:21,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:20" (1/1) ... [2018-11-10 10:25:21,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:20" (1/1) ... [2018-11-10 10:25:21,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:25:21,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:25:21,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:25:21,106 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:25:21,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/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-11-10 10:25:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:25:21,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:25:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:25:21,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:25:21,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:25:21,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:25:21,719 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:25:21,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:25:21 BoogieIcfgContainer [2018-11-10 10:25:21,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:25:21,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:25:21,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:25:21,722 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:25:21,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:25:20" (1/3) ... [2018-11-10 10:25:21,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a47b7db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:25:21, skipping insertion in model container [2018-11-10 10:25:21,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:20" (2/3) ... [2018-11-10 10:25:21,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a47b7db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:25:21, skipping insertion in model container [2018-11-10 10:25:21,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:25:21" (3/3) ... [2018-11-10 10:25:21,725 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-11-10 10:25:21,730 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:25:21,735 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations. [2018-11-10 10:25:21,743 INFO L257 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2018-11-10 10:25:21,759 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:25:21,759 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 10:25:21,759 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:25:21,759 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:25:21,760 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:25:21,760 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:25:21,760 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:25:21,760 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:25:21,772 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states. [2018-11-10 10:25:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-10 10:25:21,778 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:21,778 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:21,780 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:21,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:21,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1479502752, now seen corresponding path program 1 times [2018-11-10 10:25:21,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:21,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:21,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:21,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:21,826 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:21,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:21,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:25:21,900 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:21,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:25:21,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:25:21,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:25:21,916 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 3 states. [2018-11-10 10:25:22,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:22,155 INFO L93 Difference]: Finished difference Result 216 states and 228 transitions. [2018-11-10 10:25:22,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:25:22,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-10 10:25:22,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:22,166 INFO L225 Difference]: With dead ends: 216 [2018-11-10 10:25:22,166 INFO L226 Difference]: Without dead ends: 212 [2018-11-10 10:25:22,168 INFO L605 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-11-10 10:25:22,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-10 10:25:22,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 199. [2018-11-10 10:25:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-10 10:25:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 210 transitions. [2018-11-10 10:25:22,209 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 210 transitions. Word has length 7 [2018-11-10 10:25:22,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:22,209 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 210 transitions. [2018-11-10 10:25:22,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:25:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 210 transitions. [2018-11-10 10:25:22,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 10:25:22,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:22,210 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:22,212 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:22,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:22,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1380054905, now seen corresponding path program 1 times [2018-11-10 10:25:22,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:22,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:22,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:22,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:22,214 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:22,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:22,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:22,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:25:22,278 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:22,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:25:22,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:25:22,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:25:22,280 INFO L87 Difference]: Start difference. First operand 199 states and 210 transitions. Second operand 3 states. [2018-11-10 10:25:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:22,422 INFO L93 Difference]: Finished difference Result 198 states and 209 transitions. [2018-11-10 10:25:22,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:25:22,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-10 10:25:22,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:22,423 INFO L225 Difference]: With dead ends: 198 [2018-11-10 10:25:22,423 INFO L226 Difference]: Without dead ends: 198 [2018-11-10 10:25:22,424 INFO L605 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-11-10 10:25:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-10 10:25:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-11-10 10:25:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-10 10:25:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 209 transitions. [2018-11-10 10:25:22,431 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 209 transitions. Word has length 8 [2018-11-10 10:25:22,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:22,432 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 209 transitions. [2018-11-10 10:25:22,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:25:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 209 transitions. [2018-11-10 10:25:22,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 10:25:22,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:22,433 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:22,434 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:22,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:22,435 INFO L82 PathProgramCache]: Analyzing trace with hash 167970946, now seen corresponding path program 1 times [2018-11-10 10:25:22,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:22,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:22,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:22,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:22,437 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:22,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:22,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:25:22,489 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:22,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:25:22,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:25:22,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:25:22,490 INFO L87 Difference]: Start difference. First operand 198 states and 209 transitions. Second operand 5 states. [2018-11-10 10:25:22,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:22,763 INFO L93 Difference]: Finished difference Result 262 states and 278 transitions. [2018-11-10 10:25:22,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:25:22,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-10 10:25:22,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:22,765 INFO L225 Difference]: With dead ends: 262 [2018-11-10 10:25:22,765 INFO L226 Difference]: Without dead ends: 262 [2018-11-10 10:25:22,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:25:22,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-10 10:25:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 197. [2018-11-10 10:25:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-10 10:25:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 208 transitions. [2018-11-10 10:25:22,773 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 208 transitions. Word has length 9 [2018-11-10 10:25:22,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:22,774 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 208 transitions. [2018-11-10 10:25:22,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:25:22,774 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 208 transitions. [2018-11-10 10:25:22,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 10:25:22,775 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:22,775 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:22,777 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:22,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:22,777 INFO L82 PathProgramCache]: Analyzing trace with hash 912132073, now seen corresponding path program 1 times [2018-11-10 10:25:22,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:22,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:22,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:22,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:22,778 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:22,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:22,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:25:22,819 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:22,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:25:22,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:25:22,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:25:22,820 INFO L87 Difference]: Start difference. First operand 197 states and 208 transitions. Second operand 4 states. [2018-11-10 10:25:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:23,005 INFO L93 Difference]: Finished difference Result 253 states and 269 transitions. [2018-11-10 10:25:23,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:25:23,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-10 10:25:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:23,006 INFO L225 Difference]: With dead ends: 253 [2018-11-10 10:25:23,006 INFO L226 Difference]: Without dead ends: 253 [2018-11-10 10:25:23,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-10 10:25:23,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-11-10 10:25:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 196. [2018-11-10 10:25:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-10 10:25:23,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 207 transitions. [2018-11-10 10:25:23,013 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 207 transitions. Word has length 10 [2018-11-10 10:25:23,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:23,013 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 207 transitions. [2018-11-10 10:25:23,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:25:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 207 transitions. [2018-11-10 10:25:23,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 10:25:23,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:23,014 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:23,014 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:23,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:23,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1788676764, now seen corresponding path program 1 times [2018-11-10 10:25:23,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:23,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:23,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:23,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:23,016 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:23,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:23,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:25:23,054 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:23,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:25:23,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:25:23,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:25:23,056 INFO L87 Difference]: Start difference. First operand 196 states and 207 transitions. Second operand 6 states. [2018-11-10 10:25:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:23,221 INFO L93 Difference]: Finished difference Result 258 states and 274 transitions. [2018-11-10 10:25:23,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:25:23,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-10 10:25:23,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:23,223 INFO L225 Difference]: With dead ends: 258 [2018-11-10 10:25:23,223 INFO L226 Difference]: Without dead ends: 258 [2018-11-10 10:25:23,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:25:23,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-10 10:25:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 194. [2018-11-10 10:25:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-10 10:25:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 205 transitions. [2018-11-10 10:25:23,230 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 205 transitions. Word has length 11 [2018-11-10 10:25:23,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:23,230 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 205 transitions. [2018-11-10 10:25:23,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:25:23,230 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 205 transitions. [2018-11-10 10:25:23,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 10:25:23,230 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:23,230 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:23,231 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:23,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:23,232 INFO L82 PathProgramCache]: Analyzing trace with hash 385595211, now seen corresponding path program 1 times [2018-11-10 10:25:23,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:23,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:23,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:23,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:23,233 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:23,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:23,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:23,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:25:23,284 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:23,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:25:23,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:25:23,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:25:23,285 INFO L87 Difference]: Start difference. First operand 194 states and 205 transitions. Second operand 4 states. [2018-11-10 10:25:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:23,413 INFO L93 Difference]: Finished difference Result 267 states and 285 transitions. [2018-11-10 10:25:23,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:25:23,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-10 10:25:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:23,415 INFO L225 Difference]: With dead ends: 267 [2018-11-10 10:25:23,415 INFO L226 Difference]: Without dead ends: 267 [2018-11-10 10:25:23,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-10 10:25:23,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-10 10:25:23,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 192. [2018-11-10 10:25:23,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-10 10:25:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 203 transitions. [2018-11-10 10:25:23,419 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 203 transitions. Word has length 12 [2018-11-10 10:25:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:23,419 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 203 transitions. [2018-11-10 10:25:23,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:25:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 203 transitions. [2018-11-10 10:25:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 10:25:23,420 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:23,420 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:23,421 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:23,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:23,421 INFO L82 PathProgramCache]: Analyzing trace with hash 947984111, now seen corresponding path program 1 times [2018-11-10 10:25:23,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:23,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:23,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:23,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:23,423 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:23,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:23,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:25:23,498 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:23,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:25:23,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:25:23,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:25:23,499 INFO L87 Difference]: Start difference. First operand 192 states and 203 transitions. Second operand 8 states. [2018-11-10 10:25:23,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:23,963 INFO L93 Difference]: Finished difference Result 430 states and 460 transitions. [2018-11-10 10:25:23,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 10:25:23,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-11-10 10:25:23,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:23,965 INFO L225 Difference]: With dead ends: 430 [2018-11-10 10:25:23,965 INFO L226 Difference]: Without dead ends: 430 [2018-11-10 10:25:23,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2018-11-10 10:25:23,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-11-10 10:25:23,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 238. [2018-11-10 10:25:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-11-10 10:25:23,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 281 transitions. [2018-11-10 10:25:23,973 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 281 transitions. Word has length 16 [2018-11-10 10:25:23,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:23,973 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 281 transitions. [2018-11-10 10:25:23,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:25:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 281 transitions. [2018-11-10 10:25:23,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 10:25:23,974 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:23,974 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:23,976 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:23,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:23,976 INFO L82 PathProgramCache]: Analyzing trace with hash -677263569, now seen corresponding path program 1 times [2018-11-10 10:25:23,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:23,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:23,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:23,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:23,978 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:24,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:24,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:25:24,091 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:24,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:25:24,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:25:24,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:25:24,092 INFO L87 Difference]: Start difference. First operand 238 states and 281 transitions. Second operand 8 states. [2018-11-10 10:25:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:24,816 INFO L93 Difference]: Finished difference Result 548 states and 584 transitions. [2018-11-10 10:25:24,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 10:25:24,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-10 10:25:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:24,818 INFO L225 Difference]: With dead ends: 548 [2018-11-10 10:25:24,818 INFO L226 Difference]: Without dead ends: 548 [2018-11-10 10:25:24,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-11-10 10:25:24,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-11-10 10:25:24,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 241. [2018-11-10 10:25:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-10 10:25:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 283 transitions. [2018-11-10 10:25:24,824 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 283 transitions. Word has length 17 [2018-11-10 10:25:24,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:24,824 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 283 transitions. [2018-11-10 10:25:24,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:25:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 283 transitions. [2018-11-10 10:25:24,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 10:25:24,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:24,825 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:24,826 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:24,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:24,826 INFO L82 PathProgramCache]: Analyzing trace with hash 479665905, now seen corresponding path program 1 times [2018-11-10 10:25:24,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:24,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:24,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:24,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:24,827 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:24,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:24,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:25:24,874 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:24,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:25:24,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:25:24,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:25:24,875 INFO L87 Difference]: Start difference. First operand 241 states and 283 transitions. Second operand 5 states. [2018-11-10 10:25:25,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:25,065 INFO L93 Difference]: Finished difference Result 249 states and 290 transitions. [2018-11-10 10:25:25,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:25:25,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-10 10:25:25,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:25,067 INFO L225 Difference]: With dead ends: 249 [2018-11-10 10:25:25,067 INFO L226 Difference]: Without dead ends: 249 [2018-11-10 10:25:25,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:25:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-10 10:25:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 239. [2018-11-10 10:25:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-11-10 10:25:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 281 transitions. [2018-11-10 10:25:25,073 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 281 transitions. Word has length 18 [2018-11-10 10:25:25,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:25,073 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 281 transitions. [2018-11-10 10:25:25,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:25:25,073 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 281 transitions. [2018-11-10 10:25:25,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 10:25:25,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:25,074 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:25,075 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:25,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:25,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1984741233, now seen corresponding path program 1 times [2018-11-10 10:25:25,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:25,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:25,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:25,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:25,076 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:25,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:25,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:25:25,140 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:25,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:25:25,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:25:25,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:25:25,141 INFO L87 Difference]: Start difference. First operand 239 states and 281 transitions. Second operand 6 states. [2018-11-10 10:25:25,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:25,424 INFO L93 Difference]: Finished difference Result 331 states and 352 transitions. [2018-11-10 10:25:25,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:25:25,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-10 10:25:25,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:25,426 INFO L225 Difference]: With dead ends: 331 [2018-11-10 10:25:25,426 INFO L226 Difference]: Without dead ends: 331 [2018-11-10 10:25:25,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:25:25,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-10 10:25:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 241. [2018-11-10 10:25:25,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-10 10:25:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 283 transitions. [2018-11-10 10:25:25,431 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 283 transitions. Word has length 19 [2018-11-10 10:25:25,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:25,431 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 283 transitions. [2018-11-10 10:25:25,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:25:25,431 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 283 transitions. [2018-11-10 10:25:25,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 10:25:25,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:25,433 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:25,434 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:25,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:25,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1397436147, now seen corresponding path program 1 times [2018-11-10 10:25:25,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:25,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:25,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:25,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:25,436 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:25,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:25,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:25:25,479 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:25,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:25:25,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:25:25,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:25:25,479 INFO L87 Difference]: Start difference. First operand 241 states and 283 transitions. Second operand 5 states. [2018-11-10 10:25:25,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:25,684 INFO L93 Difference]: Finished difference Result 245 states and 284 transitions. [2018-11-10 10:25:25,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:25:25,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-10 10:25:25,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:25,686 INFO L225 Difference]: With dead ends: 245 [2018-11-10 10:25:25,686 INFO L226 Difference]: Without dead ends: 245 [2018-11-10 10:25:25,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:25:25,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-11-10 10:25:25,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 240. [2018-11-10 10:25:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-10 10:25:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 282 transitions. [2018-11-10 10:25:25,689 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 282 transitions. Word has length 20 [2018-11-10 10:25:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:25,690 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 282 transitions. [2018-11-10 10:25:25,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:25:25,690 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 282 transitions. [2018-11-10 10:25:25,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 10:25:25,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:25,690 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:25,691 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:25,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:25,691 INFO L82 PathProgramCache]: Analyzing trace with hash 370847667, now seen corresponding path program 1 times [2018-11-10 10:25:25,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:25,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:25,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:25,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:25,692 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:25,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:25,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:25,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:25:25,741 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:25,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:25:25,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:25:25,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:25:25,742 INFO L87 Difference]: Start difference. First operand 240 states and 282 transitions. Second operand 5 states. [2018-11-10 10:25:25,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:25,927 INFO L93 Difference]: Finished difference Result 239 states and 281 transitions. [2018-11-10 10:25:25,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:25:25,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-10 10:25:25,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:25,929 INFO L225 Difference]: With dead ends: 239 [2018-11-10 10:25:25,929 INFO L226 Difference]: Without dead ends: 239 [2018-11-10 10:25:25,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:25:25,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-11-10 10:25:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-11-10 10:25:25,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-11-10 10:25:25,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 281 transitions. [2018-11-10 10:25:25,933 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 281 transitions. Word has length 21 [2018-11-10 10:25:25,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:25,933 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 281 transitions. [2018-11-10 10:25:25,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:25:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 281 transitions. [2018-11-10 10:25:25,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 10:25:25,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:25,934 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:25,934 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:25,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:25,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1388624139, now seen corresponding path program 1 times [2018-11-10 10:25:25,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:25,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:25,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:25,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:25,935 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:25,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:25,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:25:25,972 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:25,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:25:25,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:25:25,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:25:25,972 INFO L87 Difference]: Start difference. First operand 239 states and 281 transitions. Second operand 6 states. [2018-11-10 10:25:26,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:26,202 INFO L93 Difference]: Finished difference Result 248 states and 289 transitions. [2018-11-10 10:25:26,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:25:26,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-10 10:25:26,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:26,203 INFO L225 Difference]: With dead ends: 248 [2018-11-10 10:25:26,203 INFO L226 Difference]: Without dead ends: 248 [2018-11-10 10:25:26,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:25:26,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-10 10:25:26,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 238. [2018-11-10 10:25:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-11-10 10:25:26,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 280 transitions. [2018-11-10 10:25:26,206 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 280 transitions. Word has length 22 [2018-11-10 10:25:26,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:26,206 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 280 transitions. [2018-11-10 10:25:26,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:25:26,206 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 280 transitions. [2018-11-10 10:25:26,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 10:25:26,207 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:26,207 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:26,208 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:26,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:26,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1193768857, now seen corresponding path program 1 times [2018-11-10 10:25:26,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:26,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:26,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:26,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:26,209 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:26,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:26,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:25:26,225 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:26,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:25:26,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:25:26,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:25:26,226 INFO L87 Difference]: Start difference. First operand 238 states and 280 transitions. Second operand 3 states. [2018-11-10 10:25:26,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:26,237 INFO L93 Difference]: Finished difference Result 284 states and 330 transitions. [2018-11-10 10:25:26,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:25:26,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 10:25:26,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:26,239 INFO L225 Difference]: With dead ends: 284 [2018-11-10 10:25:26,239 INFO L226 Difference]: Without dead ends: 284 [2018-11-10 10:25:26,239 INFO L605 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-11-10 10:25:26,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-11-10 10:25:26,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 253. [2018-11-10 10:25:26,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-10 10:25:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 300 transitions. [2018-11-10 10:25:26,242 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 300 transitions. Word has length 23 [2018-11-10 10:25:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:26,242 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 300 transitions. [2018-11-10 10:25:26,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:25:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 300 transitions. [2018-11-10 10:25:26,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 10:25:26,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:26,243 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:26,244 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:26,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:26,244 INFO L82 PathProgramCache]: Analyzing trace with hash -97675275, now seen corresponding path program 1 times [2018-11-10 10:25:26,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:26,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:26,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:26,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:26,245 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:26,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:26,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:25:26,295 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:26,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:25:26,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:25:26,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:25:26,295 INFO L87 Difference]: Start difference. First operand 253 states and 300 transitions. Second operand 7 states. [2018-11-10 10:25:26,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:26,589 INFO L93 Difference]: Finished difference Result 458 states and 494 transitions. [2018-11-10 10:25:26,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:25:26,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-10 10:25:26,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:26,591 INFO L225 Difference]: With dead ends: 458 [2018-11-10 10:25:26,591 INFO L226 Difference]: Without dead ends: 458 [2018-11-10 10:25:26,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:25:26,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-11-10 10:25:26,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 261. [2018-11-10 10:25:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-11-10 10:25:26,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 305 transitions. [2018-11-10 10:25:26,594 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 305 transitions. Word has length 23 [2018-11-10 10:25:26,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:26,595 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 305 transitions. [2018-11-10 10:25:26,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:25:26,595 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 305 transitions. [2018-11-10 10:25:26,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 10:25:26,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:26,595 INFO L375 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] [2018-11-10 10:25:26,597 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:26,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:26,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1267033847, now seen corresponding path program 1 times [2018-11-10 10:25:26,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:26,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:26,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:26,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:26,598 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:26,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:26,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:26,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 10:25:26,668 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:26,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 10:25:26,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:25:26,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:25:26,668 INFO L87 Difference]: Start difference. First operand 261 states and 305 transitions. Second operand 10 states. [2018-11-10 10:25:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:27,313 INFO L93 Difference]: Finished difference Result 340 states and 366 transitions. [2018-11-10 10:25:27,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 10:25:27,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-10 10:25:27,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:27,315 INFO L225 Difference]: With dead ends: 340 [2018-11-10 10:25:27,315 INFO L226 Difference]: Without dead ends: 340 [2018-11-10 10:25:27,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2018-11-10 10:25:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-10 10:25:27,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 260. [2018-11-10 10:25:27,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-10 10:25:27,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 303 transitions. [2018-11-10 10:25:27,319 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 303 transitions. Word has length 24 [2018-11-10 10:25:27,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:27,320 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 303 transitions. [2018-11-10 10:25:27,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 10:25:27,320 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 303 transitions. [2018-11-10 10:25:27,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 10:25:27,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:27,320 INFO L375 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-11-10 10:25:27,321 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:27,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:27,321 INFO L82 PathProgramCache]: Analyzing trace with hash 623343671, now seen corresponding path program 1 times [2018-11-10 10:25:27,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:27,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:27,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:27,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:27,322 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:27,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:27,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 10:25:27,456 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:27,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 10:25:27,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 10:25:27,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:25:27,457 INFO L87 Difference]: Start difference. First operand 260 states and 303 transitions. Second operand 11 states. [2018-11-10 10:25:28,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:28,178 INFO L93 Difference]: Finished difference Result 431 states and 466 transitions. [2018-11-10 10:25:28,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 10:25:28,178 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-11-10 10:25:28,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:28,179 INFO L225 Difference]: With dead ends: 431 [2018-11-10 10:25:28,180 INFO L226 Difference]: Without dead ends: 431 [2018-11-10 10:25:28,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2018-11-10 10:25:28,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-11-10 10:25:28,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 262. [2018-11-10 10:25:28,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-10 10:25:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 305 transitions. [2018-11-10 10:25:28,185 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 305 transitions. Word has length 25 [2018-11-10 10:25:28,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:28,185 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 305 transitions. [2018-11-10 10:25:28,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 10:25:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 305 transitions. [2018-11-10 10:25:28,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 10:25:28,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:28,186 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:28,186 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:28,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:28,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1407204516, now seen corresponding path program 1 times [2018-11-10 10:25:28,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:28,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:28,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:28,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:28,190 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:28,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:28,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:25:28,248 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:28,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:25:28,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:25:28,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:25:28,248 INFO L87 Difference]: Start difference. First operand 262 states and 305 transitions. Second operand 6 states. [2018-11-10 10:25:28,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:28,464 INFO L93 Difference]: Finished difference Result 265 states and 305 transitions. [2018-11-10 10:25:28,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:25:28,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-10 10:25:28,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:28,464 INFO L225 Difference]: With dead ends: 265 [2018-11-10 10:25:28,464 INFO L226 Difference]: Without dead ends: 265 [2018-11-10 10:25:28,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:25:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-11-10 10:25:28,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 260. [2018-11-10 10:25:28,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-10 10:25:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 303 transitions. [2018-11-10 10:25:28,467 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 303 transitions. Word has length 28 [2018-11-10 10:25:28,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:28,468 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 303 transitions. [2018-11-10 10:25:28,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:25:28,468 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 303 transitions. [2018-11-10 10:25:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 10:25:28,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:28,468 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:28,469 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:28,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:28,469 INFO L82 PathProgramCache]: Analyzing trace with hash -673666945, now seen corresponding path program 1 times [2018-11-10 10:25:28,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:28,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:28,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:28,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:28,470 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:28,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:28,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 10:25:28,574 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:28,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 10:25:28,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 10:25:28,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:25:28,574 INFO L87 Difference]: Start difference. First operand 260 states and 303 transitions. Second operand 12 states. [2018-11-10 10:25:29,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:29,225 INFO L93 Difference]: Finished difference Result 417 states and 459 transitions. [2018-11-10 10:25:29,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 10:25:29,226 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-10 10:25:29,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:29,227 INFO L225 Difference]: With dead ends: 417 [2018-11-10 10:25:29,227 INFO L226 Difference]: Without dead ends: 417 [2018-11-10 10:25:29,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-11-10 10:25:29,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-11-10 10:25:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 267. [2018-11-10 10:25:29,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-10 10:25:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 312 transitions. [2018-11-10 10:25:29,232 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 312 transitions. Word has length 29 [2018-11-10 10:25:29,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:29,232 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 312 transitions. [2018-11-10 10:25:29,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 10:25:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 312 transitions. [2018-11-10 10:25:29,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 10:25:29,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:29,233 INFO L375 BasicCegarLoop]: trace histogram [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-11-10 10:25:29,233 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:29,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:29,234 INFO L82 PathProgramCache]: Analyzing trace with hash -655395205, now seen corresponding path program 1 times [2018-11-10 10:25:29,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:29,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:29,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:29,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:29,235 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:29,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:29,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:25:29,432 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:25:29,433 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-11-10 10:25:29,434 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [13], [15], [17], [21], [23], [28], [30], [31], [32], [34], [36], [38], [40], [42], [44], [46], [48], [51], [57], [59], [61], [382], [383], [384] [2018-11-10 10:25:29,485 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:25:29,486 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:25:30,458 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:25:30,459 INFO L272 AbstractInterpreter]: Visited 30 different actions 54 times. Merged at 18 different actions 24 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 54 variables. [2018-11-10 10:25:30,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:30,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:25:30,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:25:30,465 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/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-11-10 10:25:30,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:30,472 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:25:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:30,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:25:30,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:25:30,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:30,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:30,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 10:25:30,602 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:30,608 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:30,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 10:25:30,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:30,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:30,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-11-10 10:25:30,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:25:30,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:25:30,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:30,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:30,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:30,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-11-10 10:25:30,713 INFO L477 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 37 treesize of output 33 [2018-11-10 10:25:30,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:25:30,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:30,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:30,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:30,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:23 [2018-11-10 10:25:30,744 INFO L477 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-11-10 10:25:30,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 10:25:30,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:30,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:30,754 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-11-10 10:25:30,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-11-10 10:25:30,901 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:30,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-10 10:25:30,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:30,917 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:30,918 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:30,919 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:30,920 INFO L477 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 16 treesize of output 13 [2018-11-10 10:25:30,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:30,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:30,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:14 [2018-11-10 10:25:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:30,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:25:31,465 WARN L179 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-10 10:25:31,484 INFO L477 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 17 treesize of output 15 [2018-11-10 10:25:31,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:31,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-10 10:25:31,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:31,508 INFO L477 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2018-11-10 10:25:31,509 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:31,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-10 10:25:31,528 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:44, output treesize:47 [2018-11-10 10:25:31,725 INFO L477 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 46 treesize of output 39 [2018-11-10 10:25:31,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:25:31,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:31,753 INFO L477 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 27 treesize of output 26 [2018-11-10 10:25:31,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:25:31,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:31,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:25:31,761 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:31,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:31,767 INFO L477 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 21 [2018-11-10 10:25:31,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-10 10:25:31,770 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:31,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:25:31,775 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:31,777 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:31,779 INFO L477 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 23 [2018-11-10 10:25:31,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:25:31,781 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:31,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-11-10 10:25:31,786 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:31,789 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:31,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 10:25:31,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 54 [2018-11-10 10:25:31,853 INFO L477 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 33 treesize of output 32 [2018-11-10 10:25:31,853 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:31,854 INFO L477 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 34 treesize of output 33 [2018-11-10 10:25:31,855 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:31,856 INFO L477 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 29 treesize of output 28 [2018-11-10 10:25:31,856 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:31,916 INFO L477 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 32 treesize of output 33 [2018-11-10 10:25:31,917 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:31,919 INFO L477 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 33 treesize of output 34 [2018-11-10 10:25:31,919 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:31,921 INFO L477 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 30 treesize of output 29 [2018-11-10 10:25:31,921 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:31,989 INFO L477 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 28 treesize of output 30 [2018-11-10 10:25:31,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-10 10:25:31,991 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:32,001 INFO L477 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 13 [2018-11-10 10:25:32,002 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:32,012 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 10:25:32,019 INFO L477 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 33 treesize of output 35 [2018-11-10 10:25:32,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-10 10:25:32,022 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:32,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-11-10 10:25:32,033 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:32,039 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:32,044 INFO L477 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 32 treesize of output 32 [2018-11-10 10:25:32,046 INFO L477 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 23 treesize of output 13 [2018-11-10 10:25:32,046 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:32,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-10 10:25:32,055 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:32,062 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 10:25:32,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-10 10:25:32,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-11-10 10:25:32,125 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:32,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:25:32,131 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:32,136 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:32,137 INFO L477 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 28 treesize of output 24 [2018-11-10 10:25:32,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:25:32,139 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:32,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-10 10:25:32,145 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:32,149 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:32,186 INFO L477 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 29 treesize of output 25 [2018-11-10 10:25:32,188 INFO L477 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 15 treesize of output 10 [2018-11-10 10:25:32,189 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:32,193 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:32,194 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-10 10:25:32,196 INFO L477 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 13 [2018-11-10 10:25:32,197 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:32,203 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:32,237 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 8 dim-0 vars, and 9 xjuncts. [2018-11-10 10:25:32,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 36 [2018-11-10 10:25:32,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:25:32,252 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:32,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-10 10:25:32,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:25:32,266 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:32,277 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:32,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-10 10:25:32,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-11-10 10:25:32,280 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:32,282 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:32,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-10 10:25:32,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-11-10 10:25:32,285 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:32,288 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:32,302 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:25:32,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 13 dim-0 vars, and 15 xjuncts. [2018-11-10 10:25:32,361 INFO L202 ElimStorePlain]: Needed 46 recursive calls to eliminate 3 variables, input treesize:58, output treesize:200 [2018-11-10 10:25:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:32,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:25:32,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2018-11-10 10:25:32,511 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:25:32,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 10:25:32,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 10:25:32,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=993, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 10:25:32,512 INFO L87 Difference]: Start difference. First operand 267 states and 312 transitions. Second operand 23 states. [2018-11-10 10:25:34,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:34,890 INFO L93 Difference]: Finished difference Result 341 states and 361 transitions. [2018-11-10 10:25:34,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 10:25:34,890 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 34 [2018-11-10 10:25:34,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:34,891 INFO L225 Difference]: With dead ends: 341 [2018-11-10 10:25:34,891 INFO L226 Difference]: Without dead ends: 341 [2018-11-10 10:25:34,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=715, Invalid=2707, Unknown=0, NotChecked=0, Total=3422 [2018-11-10 10:25:34,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-11-10 10:25:34,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 265. [2018-11-10 10:25:34,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-10 10:25:34,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 306 transitions. [2018-11-10 10:25:34,895 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 306 transitions. Word has length 34 [2018-11-10 10:25:34,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:34,896 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 306 transitions. [2018-11-10 10:25:34,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 10:25:34,896 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 306 transitions. [2018-11-10 10:25:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 10:25:34,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:34,896 INFO L375 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-11-10 10:25:34,897 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:34,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:34,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1525402557, now seen corresponding path program 1 times [2018-11-10 10:25:34,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:34,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:34,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:34,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:34,898 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:35,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:25:35,082 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:25:35,083 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-11-10 10:25:35,083 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [13], [15], [17], [21], [23], [28], [30], [32], [34], [35], [36], [38], [40], [42], [44], [46], [48], [51], [57], [59], [61], [382], [383], [384] [2018-11-10 10:25:35,084 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:25:35,085 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:25:35,708 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:25:35,708 INFO L272 AbstractInterpreter]: Visited 30 different actions 53 times. Merged at 18 different actions 23 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 54 variables. [2018-11-10 10:25:35,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:35,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:25:35,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:25:35,712 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/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-11-10 10:25:35,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:35,718 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:25:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:35,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:25:35,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:35,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:25:35,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-11-10 10:25:35,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:35,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-10 10:25:35,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:35,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:25:35,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2018-11-10 10:25:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:35,901 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:25:35,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [13] total 20 [2018-11-10 10:25:35,901 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:35,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:25:35,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:25:35,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2018-11-10 10:25:35,902 INFO L87 Difference]: Start difference. First operand 265 states and 306 transitions. Second operand 6 states. [2018-11-10 10:25:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:36,127 INFO L93 Difference]: Finished difference Result 264 states and 304 transitions. [2018-11-10 10:25:36,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:25:36,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-11-10 10:25:36,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:36,128 INFO L225 Difference]: With dead ends: 264 [2018-11-10 10:25:36,128 INFO L226 Difference]: Without dead ends: 264 [2018-11-10 10:25:36,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2018-11-10 10:25:36,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-10 10:25:36,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-11-10 10:25:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-10 10:25:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 304 transitions. [2018-11-10 10:25:36,132 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 304 transitions. Word has length 36 [2018-11-10 10:25:36,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:36,132 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 304 transitions. [2018-11-10 10:25:36,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:25:36,133 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 304 transitions. [2018-11-10 10:25:36,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 10:25:36,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:36,133 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:36,134 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:36,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:36,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1905229285, now seen corresponding path program 1 times [2018-11-10 10:25:36,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:36,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:36,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:36,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:36,134 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:36,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:25:36,183 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:25:36,183 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-11-10 10:25:36,183 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [13], [15], [17], [21], [23], [26], [28], [30], [32], [34], [36], [38], [40], [42], [44], [46], [48], [51], [57], [59], [61], [72], [76], [81], [85], [91], [95], [97], [98], [382], [383], [384] [2018-11-10 10:25:36,185 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:25:36,185 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:25:36,792 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:25:36,792 INFO L272 AbstractInterpreter]: Visited 38 different actions 69 times. Merged at 24 different actions 29 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 54 variables. [2018-11-10 10:25:36,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:36,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:25:36,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:25:36,800 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/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-11-10 10:25:36,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:36,810 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:25:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:36,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:25:36,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:36,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:25:36,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-11-10 10:25:36,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:36,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:36,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-11-10 10:25:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:36,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:25:36,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2018-11-10 10:25:36,909 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:25:36,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:25:36,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:25:36,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:25:36,910 INFO L87 Difference]: Start difference. First operand 264 states and 304 transitions. Second operand 8 states. [2018-11-10 10:25:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:37,281 INFO L93 Difference]: Finished difference Result 438 states and 465 transitions. [2018-11-10 10:25:37,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 10:25:37,283 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-10 10:25:37,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:37,284 INFO L225 Difference]: With dead ends: 438 [2018-11-10 10:25:37,284 INFO L226 Difference]: Without dead ends: 438 [2018-11-10 10:25:37,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:25:37,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-11-10 10:25:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 296. [2018-11-10 10:25:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-11-10 10:25:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 340 transitions. [2018-11-10 10:25:37,289 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 340 transitions. Word has length 40 [2018-11-10 10:25:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:37,289 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 340 transitions. [2018-11-10 10:25:37,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:25:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 340 transitions. [2018-11-10 10:25:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 10:25:37,290 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:37,290 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 10:25:37,290 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:37,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:37,291 INFO L82 PathProgramCache]: Analyzing trace with hash 613785153, now seen corresponding path program 1 times [2018-11-10 10:25:37,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:37,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:37,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:37,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:37,292 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:37,524 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:37,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:25:37,524 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:25:37,524 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-11-10 10:25:37,524 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [13], [15], [17], [21], [23], [28], [30], [32], [34], [36], [38], [40], [42], [43], [44], [46], [48], [51], [57], [59], [61], [382], [383], [384] [2018-11-10 10:25:37,526 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:25:37,526 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:25:38,034 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:25:38,034 INFO L272 AbstractInterpreter]: Visited 30 different actions 53 times. Merged at 18 different actions 23 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 54 variables. [2018-11-10 10:25:38,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:38,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:25:38,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:25:38,044 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/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-11-10 10:25:38,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:38,051 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:25:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:38,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:25:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:38,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:25:38,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-10 10:25:38,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:38,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-11-10 10:25:38,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:38,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:25:38,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2018-11-10 10:25:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:38,277 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:25:38,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [16] total 24 [2018-11-10 10:25:38,278 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:25:38,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:25:38,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:25:38,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2018-11-10 10:25:38,278 INFO L87 Difference]: Start difference. First operand 296 states and 340 transitions. Second operand 7 states. [2018-11-10 10:25:38,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:38,498 INFO L93 Difference]: Finished difference Result 308 states and 352 transitions. [2018-11-10 10:25:38,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:25:38,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-11-10 10:25:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:38,499 INFO L225 Difference]: With dead ends: 308 [2018-11-10 10:25:38,499 INFO L226 Difference]: Without dead ends: 308 [2018-11-10 10:25:38,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2018-11-10 10:25:38,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-10 10:25:38,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 295. [2018-11-10 10:25:38,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-11-10 10:25:38,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 338 transitions. [2018-11-10 10:25:38,503 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 338 transitions. Word has length 40 [2018-11-10 10:25:38,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:38,503 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 338 transitions. [2018-11-10 10:25:38,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:25:38,503 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 338 transitions. [2018-11-10 10:25:38,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 10:25:38,504 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:38,504 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:38,504 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:38,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:38,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1067434178, now seen corresponding path program 1 times [2018-11-10 10:25:38,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:38,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:38,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:38,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:38,506 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:38,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:25:38,571 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:25:38,571 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-11-10 10:25:38,571 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [13], [15], [17], [21], [23], [26], [28], [30], [32], [34], [36], [38], [40], [42], [44], [46], [48], [51], [57], [59], [61], [72], [76], [81], [85], [91], [95], [97], [99], [100], [382], [383], [384] [2018-11-10 10:25:38,573 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:25:38,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:25:39,175 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:25:39,175 INFO L272 AbstractInterpreter]: Visited 39 different actions 70 times. Merged at 24 different actions 29 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 54 variables. [2018-11-10 10:25:39,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:39,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:25:39,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:25:39,184 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/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-11-10 10:25:39,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:39,198 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:25:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:39,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:25:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:39,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:25:39,305 INFO L477 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 9 treesize of output 7 [2018-11-10 10:25:39,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:39,317 INFO L477 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 13 treesize of output 17 [2018-11-10 10:25:39,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:39,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:25:39,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:12 [2018-11-10 10:25:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:39,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:25:39,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-11-10 10:25:39,359 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:25:39,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 10:25:39,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 10:25:39,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:25:39,360 INFO L87 Difference]: Start difference. First operand 295 states and 338 transitions. Second operand 11 states. [2018-11-10 10:25:39,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:39,906 INFO L93 Difference]: Finished difference Result 555 states and 588 transitions. [2018-11-10 10:25:39,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:25:39,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-11-10 10:25:39,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:39,907 INFO L225 Difference]: With dead ends: 555 [2018-11-10 10:25:39,907 INFO L226 Difference]: Without dead ends: 555 [2018-11-10 10:25:39,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2018-11-10 10:25:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-11-10 10:25:39,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 297. [2018-11-10 10:25:39,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-10 10:25:39,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 338 transitions. [2018-11-10 10:25:39,912 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 338 transitions. Word has length 41 [2018-11-10 10:25:39,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:39,912 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 338 transitions. [2018-11-10 10:25:39,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 10:25:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 338 transitions. [2018-11-10 10:25:39,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 10:25:39,913 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:39,913 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:39,913 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:39,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:39,914 INFO L82 PathProgramCache]: Analyzing trace with hash 198273474, now seen corresponding path program 1 times [2018-11-10 10:25:39,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:25:39,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:39,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:39,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:39,915 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:25:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:40,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:25:40,270 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:25:40,270 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-10 10:25:40,270 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [13], [15], [17], [21], [23], [26], [28], [30], [32], [34], [36], [38], [40], [42], [44], [46], [48], [51], [57], [59], [61], [72], [76], [81], [85], [91], [95], [97], [99], [101], [104], [106], [108], [109], [382], [383], [384] [2018-11-10 10:25:40,272 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:25:40,272 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:25:40,949 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:25:40,949 INFO L272 AbstractInterpreter]: Visited 43 different actions 74 times. Merged at 24 different actions 29 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 62 variables. [2018-11-10 10:25:40,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:40,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:25:40,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:25:40,952 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/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-11-10 10:25:40,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:40,959 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:25:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:40,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:25:40,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:25:40,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:40,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:40,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 10:25:41,022 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:41,023 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:41,024 INFO L477 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-11-10 10:25:41,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:41,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:41,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-11-10 10:25:41,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:25:41,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:25:41,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:41,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:41,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:41,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-11-10 10:25:41,096 INFO L477 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 28 treesize of output 32 [2018-11-10 10:25:41,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:25:41,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:41,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:41,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:41,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:15 [2018-11-10 10:25:41,159 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:41,161 INFO L477 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 27 treesize of output 28 [2018-11-10 10:25:41,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:25:41,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:41,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:41,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:41,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2018-11-10 10:25:41,236 INFO L477 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-11-10 10:25:41,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 10:25:41,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:41,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:41,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:41,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2018-11-10 10:25:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:41,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:25:41,499 INFO L477 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 24 treesize of output 19 [2018-11-10 10:25:41,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:41,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:41,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:15 [2018-11-10 10:25:42,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 156 treesize of output 85 [2018-11-10 10:25:42,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:25:42,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:42,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-11-10 10:25:42,763 INFO L477 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 16 treesize of output 13 [2018-11-10 10:25:42,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:42,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 10:25:42,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:25:42,781 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:42,784 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:42,789 INFO L477 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 16 treesize of output 20 [2018-11-10 10:25:42,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-11-10 10:25:42,792 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:42,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-10 10:25:42,800 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:42,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-11-10 10:25:42,806 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:42,810 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:25:42,821 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-10 10:25:42,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 59 [2018-11-10 10:25:42,908 INFO L477 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 43 treesize of output 42 [2018-11-10 10:25:42,909 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:42,912 INFO L477 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 38 treesize of output 37 [2018-11-10 10:25:42,913 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:42,915 INFO L477 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 42 treesize of output 41 [2018-11-10 10:25:42,916 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:42,917 INFO L477 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 42 treesize of output 41 [2018-11-10 10:25:42,918 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2018-11-10 10:25:43,028 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,031 INFO L477 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 35 treesize of output 38 [2018-11-10 10:25:43,031 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2018-11-10 10:25:43,034 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,128 INFO L477 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 42 treesize of output 34 [2018-11-10 10:25:43,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-11-10 10:25:43,130 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:25:43,179 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,193 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 45 [2018-11-10 10:25:43,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-11-10 10:25:43,212 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-10 10:25:43,270 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-11-10 10:25:43,319 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,359 INFO L477 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 1 case distinctions, treesize of input 32 treesize of output 32 [2018-11-10 10:25:43,360 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:43,407 INFO L477 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 29 treesize of output 24 [2018-11-10 10:25:43,407 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:43,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-10 10:25:43,451 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 10:25:43,488 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 10:25:43,524 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,549 INFO L267 ElimStorePlain]: Start of recursive call 23: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:25:43,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2018-11-10 10:25:43,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-11-10 10:25:43,561 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-10 10:25:43,585 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-10 10:25:43,620 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-11-10 10:25:43,636 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-10 10:25:43,652 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,666 INFO L267 ElimStorePlain]: Start of recursive call 32: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:25:43,759 INFO L477 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 38 treesize of output 38 [2018-11-10 10:25:43,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-11-10 10:25:43,762 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-11-10 10:25:43,785 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,804 INFO L477 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 30 treesize of output 25 [2018-11-10 10:25:43,805 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:43,819 INFO L267 ElimStorePlain]: Start of recursive call 38: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:25:43,820 INFO L477 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 31 [2018-11-10 10:25:43,822 INFO L477 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 11 [2018-11-10 10:25:43,823 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,827 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,828 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:25:43,829 INFO L477 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 0 case distinctions, treesize of input 42 treesize of output 35 [2018-11-10 10:25:43,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-10 10:25:43,831 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,839 INFO L477 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 18 treesize of output 7 [2018-11-10 10:25:43,839 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,842 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,906 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-10 10:25:43,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 71 [2018-11-10 10:25:43,981 INFO L477 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 49 treesize of output 48 [2018-11-10 10:25:43,982 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,983 INFO L477 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 49 treesize of output 48 [2018-11-10 10:25:43,984 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,986 INFO L477 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 50 treesize of output 49 [2018-11-10 10:25:43,986 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,988 INFO L477 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 50 treesize of output 49 [2018-11-10 10:25:43,988 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,990 INFO L477 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 47 treesize of output 46 [2018-11-10 10:25:43,990 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,992 INFO L477 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 49 treesize of output 48 [2018-11-10 10:25:43,993 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,995 INFO L477 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 50 treesize of output 49 [2018-11-10 10:25:43,996 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,997 INFO L477 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 49 treesize of output 48 [2018-11-10 10:25:43,997 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:43,999 INFO L477 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 42 treesize of output 41 [2018-11-10 10:25:43,999 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:44,001 INFO L477 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 50 treesize of output 49 [2018-11-10 10:25:44,001 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:44,200 INFO L477 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 2 case distinctions, treesize of input 42 treesize of output 44 [2018-11-10 10:25:44,200 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:44,207 INFO L477 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 2 case distinctions, treesize of input 40 treesize of output 44 [2018-11-10 10:25:44,207 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:44,214 INFO L477 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 2 case distinctions, treesize of input 39 treesize of output 43 [2018-11-10 10:25:44,215 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:44,217 INFO L477 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 37 treesize of output 36 [2018-11-10 10:25:44,217 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:44,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 46 [2018-11-10 10:25:44,225 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:44,404 INFO L477 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 1 case distinctions, treesize of input 39 treesize of output 41 [2018-11-10 10:25:44,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-11-10 10:25:44,407 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:44,424 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:25:44,425 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:25:44,425 INFO L477 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 31 treesize of output 25 [2018-11-10 10:25:44,425 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:44,449 INFO L477 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 33 treesize of output 38 [2018-11-10 10:25:44,450 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 3 xjuncts. [2018-11-10 10:25:44,469 INFO L267 ElimStorePlain]: Start of recursive call 63: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:25:44,474 INFO L477 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 1 case distinctions, treesize of input 38 treesize of output 38 [2018-11-10 10:25:44,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-11-10 10:25:44,477 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:44,495 INFO L477 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 30 treesize of output 28 [2018-11-10 10:25:44,496 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:44,519 INFO L477 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 23 treesize of output 19 [2018-11-10 10:25:44,520 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:44,541 INFO L267 ElimStorePlain]: Start of recursive call 67: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 10:25:44,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 41 treesize of output 33 [2018-11-10 10:25:44,549 INFO L477 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 13 treesize of output 8 [2018-11-10 10:25:44,549 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:44,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-10 10:25:44,558 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:44,568 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:25:44,574 INFO L477 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 1 case distinctions, treesize of input 34 treesize of output 36 [2018-11-10 10:25:44,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-11-10 10:25:44,577 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:44,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-10 10:25:44,595 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:44,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-10 10:25:44,611 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:44,623 INFO L267 ElimStorePlain]: Start of recursive call 74: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:25:44,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-11-10 10:25:44,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-11-10 10:25:44,629 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:44,635 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:44,638 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-10 10:25:44,649 INFO L477 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 18 treesize of output 23 [2018-11-10 10:25:44,650 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 3 xjuncts. [2018-11-10 10:25:44,668 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:25:44,671 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-11-10 10:25:44,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-11-10 10:25:44,678 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:44,736 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:44,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 37 treesize of output 31 [2018-11-10 10:25:44,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-10 10:25:44,745 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:44,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:25:44,765 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:44,773 INFO L267 ElimStorePlain]: Start of recursive call 84: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:44,783 INFO L477 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 1 case distinctions, treesize of input 35 treesize of output 39 [2018-11-10 10:25:44,788 INFO L477 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 34 treesize of output 28 [2018-11-10 10:25:44,788 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:44,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-10 10:25:44,820 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:44,843 INFO L477 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 1 case distinctions, treesize of input 31 treesize of output 31 [2018-11-10 10:25:44,843 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:44,858 INFO L267 ElimStorePlain]: Start of recursive call 87: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:25:45,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 45 [2018-11-10 10:25:45,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 26 [2018-11-10 10:25:45,004 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:45,024 INFO L477 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 2 case distinctions, treesize of input 31 treesize of output 34 [2018-11-10 10:25:45,024 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 3 xjuncts. [2018-11-10 10:25:45,045 INFO L477 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 26 treesize of output 21 [2018-11-10 10:25:45,045 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:45,061 INFO L267 ElimStorePlain]: Start of recursive call 91: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:25:45,066 INFO L477 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 36 treesize of output 38 [2018-11-10 10:25:45,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-11-10 10:25:45,068 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:45,082 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:45,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2018-11-10 10:25:45,083 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:45,093 INFO L267 ElimStorePlain]: Start of recursive call 95: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:45,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2018-11-10 10:25:45,114 INFO L477 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 31 treesize of output 34 [2018-11-10 10:25:45,115 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 3 xjuncts. [2018-11-10 10:25:45,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-10 10:25:45,169 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:45,259 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:25:45,260 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:25:45,260 INFO L477 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 37 treesize of output 29 [2018-11-10 10:25:45,260 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:45,306 INFO L477 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 37 treesize of output 31 [2018-11-10 10:25:45,306 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:45,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-10 10:25:45,349 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:45,391 INFO L477 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 21 [2018-11-10 10:25:45,392 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:45,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-10 10:25:45,432 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:45,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-11-10 10:25:45,473 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:45,514 INFO L477 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 1 case distinctions, treesize of input 29 treesize of output 29 [2018-11-10 10:25:45,514 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:45,559 INFO L477 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 31 treesize of output 24 [2018-11-10 10:25:45,559 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:45,644 INFO L267 ElimStorePlain]: Start of recursive call 98: 13 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 10:25:45,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 52 [2018-11-10 10:25:45,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2018-11-10 10:25:45,656 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:45,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-11-10 10:25:45,688 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:45,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-10 10:25:45,715 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:45,739 INFO L477 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 34 treesize of output 28 [2018-11-10 10:25:45,739 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:45,765 INFO L477 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 1 case distinctions, treesize of input 24 treesize of output 18 [2018-11-10 10:25:45,765 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:45,794 INFO L477 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 31 treesize of output 27 [2018-11-10 10:25:45,795 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:45,825 INFO L477 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 28 treesize of output 19 [2018-11-10 10:25:45,825 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:45,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-10 10:25:45,846 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:45,860 INFO L267 ElimStorePlain]: Start of recursive call 109: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 10:25:45,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2018-11-10 10:25:45,879 INFO L477 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 1 case distinctions, treesize of input 34 treesize of output 28 [2018-11-10 10:25:45,879 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:45,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-10 10:25:45,962 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-10 10:25:46,050 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-10 10:25:46,122 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-10 10:25:46,200 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,262 INFO L477 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 28 treesize of output 24 [2018-11-10 10:25:46,263 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:46,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-11-10 10:25:46,411 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-10 10:25:46,447 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-10 10:25:46,480 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-10 10:25:46,512 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-11-10 10:25:46,514 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,541 INFO L267 ElimStorePlain]: Start of recursive call 118: 13 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-10 10:25:46,657 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-11-10 10:25:46,661 INFO L477 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 55 treesize of output 48 [2018-11-10 10:25:46,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:25:46,677 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2018-11-10 10:25:46,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-10 10:25:46,698 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,714 INFO L477 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 17 treesize of output 10 [2018-11-10 10:25:46,714 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-10 10:25:46,727 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-10 10:25:46,736 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,742 INFO L477 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 7 [2018-11-10 10:25:46,743 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,747 INFO L267 ElimStorePlain]: Start of recursive call 132: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:25:46,750 INFO L477 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 36 treesize of output 31 [2018-11-10 10:25:46,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-11-10 10:25:46,752 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:25:46,757 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,760 INFO L267 ElimStorePlain]: Start of recursive call 138: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 44 [2018-11-10 10:25:46,779 INFO L477 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 2 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 10:25:46,779 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 3 xjuncts. [2018-11-10 10:25:46,823 INFO L477 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 28 treesize of output 19 [2018-11-10 10:25:46,823 INFO L267 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-10 10:25:46,863 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,925 INFO L477 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 10 [2018-11-10 10:25:46,925 INFO L267 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2018-11-10 10:25:46,955 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:46,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-11-10 10:25:46,985 INFO L267 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:47,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-11-10 10:25:47,014 INFO L267 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:47,051 INFO L477 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 1 case distinctions, treesize of input 18 treesize of output 18 [2018-11-10 10:25:47,051 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:47,077 INFO L267 ElimStorePlain]: Start of recursive call 141: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 10:25:47,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 42 [2018-11-10 10:25:47,095 INFO L477 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 32 treesize of output 26 [2018-11-10 10:25:47,095 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:47,135 INFO L477 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 26 treesize of output 19 [2018-11-10 10:25:47,136 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:47,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-10 10:25:47,158 INFO L267 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:47,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-10 10:25:47,178 INFO L267 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:47,201 INFO L477 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 1 case distinctions, treesize of input 18 treesize of output 18 [2018-11-10 10:25:47,202 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:47,224 INFO L477 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 10 [2018-11-10 10:25:47,224 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:47,267 INFO L477 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 10 [2018-11-10 10:25:47,267 INFO L267 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:47,283 INFO L267 ElimStorePlain]: Start of recursive call 150: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 10:25:47,309 INFO L267 ElimStorePlain]: Start of recursive call 130: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-10 10:25:47,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 13 xjuncts. [2018-11-10 10:25:47,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 335 treesize of output 183 [2018-11-10 10:25:47,551 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-11-10 10:25:47,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 88 [2018-11-10 10:25:47,555 INFO L267 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:47,557 INFO L477 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 118 treesize of output 117 [2018-11-10 10:25:47,557 INFO L267 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:47,559 INFO L477 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 96 treesize of output 95 [2018-11-10 10:25:47,560 INFO L267 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:47,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 163 [2018-11-10 10:25:47,565 INFO L267 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:47,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 128 [2018-11-10 10:25:47,567 INFO L267 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:47,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 123 [2018-11-10 10:25:47,569 INFO L267 ElimStorePlain]: Start of recursive call 164: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:47,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 88 [2018-11-10 10:25:47,572 INFO L267 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:47,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 106 [2018-11-10 10:25:47,574 INFO L267 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:47,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 145 [2018-11-10 10:25:47,576 INFO L267 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:47,578 INFO L477 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 136 treesize of output 135 [2018-11-10 10:25:47,578 INFO L267 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:47,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 108 [2018-11-10 10:25:47,898 INFO L267 ElimStorePlain]: Start of recursive call 169: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 10:25:47,901 INFO L477 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 59 treesize of output 60 [2018-11-10 10:25:47,901 INFO L267 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:47,909 INFO L477 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 106 treesize of output 104 [2018-11-10 10:25:47,910 INFO L267 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:47,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 115 [2018-11-10 10:25:47,921 INFO L267 ElimStorePlain]: Start of recursive call 172: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 10:25:47,931 INFO L477 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 118 [2018-11-10 10:25:47,933 INFO L267 ElimStorePlain]: Start of recursive call 173: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 10:25:48,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 81 treesize of output 114 [2018-11-10 10:25:48,355 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2018-11-10 10:25:48,358 INFO L477 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 74 treesize of output 64 [2018-11-10 10:25:48,359 INFO L267 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:48,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2018-11-10 10:25:48,362 INFO L267 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:48,365 INFO L477 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 75 treesize of output 65 [2018-11-10 10:25:48,365 INFO L267 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:48,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2018-11-10 10:25:48,368 INFO L267 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:48,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 74 [2018-11-10 10:25:48,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2018-11-10 10:25:48,705 INFO L267 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:48,741 INFO L267 ElimStorePlain]: Start of recursive call 179: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:25:48,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 64 treesize of output 74 [2018-11-10 10:25:48,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2018-11-10 10:25:48,757 INFO L267 ElimStorePlain]: Start of recursive call 182: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:48,791 INFO L267 ElimStorePlain]: Start of recursive call 181: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:25:48,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 75 [2018-11-10 10:25:48,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2018-11-10 10:25:48,809 INFO L267 ElimStorePlain]: Start of recursive call 184: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:48,845 INFO L267 ElimStorePlain]: Start of recursive call 183: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:25:49,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 103 [2018-11-10 10:25:49,298 INFO L267 ElimStorePlain]: Start of recursive call 185: End of recursive call: and 4 xjuncts. [2018-11-10 10:25:49,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 128 [2018-11-10 10:25:49,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 82 [2018-11-10 10:25:49,343 INFO L267 ElimStorePlain]: Start of recursive call 187: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:49,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2018-11-10 10:25:49,551 INFO L267 ElimStorePlain]: Start of recursive call 188: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:49,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 77 [2018-11-10 10:25:49,687 INFO L267 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:49,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 70 [2018-11-10 10:25:49,820 INFO L267 ElimStorePlain]: Start of recursive call 190: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:49,916 INFO L267 ElimStorePlain]: Start of recursive call 186: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-10 10:25:49,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 128 [2018-11-10 10:25:49,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2018-11-10 10:25:49,946 INFO L267 ElimStorePlain]: Start of recursive call 192: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:50,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 82 [2018-11-10 10:25:50,144 INFO L267 ElimStorePlain]: Start of recursive call 193: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:50,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 70 [2018-11-10 10:25:50,286 INFO L267 ElimStorePlain]: Start of recursive call 194: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:50,479 INFO L267 ElimStorePlain]: Start of recursive call 191: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-10 10:25:51,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2018-11-10 10:25:51,110 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:25:51,111 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:25:51,111 INFO L477 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 43 treesize of output 41 [2018-11-10 10:25:51,112 INFO L267 ElimStorePlain]: Start of recursive call 196: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,135 INFO L477 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 40 treesize of output 34 [2018-11-10 10:25:51,135 INFO L267 ElimStorePlain]: Start of recursive call 197: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,158 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:25:51,158 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:25:51,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-10 10:25:51,159 INFO L267 ElimStorePlain]: Start of recursive call 198: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,182 INFO L267 ElimStorePlain]: Start of recursive call 195: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 51 treesize of output 51 [2018-11-10 10:25:51,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2018-11-10 10:25:51,227 INFO L267 ElimStorePlain]: Start of recursive call 200: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2018-11-10 10:25:51,229 INFO L267 ElimStorePlain]: Start of recursive call 201: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2018-11-10 10:25:51,232 INFO L267 ElimStorePlain]: Start of recursive call 202: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,290 INFO L477 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 42 treesize of output 36 [2018-11-10 10:25:51,291 INFO L267 ElimStorePlain]: Start of recursive call 203: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,292 INFO L477 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 43 treesize of output 37 [2018-11-10 10:25:51,293 INFO L267 ElimStorePlain]: Start of recursive call 204: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,345 INFO L477 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 41 treesize of output 35 [2018-11-10 10:25:51,345 INFO L267 ElimStorePlain]: Start of recursive call 205: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,347 INFO L477 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 40 treesize of output 34 [2018-11-10 10:25:51,347 INFO L267 ElimStorePlain]: Start of recursive call 206: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,398 INFO L477 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 34 treesize of output 28 [2018-11-10 10:25:51,398 INFO L267 ElimStorePlain]: Start of recursive call 207: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,403 INFO L477 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 1 case distinctions, treesize of input 35 treesize of output 35 [2018-11-10 10:25:51,404 INFO L267 ElimStorePlain]: Start of recursive call 208: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:51,460 INFO L477 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 36 treesize of output 31 [2018-11-10 10:25:51,460 INFO L267 ElimStorePlain]: Start of recursive call 209: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-10 10:25:51,468 INFO L267 ElimStorePlain]: Start of recursive call 210: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,506 INFO L267 ElimStorePlain]: Start of recursive call 199: 5 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 10:25:51,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 44 treesize of output 38 [2018-11-10 10:25:51,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:25:51,516 INFO L267 ElimStorePlain]: Start of recursive call 212: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-10 10:25:51,536 INFO L267 ElimStorePlain]: Start of recursive call 213: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:25:51,551 INFO L267 ElimStorePlain]: Start of recursive call 214: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,559 INFO L267 ElimStorePlain]: Start of recursive call 211: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-11-10 10:25:51,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:25:51,565 INFO L267 ElimStorePlain]: Start of recursive call 216: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:25:51,575 INFO L267 ElimStorePlain]: Start of recursive call 217: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-10 10:25:51,586 INFO L267 ElimStorePlain]: Start of recursive call 218: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,593 INFO L267 ElimStorePlain]: Start of recursive call 215: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,596 INFO L477 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 0 case distinctions, treesize of input 46 treesize of output 40 [2018-11-10 10:25:51,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:25:51,598 INFO L267 ElimStorePlain]: Start of recursive call 220: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,609 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:25:51,610 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:25:51,610 INFO L477 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 12 treesize of output 10 [2018-11-10 10:25:51,611 INFO L267 ElimStorePlain]: Start of recursive call 221: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,619 INFO L267 ElimStorePlain]: Start of recursive call 219: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 51 [2018-11-10 10:25:51,700 INFO L477 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 1 case distinctions, treesize of input 43 treesize of output 43 [2018-11-10 10:25:51,701 INFO L267 ElimStorePlain]: Start of recursive call 223: End of recursive call: and 2 xjuncts. [2018-11-10 10:25:51,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-10 10:25:51,738 INFO L267 ElimStorePlain]: Start of recursive call 224: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,773 INFO L477 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 35 treesize of output 29 [2018-11-10 10:25:51,774 INFO L267 ElimStorePlain]: Start of recursive call 225: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,775 INFO L477 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 35 treesize of output 29 [2018-11-10 10:25:51,776 INFO L267 ElimStorePlain]: Start of recursive call 226: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-11-10 10:25:51,807 INFO L267 ElimStorePlain]: Start of recursive call 227: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-11-10 10:25:51,809 INFO L267 ElimStorePlain]: Start of recursive call 228: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,836 INFO L477 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 21 [2018-11-10 10:25:51,837 INFO L267 ElimStorePlain]: Start of recursive call 229: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,855 INFO L267 ElimStorePlain]: Start of recursive call 222: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:25:51,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 48 treesize of output 48 [2018-11-10 10:25:51,864 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:25:51,864 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:25:51,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-11-10 10:25:51,865 INFO L267 ElimStorePlain]: Start of recursive call 231: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-11-10 10:25:51,889 INFO L267 ElimStorePlain]: Start of recursive call 232: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,920 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:25:51,920 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:25:51,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-11-10 10:25:51,921 INFO L267 ElimStorePlain]: Start of recursive call 233: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-10 10:25:51,945 INFO L267 ElimStorePlain]: Start of recursive call 234: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,968 INFO L477 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 21 [2018-11-10 10:25:51,969 INFO L267 ElimStorePlain]: Start of recursive call 235: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,981 INFO L267 ElimStorePlain]: Start of recursive call 230: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,983 INFO L477 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 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-10 10:25:51,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:25:51,986 INFO L267 ElimStorePlain]: Start of recursive call 237: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:51,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:25:51,996 INFO L267 ElimStorePlain]: Start of recursive call 238: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:52,004 INFO L267 ElimStorePlain]: Start of recursive call 236: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:52,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 81 [2018-11-10 10:25:52,539 INFO L477 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 54 treesize of output 48 [2018-11-10 10:25:52,539 INFO L267 ElimStorePlain]: Start of recursive call 240: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:52,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-11-10 10:25:52,655 INFO L267 ElimStorePlain]: Start of recursive call 241: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:52,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2018-11-10 10:25:52,773 INFO L267 ElimStorePlain]: Start of recursive call 242: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:53,089 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:25:53,089 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_prenex_94 term size 32 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) 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.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) 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:216) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-11-10 10:25:53,092 INFO L168 Benchmark]: Toolchain (without parser) took 32433.84 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 950.4 MB in the beginning and 1.7 GB in the end (delta: -702.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-10 10:25:53,093 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:25:53,093 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.96 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 926.3 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-10 10:25:53,093 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 926.3 MB in the beginning and 1.1 GB in the end (delta: -222.0 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:25:53,094 INFO L168 Benchmark]: Boogie Preprocessor took 31.69 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 10:25:53,094 INFO L168 Benchmark]: RCFGBuilder took 613.71 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: 65.8 MB). Peak memory consumption was 65.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:25:53,094 INFO L168 Benchmark]: TraceAbstraction took 31371.65 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 871.4 MB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -573.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-10 10:25:53,095 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.96 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 926.3 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 926.3 MB in the beginning and 1.1 GB in the end (delta: -222.0 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.69 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 613.71 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: 65.8 MB). Peak memory consumption was 65.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31371.65 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 871.4 MB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -573.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_94 term size 32 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_94 term size 32: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:25:54,484 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:25:54,485 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:25:54,493 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:25:54,493 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:25:54,493 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:25:54,494 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:25:54,495 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:25:54,496 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:25:54,497 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:25:54,498 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:25:54,498 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:25:54,499 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:25:54,499 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:25:54,501 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:25:54,501 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:25:54,501 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:25:54,503 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:25:54,504 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:25:54,506 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:25:54,506 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:25:54,507 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:25:54,509 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:25:54,509 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:25:54,509 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:25:54,510 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:25:54,511 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:25:54,511 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:25:54,512 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:25:54,513 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:25:54,513 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:25:54,514 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:25:54,514 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:25:54,514 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:25:54,514 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:25:54,515 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:25:54,515 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-11-10 10:25:54,526 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:25:54,526 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:25:54,527 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:25:54,527 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 10:25:54,527 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 10:25:54,527 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 10:25:54,527 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 10:25:54,528 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 10:25:54,528 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:25:54,528 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:25:54,529 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:25:54,529 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:25:54,529 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:25:54,529 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:25:54,529 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:25:54,529 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:25:54,529 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 10:25:54,529 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 10:25:54,529 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 10:25:54,530 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:25:54,530 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 10:25:54,530 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 10:25:54,530 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:25:54,530 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:25:54,530 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:25:54,530 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:25:54,530 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:25:54,530 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:25:54,531 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:25:54,531 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:25:54,531 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 10:25:54,531 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:25:54,531 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 10:25:54,531 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_3fa7a5fe-0b96-47a2-9046-d36e986364c4/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 -> 614aedb1ca0b3c75ba5d43ccd1ce8931602b4981 [2018-11-10 10:25:54,563 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:25:54,573 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:25:54,576 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:25:54,578 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:25:54,578 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:25:54,579 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-11-10 10:25:54,631 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/data/95e41980b/b1c813f5954a4a20a412c1971ead597b/FLAG2e53b0d08 [2018-11-10 10:25:54,992 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:25:54,992 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/sv-benchmarks/c/forester-heap/dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-11-10 10:25:55,002 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/data/95e41980b/b1c813f5954a4a20a412c1971ead597b/FLAG2e53b0d08 [2018-11-10 10:25:55,010 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/data/95e41980b/b1c813f5954a4a20a412c1971ead597b [2018-11-10 10:25:55,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:25:55,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:25:55,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:25:55,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:25:55,016 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:25:55,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:25:55" (1/1) ... [2018-11-10 10:25:55,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18e7fc6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:55, skipping insertion in model container [2018-11-10 10:25:55,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:25:55" (1/1) ... [2018-11-10 10:25:55,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:25:55,053 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:25:55,256 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:25:55,266 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:25:55,305 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:25:55,342 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:25:55,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:55 WrapperNode [2018-11-10 10:25:55,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:25:55,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:25:55,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:25:55,343 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:25:55,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:55" (1/1) ... [2018-11-10 10:25:55,406 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:55" (1/1) ... [2018-11-10 10:25:55,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:25:55,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:25:55,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:25:55,427 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:25:55,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:55" (1/1) ... [2018-11-10 10:25:55,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:55" (1/1) ... [2018-11-10 10:25:55,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:55" (1/1) ... [2018-11-10 10:25:55,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:55" (1/1) ... [2018-11-10 10:25:55,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:55" (1/1) ... [2018-11-10 10:25:55,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:55" (1/1) ... [2018-11-10 10:25:55,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:55" (1/1) ... [2018-11-10 10:25:55,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:25:55,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:25:55,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:25:55,460 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:25:55,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/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-11-10 10:25:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:25:55,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:25:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:25:55,500 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:25:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:25:55,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:25:56,268 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:25:56,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:25:56 BoogieIcfgContainer [2018-11-10 10:25:56,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:25:56,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:25:56,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:25:56,272 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:25:56,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:25:55" (1/3) ... [2018-11-10 10:25:56,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a3143e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:25:56, skipping insertion in model container [2018-11-10 10:25:56,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:55" (2/3) ... [2018-11-10 10:25:56,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a3143e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:25:56, skipping insertion in model container [2018-11-10 10:25:56,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:25:56" (3/3) ... [2018-11-10 10:25:56,278 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-11-10 10:25:56,284 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:25:56,289 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations. [2018-11-10 10:25:56,298 INFO L257 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2018-11-10 10:25:56,314 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:25:56,315 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:25:56,315 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 10:25:56,315 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:25:56,315 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:25:56,315 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:25:56,315 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:25:56,315 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:25:56,315 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:25:56,329 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states. [2018-11-10 10:25:56,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-10 10:25:56,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:56,337 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:56,340 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:56,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:56,345 INFO L82 PathProgramCache]: Analyzing trace with hash -438270983, now seen corresponding path program 1 times [2018-11-10 10:25:56,347 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:25:56,348 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:25:56,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:56,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:25:56,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:25:56,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:56,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:56,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 10:25:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:56,439 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:25:56,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:56,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:25:56,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:25:56,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:25:56,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:25:56,458 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 3 states. [2018-11-10 10:25:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:56,892 INFO L93 Difference]: Finished difference Result 214 states and 225 transitions. [2018-11-10 10:25:56,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:25:56,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-10 10:25:56,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:56,900 INFO L225 Difference]: With dead ends: 214 [2018-11-10 10:25:56,900 INFO L226 Difference]: Without dead ends: 210 [2018-11-10 10:25:56,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:25:56,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-10 10:25:56,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 197. [2018-11-10 10:25:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-10 10:25:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 207 transitions. [2018-11-10 10:25:56,935 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 207 transitions. Word has length 7 [2018-11-10 10:25:56,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:56,936 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 207 transitions. [2018-11-10 10:25:56,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:25:56,936 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 207 transitions. [2018-11-10 10:25:56,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 10:25:56,936 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:56,936 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:56,938 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:56,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:56,938 INFO L82 PathProgramCache]: Analyzing trace with hash -701498546, now seen corresponding path program 1 times [2018-11-10 10:25:56,938 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:25:56,939 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:25:56,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:56,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:25:56,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:25:56,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:56,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:56,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-10 10:25:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:57,005 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:25:57,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:57,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:25:57,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:25:57,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:25:57,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:25:57,007 INFO L87 Difference]: Start difference. First operand 197 states and 207 transitions. Second operand 3 states. [2018-11-10 10:25:57,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:57,343 INFO L93 Difference]: Finished difference Result 196 states and 206 transitions. [2018-11-10 10:25:57,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:25:57,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-10 10:25:57,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:57,345 INFO L225 Difference]: With dead ends: 196 [2018-11-10 10:25:57,345 INFO L226 Difference]: Without dead ends: 196 [2018-11-10 10:25:57,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-11-10 10:25:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-10 10:25:57,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-11-10 10:25:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-10 10:25:57,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 206 transitions. [2018-11-10 10:25:57,354 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 206 transitions. Word has length 8 [2018-11-10 10:25:57,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:57,355 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 206 transitions. [2018-11-10 10:25:57,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:25:57,355 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 206 transitions. [2018-11-10 10:25:57,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 10:25:57,355 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:57,355 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:57,357 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:57,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:57,357 INFO L82 PathProgramCache]: Analyzing trace with hash -271618405, now seen corresponding path program 1 times [2018-11-10 10:25:57,357 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:25:57,358 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:25:57,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:57,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:25:57,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:25:57,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:57,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:57,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 10:25:57,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:57,443 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:25:57,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:57,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:25:57,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:25:57,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:25:57,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:25:57,445 INFO L87 Difference]: Start difference. First operand 196 states and 206 transitions. Second operand 5 states. [2018-11-10 10:25:57,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:57,957 INFO L93 Difference]: Finished difference Result 258 states and 272 transitions. [2018-11-10 10:25:57,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:25:57,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-10 10:25:57,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:57,959 INFO L225 Difference]: With dead ends: 258 [2018-11-10 10:25:57,959 INFO L226 Difference]: Without dead ends: 258 [2018-11-10 10:25:57,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:25:57,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-10 10:25:57,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 195. [2018-11-10 10:25:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-10 10:25:57,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 205 transitions. [2018-11-10 10:25:57,966 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 205 transitions. Word has length 9 [2018-11-10 10:25:57,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:57,966 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 205 transitions. [2018-11-10 10:25:57,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:25:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 205 transitions. [2018-11-10 10:25:57,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 10:25:57,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:57,967 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:57,968 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:57,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:57,968 INFO L82 PathProgramCache]: Analyzing trace with hash 169764080, now seen corresponding path program 1 times [2018-11-10 10:25:57,968 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:25:57,969 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:25:57,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:58,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:25:58,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:25:58,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:58,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:58,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 10:25:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:58,071 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:25:58,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:58,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:25:58,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:25:58,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:25:58,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:25:58,077 INFO L87 Difference]: Start difference. First operand 195 states and 205 transitions. Second operand 4 states. [2018-11-10 10:25:58,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:58,612 INFO L93 Difference]: Finished difference Result 249 states and 263 transitions. [2018-11-10 10:25:58,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:25:58,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-10 10:25:58,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:58,614 INFO L225 Difference]: With dead ends: 249 [2018-11-10 10:25:58,614 INFO L226 Difference]: Without dead ends: 249 [2018-11-10 10:25:58,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-11-10 10:25:58,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-10 10:25:58,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 194. [2018-11-10 10:25:58,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-10 10:25:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 204 transitions. [2018-11-10 10:25:58,620 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 204 transitions. Word has length 10 [2018-11-10 10:25:58,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:58,620 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 204 transitions. [2018-11-10 10:25:58,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:25:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 204 transitions. [2018-11-10 10:25:58,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 10:25:58,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:58,621 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:58,622 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:58,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:58,623 INFO L82 PathProgramCache]: Analyzing trace with hash 967719229, now seen corresponding path program 1 times [2018-11-10 10:25:58,623 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:25:58,623 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:25:58,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:58,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:25:58,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:25:58,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:58,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:58,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 10:25:58,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:58,691 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:25:58,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:58,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:25:58,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:25:58,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:25:58,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:25:58,694 INFO L87 Difference]: Start difference. First operand 194 states and 204 transitions. Second operand 5 states. [2018-11-10 10:25:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:59,200 INFO L93 Difference]: Finished difference Result 254 states and 268 transitions. [2018-11-10 10:25:59,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:25:59,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-10 10:25:59,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:59,201 INFO L225 Difference]: With dead ends: 254 [2018-11-10 10:25:59,202 INFO L226 Difference]: Without dead ends: 254 [2018-11-10 10:25:59,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:25:59,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-10 10:25:59,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 192. [2018-11-10 10:25:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-10 10:25:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 202 transitions. [2018-11-10 10:25:59,208 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 202 transitions. Word has length 11 [2018-11-10 10:25:59,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:59,208 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 202 transitions. [2018-11-10 10:25:59,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:25:59,208 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 202 transitions. [2018-11-10 10:25:59,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 10:25:59,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:59,209 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:59,210 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:59,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:59,210 INFO L82 PathProgramCache]: Analyzing trace with hash -65474926, now seen corresponding path program 1 times [2018-11-10 10:25:59,211 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:25:59,211 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:25:59,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:59,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:25:59,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:25:59,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:59,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:59,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 10:25:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:59,305 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:25:59,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:59,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:25:59,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:25:59,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:25:59,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:25:59,311 INFO L87 Difference]: Start difference. First operand 192 states and 202 transitions. Second operand 4 states. [2018-11-10 10:25:59,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:25:59,743 INFO L93 Difference]: Finished difference Result 263 states and 279 transitions. [2018-11-10 10:25:59,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:25:59,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-10 10:25:59,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:25:59,744 INFO L225 Difference]: With dead ends: 263 [2018-11-10 10:25:59,745 INFO L226 Difference]: Without dead ends: 263 [2018-11-10 10:25:59,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-11-10 10:25:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-10 10:25:59,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 190. [2018-11-10 10:25:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-10 10:25:59,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 200 transitions. [2018-11-10 10:25:59,748 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 200 transitions. Word has length 12 [2018-11-10 10:25:59,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:25:59,748 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 200 transitions. [2018-11-10 10:25:59,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:25:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 200 transitions. [2018-11-10 10:25:59,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 10:25:59,749 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:25:59,749 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:59,750 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:25:59,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:59,750 INFO L82 PathProgramCache]: Analyzing trace with hash -648317245, now seen corresponding path program 1 times [2018-11-10 10:25:59,750 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:25:59,750 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:25:59,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:59,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:25:59,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:25:59,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:59,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:59,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 10:25:59,852 INFO L477 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-11-10 10:25:59,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:59,857 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-11-10 10:25:59,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-11-10 10:25:59,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:25:59,869 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:25:59,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:25:59,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:25:59,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:25:59,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:25:59,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:25:59,872 INFO L87 Difference]: Start difference. First operand 190 states and 200 transitions. Second operand 6 states. [2018-11-10 10:26:00,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:26:00,807 INFO L93 Difference]: Finished difference Result 418 states and 442 transitions. [2018-11-10 10:26:00,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:26:00,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-10 10:26:00,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:26:00,809 INFO L225 Difference]: With dead ends: 418 [2018-11-10 10:26:00,809 INFO L226 Difference]: Without dead ends: 418 [2018-11-10 10:26:00,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:26:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-11-10 10:26:00,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 234. [2018-11-10 10:26:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-10 10:26:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 275 transitions. [2018-11-10 10:26:00,814 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 275 transitions. Word has length 15 [2018-11-10 10:26:00,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:26:00,814 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 275 transitions. [2018-11-10 10:26:00,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:26:00,814 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 275 transitions. [2018-11-10 10:26:00,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 10:26:00,815 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:26:00,815 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:26:00,816 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:26:00,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:26:00,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1377001946, now seen corresponding path program 1 times [2018-11-10 10:26:00,816 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:26:00,816 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:26:00,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:26:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:26:00,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:26:00,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:26:00,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:00,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:26:00,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:00,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:00,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-10 10:26:00,949 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:26:00,950 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:26:00,951 INFO L477 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-11-10 10:26:00,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:00,964 INFO L477 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-11-10 10:26:00,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:00,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:00,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-11-10 10:26:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:26:00,984 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:26:00,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:26:00,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:26:00,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:26:00,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:26:00,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:26:00,992 INFO L87 Difference]: Start difference. First operand 234 states and 275 transitions. Second operand 5 states. [2018-11-10 10:26:02,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:26:02,094 INFO L93 Difference]: Finished difference Result 457 states and 481 transitions. [2018-11-10 10:26:02,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:26:02,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-10 10:26:02,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:26:02,096 INFO L225 Difference]: With dead ends: 457 [2018-11-10 10:26:02,096 INFO L226 Difference]: Without dead ends: 457 [2018-11-10 10:26:02,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:26:02,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-11-10 10:26:02,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 237. [2018-11-10 10:26:02,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-10 10:26:02,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 277 transitions. [2018-11-10 10:26:02,103 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 277 transitions. Word has length 16 [2018-11-10 10:26:02,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:26:02,103 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 277 transitions. [2018-11-10 10:26:02,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:26:02,103 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 277 transitions. [2018-11-10 10:26:02,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 10:26:02,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:26:02,105 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:26:02,106 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:26:02,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:26:02,106 INFO L82 PathProgramCache]: Analyzing trace with hash -262612571, now seen corresponding path program 1 times [2018-11-10 10:26:02,106 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:26:02,106 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:26:02,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:26:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:26:02,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:26:02,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:26:02,187 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:26:02,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:26:02,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:26:02,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:26:02,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:26:02,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:26:02,189 INFO L87 Difference]: Start difference. First operand 237 states and 277 transitions. Second operand 5 states. [2018-11-10 10:26:02,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:26:02,772 INFO L93 Difference]: Finished difference Result 244 states and 283 transitions. [2018-11-10 10:26:02,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:26:02,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-10 10:26:02,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:26:02,774 INFO L225 Difference]: With dead ends: 244 [2018-11-10 10:26:02,775 INFO L226 Difference]: Without dead ends: 244 [2018-11-10 10:26:02,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:26:02,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-11-10 10:26:02,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 234. [2018-11-10 10:26:02,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-10 10:26:02,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 274 transitions. [2018-11-10 10:26:02,781 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 274 transitions. Word has length 17 [2018-11-10 10:26:02,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:26:02,781 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 274 transitions. [2018-11-10 10:26:02,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:26:02,781 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 274 transitions. [2018-11-10 10:26:02,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 10:26:02,782 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:26:02,782 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:26:02,783 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:26:02,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:26:02,783 INFO L82 PathProgramCache]: Analyzing trace with hash 448944956, now seen corresponding path program 1 times [2018-11-10 10:26:02,783 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:26:02,787 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:26:02,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:26:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:26:02,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:26:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:26:02,888 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:26:02,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:26:02,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:26:02,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:26:02,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:26:02,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:26:02,890 INFO L87 Difference]: Start difference. First operand 234 states and 274 transitions. Second operand 6 states. [2018-11-10 10:26:03,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:26:03,563 INFO L93 Difference]: Finished difference Result 325 states and 344 transitions. [2018-11-10 10:26:03,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:26:03,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-10 10:26:03,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:26:03,565 INFO L225 Difference]: With dead ends: 325 [2018-11-10 10:26:03,565 INFO L226 Difference]: Without dead ends: 325 [2018-11-10 10:26:03,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:26:03,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-11-10 10:26:03,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 236. [2018-11-10 10:26:03,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-11-10 10:26:03,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 276 transitions. [2018-11-10 10:26:03,569 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 276 transitions. Word has length 18 [2018-11-10 10:26:03,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:26:03,569 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 276 transitions. [2018-11-10 10:26:03,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:26:03,569 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 276 transitions. [2018-11-10 10:26:03,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 10:26:03,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:26:03,570 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:26:03,570 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:26:03,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:26:03,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1032391815, now seen corresponding path program 1 times [2018-11-10 10:26:03,571 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:26:03,571 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:26:03,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:26:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:26:03,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:26:03,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:26:03,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:03,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:03,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-10 10:26:03,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:26:03,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:26:03,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:03,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:03,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:03,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:26:03,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:26:03,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:26:03,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:03,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:03,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:03,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:26:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:26:03,737 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:26:03,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:26:03,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:26:03,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:26:03,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:26:03,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:26:03,740 INFO L87 Difference]: Start difference. First operand 236 states and 276 transitions. Second operand 7 states. [2018-11-10 10:26:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:26:04,811 INFO L93 Difference]: Finished difference Result 327 states and 345 transitions. [2018-11-10 10:26:04,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 10:26:04,811 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-10 10:26:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:26:04,812 INFO L225 Difference]: With dead ends: 327 [2018-11-10 10:26:04,812 INFO L226 Difference]: Without dead ends: 327 [2018-11-10 10:26:04,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:26:04,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-11-10 10:26:04,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 237. [2018-11-10 10:26:04,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-10 10:26:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 277 transitions. [2018-11-10 10:26:04,816 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 277 transitions. Word has length 19 [2018-11-10 10:26:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:26:04,816 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 277 transitions. [2018-11-10 10:26:04,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:26:04,816 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 277 transitions. [2018-11-10 10:26:04,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 10:26:04,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:26:04,817 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:26:04,817 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:26:04,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:26:04,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1939375262, now seen corresponding path program 1 times [2018-11-10 10:26:04,817 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:26:04,817 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:26:04,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:26:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:26:04,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:26:04,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:26:04,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:04,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:04,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-11-10 10:26:04,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:26:04,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:26:04,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:04,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:05,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:26:05,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:26:05,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:05,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:05,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:05,033 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:20 [2018-11-10 10:26:05,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:26:05,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:26:05,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:05,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:05,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:26:05,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:26:05,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:05,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:05,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:05,079 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:14 [2018-11-10 10:26:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:26:05,092 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:26:05,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:26:05,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:26:05,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:26:05,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:26:05,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:26:05,097 INFO L87 Difference]: Start difference. First operand 237 states and 277 transitions. Second operand 7 states. [2018-11-10 10:26:06,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:26:06,046 INFO L93 Difference]: Finished difference Result 323 states and 342 transitions. [2018-11-10 10:26:06,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:26:06,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-10 10:26:06,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:26:06,048 INFO L225 Difference]: With dead ends: 323 [2018-11-10 10:26:06,048 INFO L226 Difference]: Without dead ends: 323 [2018-11-10 10:26:06,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:26:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-11-10 10:26:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 238. [2018-11-10 10:26:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-11-10 10:26:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 278 transitions. [2018-11-10 10:26:06,054 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 278 transitions. Word has length 20 [2018-11-10 10:26:06,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:26:06,054 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 278 transitions. [2018-11-10 10:26:06,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:26:06,054 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 278 transitions. [2018-11-10 10:26:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 10:26:06,055 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:26:06,055 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:26:06,056 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:26:06,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:26:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1015266724, now seen corresponding path program 1 times [2018-11-10 10:26:06,056 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:26:06,056 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:26:06,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:26:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:26:06,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:26:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:26:06,118 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:26:06,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:26:06,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:26:06,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:26:06,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:26:06,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:26:06,121 INFO L87 Difference]: Start difference. First operand 238 states and 278 transitions. Second operand 3 states. [2018-11-10 10:26:06,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:26:06,154 INFO L93 Difference]: Finished difference Result 285 states and 329 transitions. [2018-11-10 10:26:06,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:26:06,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 10:26:06,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:26:06,156 INFO L225 Difference]: With dead ends: 285 [2018-11-10 10:26:06,156 INFO L226 Difference]: Without dead ends: 285 [2018-11-10 10:26:06,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-11-10 10:26:06,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-11-10 10:26:06,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 252. [2018-11-10 10:26:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-11-10 10:26:06,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 299 transitions. [2018-11-10 10:26:06,162 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 299 transitions. Word has length 22 [2018-11-10 10:26:06,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:26:06,163 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 299 transitions. [2018-11-10 10:26:06,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:26:06,163 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 299 transitions. [2018-11-10 10:26:06,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 10:26:06,163 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:26:06,164 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:26:06,164 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:26:06,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:26:06,164 INFO L82 PathProgramCache]: Analyzing trace with hash -276177408, now seen corresponding path program 1 times [2018-11-10 10:26:06,165 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:26:06,165 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:26:06,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:26:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:26:06,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:26:06,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:26:06,347 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:26:06,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:26:06,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:26:06,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:26:06,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:26:06,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:26:06,350 INFO L87 Difference]: Start difference. First operand 252 states and 299 transitions. Second operand 7 states. [2018-11-10 10:26:07,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:26:07,956 INFO L93 Difference]: Finished difference Result 458 states and 495 transitions. [2018-11-10 10:26:07,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:26:07,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-10 10:26:07,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:26:07,957 INFO L225 Difference]: With dead ends: 458 [2018-11-10 10:26:07,957 INFO L226 Difference]: Without dead ends: 458 [2018-11-10 10:26:07,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:26:07,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-11-10 10:26:07,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 258. [2018-11-10 10:26:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-10 10:26:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 302 transitions. [2018-11-10 10:26:07,963 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 302 transitions. Word has length 22 [2018-11-10 10:26:07,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:26:07,963 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 302 transitions. [2018-11-10 10:26:07,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:26:07,964 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 302 transitions. [2018-11-10 10:26:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 10:26:07,964 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:26:07,964 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:26:07,965 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:26:07,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:26:07,965 INFO L82 PathProgramCache]: Analyzing trace with hash 28435019, now seen corresponding path program 1 times [2018-11-10 10:26:07,966 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:26:07,966 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:26:07,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:26:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:26:08,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:26:08,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:26:08,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:08,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:08,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-10 10:26:08,218 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:26:08,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:26:08,220 INFO L477 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-11-10 10:26:08,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:08,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:08,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:26 [2018-11-10 10:26:08,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:26:08,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:26:08,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:08,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:08,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:08,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:34 [2018-11-10 10:26:08,353 INFO L477 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 39 treesize of output 35 [2018-11-10 10:26:08,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:26:08,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:08,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:08,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:08,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2018-11-10 10:26:08,405 INFO L477 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-11-10 10:26:08,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 10:26:08,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:08,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:08,418 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-11-10 10:26:08,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-11-10 10:26:08,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:26:08,438 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:26:08,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:26:08,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 10:26:08,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 10:26:08,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:26:08,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:26:08,447 INFO L87 Difference]: Start difference. First operand 258 states and 302 transitions. Second operand 10 states. [2018-11-10 10:26:10,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:26:10,147 INFO L93 Difference]: Finished difference Result 426 states and 460 transitions. [2018-11-10 10:26:10,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:26:10,148 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-10 10:26:10,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:26:10,148 INFO L225 Difference]: With dead ends: 426 [2018-11-10 10:26:10,149 INFO L226 Difference]: Without dead ends: 426 [2018-11-10 10:26:10,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-11-10 10:26:10,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-11-10 10:26:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 259. [2018-11-10 10:26:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-10 10:26:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 303 transitions. [2018-11-10 10:26:10,152 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 303 transitions. Word has length 23 [2018-11-10 10:26:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:26:10,152 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 303 transitions. [2018-11-10 10:26:10,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 10:26:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 303 transitions. [2018-11-10 10:26:10,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 10:26:10,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:26:10,153 INFO L375 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] [2018-11-10 10:26:10,154 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:26:10,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:26:10,154 INFO L82 PathProgramCache]: Analyzing trace with hash 881485666, now seen corresponding path program 1 times [2018-11-10 10:26:10,154 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:26:10,154 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:26:10,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:26:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:26:10,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:26:10,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:26:10,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 10:26:10,314 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:26:10,315 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:26:10,315 INFO L477 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-11-10 10:26:10,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,327 INFO L477 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-11-10 10:26:10,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:22 [2018-11-10 10:26:10,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:26:10,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:26:10,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:26:10,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:26:10,385 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,408 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-10 10:26:10,461 INFO L477 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 27 treesize of output 28 [2018-11-10 10:26:10,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:26:10,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,492 INFO L477 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 48 treesize of output 44 [2018-11-10 10:26:10,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:26:10,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,504 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,519 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:66, output treesize:28 [2018-11-10 10:26:10,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 10:26:10,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 10:26:10,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,553 INFO L477 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-11-10 10:26:10,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 10:26:10,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:10,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:12 [2018-11-10 10:26:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:26:10,590 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:26:10,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:26:10,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 10:26:10,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:26:10,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:26:10,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:26:10,592 INFO L87 Difference]: Start difference. First operand 259 states and 303 transitions. Second operand 9 states. [2018-11-10 10:26:12,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:26:12,415 INFO L93 Difference]: Finished difference Result 425 states and 459 transitions. [2018-11-10 10:26:12,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 10:26:12,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-10 10:26:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:26:12,417 INFO L225 Difference]: With dead ends: 425 [2018-11-10 10:26:12,417 INFO L226 Difference]: Without dead ends: 425 [2018-11-10 10:26:12,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-11-10 10:26:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-11-10 10:26:12,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 260. [2018-11-10 10:26:12,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-10 10:26:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 304 transitions. [2018-11-10 10:26:12,421 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 304 transitions. Word has length 24 [2018-11-10 10:26:12,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:26:12,421 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 304 transitions. [2018-11-10 10:26:12,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:26:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 304 transitions. [2018-11-10 10:26:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 10:26:12,422 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:26:12,422 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:26:12,422 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:26:12,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:26:12,422 INFO L82 PathProgramCache]: Analyzing trace with hash 909507696, now seen corresponding path program 1 times [2018-11-10 10:26:12,423 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:26:12,423 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:26:12,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:26:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:26:12,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:26:12,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-10 10:26:12,527 INFO L477 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-11-10 10:26:12,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:12,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:12,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:12,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:11, output treesize:3 [2018-11-10 10:26:12,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:26:12,542 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:26:12,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:26:12,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:26:12,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:26:12,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:26:12,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:26:12,545 INFO L87 Difference]: Start difference. First operand 260 states and 304 transitions. Second operand 5 states. [2018-11-10 10:26:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:26:13,118 INFO L93 Difference]: Finished difference Result 263 states and 304 transitions. [2018-11-10 10:26:13,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:26:13,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-10 10:26:13,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:26:13,120 INFO L225 Difference]: With dead ends: 263 [2018-11-10 10:26:13,120 INFO L226 Difference]: Without dead ends: 263 [2018-11-10 10:26:13,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:26:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-10 10:26:13,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 258. [2018-11-10 10:26:13,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-10 10:26:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 302 transitions. [2018-11-10 10:26:13,124 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 302 transitions. Word has length 27 [2018-11-10 10:26:13,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:26:13,124 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 302 transitions. [2018-11-10 10:26:13,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:26:13,124 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 302 transitions. [2018-11-10 10:26:13,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 10:26:13,124 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:26:13,125 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:26:13,125 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:26:13,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:26:13,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1870032406, now seen corresponding path program 1 times [2018-11-10 10:26:13,125 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:26:13,125 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:26:13,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:26:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:26:13,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:26:13,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:26:13,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 10:26:13,340 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:26:13,348 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:26:13,348 INFO L477 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-11-10 10:26:13,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,384 INFO L477 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-11-10 10:26:13,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:22 [2018-11-10 10:26:13,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:26:13,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:26:13,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:26:13,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:26:13,467 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,470 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,487 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-10 10:26:13,564 INFO L477 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 27 treesize of output 28 [2018-11-10 10:26:13,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:26:13,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,602 INFO L477 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 48 treesize of output 44 [2018-11-10 10:26:13,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:26:13,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,634 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:66, output treesize:28 [2018-11-10 10:26:13,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 10:26:13,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 10:26:13,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,690 INFO L477 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-11-10 10:26:13,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 10:26:13,693 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:13,705 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:15 [2018-11-10 10:26:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:26:13,774 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:26:13,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:26:13,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 10:26:13,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 10:26:13,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 10:26:13,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:26:13,777 INFO L87 Difference]: Start difference. First operand 258 states and 302 transitions. Second operand 11 states. [2018-11-10 10:26:15,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:26:15,774 INFO L93 Difference]: Finished difference Result 333 states and 360 transitions. [2018-11-10 10:26:15,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 10:26:15,775 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-11-10 10:26:15,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:26:15,776 INFO L225 Difference]: With dead ends: 333 [2018-11-10 10:26:15,776 INFO L226 Difference]: Without dead ends: 333 [2018-11-10 10:26:15,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2018-11-10 10:26:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-10 10:26:15,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 256. [2018-11-10 10:26:15,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-10 10:26:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 300 transitions. [2018-11-10 10:26:15,780 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 300 transitions. Word has length 28 [2018-11-10 10:26:15,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:26:15,780 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 300 transitions. [2018-11-10 10:26:15,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 10:26:15,781 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 300 transitions. [2018-11-10 10:26:15,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 10:26:15,781 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:26:15,781 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:26:15,782 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:26:15,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:26:15,782 INFO L82 PathProgramCache]: Analyzing trace with hash 743610674, now seen corresponding path program 1 times [2018-11-10 10:26:15,782 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:26:15,782 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:26:15,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:26:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:26:16,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:26:16,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:26:16,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:16,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:16,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 10:26:16,093 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:26:16,096 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:26:16,096 INFO L477 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-11-10 10:26:16,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:16,113 INFO L477 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-11-10 10:26:16,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:16,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:16,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-11-10 10:26:16,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:26:16,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:26:16,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:16,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:16,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:16,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:45 [2018-11-10 10:26:16,242 INFO L477 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 48 treesize of output 44 [2018-11-10 10:26:16,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:26:16,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:16,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:16,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:16,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:39 [2018-11-10 10:26:16,291 INFO L477 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-11-10 10:26:16,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-11-10 10:26:16,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:16,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:16,313 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-11-10 10:26:16,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:28 [2018-11-10 10:26:16,579 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:26:16,580 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:26:16,581 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:26:16,582 INFO L477 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 20 treesize of output 13 [2018-11-10 10:26:16,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:16,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-11-10 10:26:16,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:16,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:16,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:62, output treesize:33 [2018-11-10 10:26:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:26:16,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:26:17,124 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-10 10:26:17,321 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2018-11-10 10:26:17,591 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-10 10:26:18,896 WARN L179 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-10 10:26:18,936 INFO L477 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 179 treesize of output 124 [2018-11-10 10:26:19,341 WARN L179 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2018-11-10 10:26:19,348 INFO L477 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 9 treesize of output 8 [2018-11-10 10:26:19,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:19,603 INFO L477 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 60 treesize of output 55 [2018-11-10 10:26:19,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:19,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:19,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-10 10:26:19,680 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:19,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:19,727 INFO L477 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 57 treesize of output 50 [2018-11-10 10:26:19,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 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-11-10 10:26:19,743 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:19,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:19,806 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:19,843 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:19,855 INFO L477 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 67 treesize of output 60 [2018-11-10 10:26:19,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:19,871 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:19,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 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-11-10 10:26:19,923 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:19,965 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:19,975 INFO L477 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 45 [2018-11-10 10:26:19,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:19,984 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:20,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-10 10:26:20,030 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:20,056 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:20,066 INFO L477 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 51 treesize of output 50 [2018-11-10 10:26:20,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:20,072 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:20,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:20,108 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:20,132 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:20,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-11-10 10:26:20,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-10 10:26:20,151 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:20,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:20,219 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:20,252 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:20,277 INFO L477 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 67 treesize of output 60 [2018-11-10 10:26:20,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:20,290 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:20,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 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-11-10 10:26:20,376 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:20,428 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:20,442 INFO L477 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 57 treesize of output 50 [2018-11-10 10:26:20,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:20,455 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:20,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 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-11-10 10:26:20,504 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:20,549 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:20,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-11-10 10:26:20,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:20,576 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:20,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-10 10:26:20,637 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:20,684 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:20,698 INFO L477 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 61 treesize of output 58 [2018-11-10 10:26:20,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:20,706 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:20,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 10:26:20,773 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:20,805 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:21,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 21 dim-0 vars, and 24 xjuncts. [2018-11-10 10:26:21,671 INFO L477 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 141 treesize of output 102 [2018-11-10 10:26:21,814 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-10 10:26:21,820 INFO L477 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 9 treesize of output 8 [2018-11-10 10:26:21,820 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:22,025 INFO L477 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 67 treesize of output 60 [2018-11-10 10:26:22,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 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-11-10 10:26:22,033 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:22,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:22,092 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:22,127 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:22,136 INFO L477 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 46 [2018-11-10 10:26:22,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:22,143 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:22,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:22,172 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:22,192 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:22,201 INFO L477 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 57 treesize of output 50 [2018-11-10 10:26:22,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:22,208 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:22,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 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-11-10 10:26:22,246 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:22,269 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:22,277 INFO L477 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 45 [2018-11-10 10:26:22,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:22,284 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:22,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-10 10:26:22,313 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:22,345 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:22,358 INFO L477 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 60 treesize of output 55 [2018-11-10 10:26:22,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-10 10:26:22,365 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:22,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:22,414 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:22,449 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:22,460 INFO L477 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 61 treesize of output 58 [2018-11-10 10:26:22,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 10:26:22,472 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:22,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:22,517 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:22,544 INFO L267 ElimStorePlain]: Start of recursive call 51: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:22,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-11-10 10:26:22,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:22,558 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:22,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-10 10:26:22,585 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:22,610 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:22,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-11-10 10:26:22,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:22,643 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:22,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-10 10:26:22,684 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:22,723 INFO L267 ElimStorePlain]: Start of recursive call 57: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:23,144 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-11-10 10:26:23,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 106 [2018-11-10 10:26:23,522 WARN L179 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2018-11-10 10:26:23,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-10 10:26:23,538 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:23,549 INFO L477 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 19 treesize of output 16 [2018-11-10 10:26:23,549 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:23,562 INFO L477 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 26 treesize of output 23 [2018-11-10 10:26:23,563 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:23,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 26 [2018-11-10 10:26:23,568 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:23,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-10 10:26:23,578 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:23,802 INFO L477 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 47 treesize of output 47 [2018-11-10 10:26:23,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 10:26:23,808 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:23,848 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:23,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-11-10 10:26:23,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:23,858 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:23,881 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:23,887 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2018-11-10 10:26:23,896 INFO L477 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 39 treesize of output 27 [2018-11-10 10:26:23,896 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:23,936 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:23,946 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-11-10 10:26:23,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2018-11-10 10:26:23,951 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:23,977 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:23,983 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-11-10 10:26:23,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2018-11-10 10:26:23,988 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:24,020 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:24,026 INFO L477 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 50 treesize of output 46 [2018-11-10 10:26:24,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2018-11-10 10:26:24,032 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:24,061 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:24,240 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-10 10:26:24,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 119 treesize of output 80 [2018-11-10 10:26:24,405 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-10 10:26:24,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:26:24,416 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:24,562 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2018-11-10 10:26:24,568 INFO L477 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 39 treesize of output 27 [2018-11-10 10:26:24,569 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:24,601 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:24,607 INFO L477 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 50 treesize of output 46 [2018-11-10 10:26:24,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2018-11-10 10:26:24,614 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:24,642 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:24,647 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-11-10 10:26:24,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2018-11-10 10:26:24,655 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:24,696 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:24,706 INFO L477 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 47 treesize of output 47 [2018-11-10 10:26:24,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 10:26:24,716 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:24,750 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:24,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-11-10 10:26:24,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:24,761 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:24,789 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:24,913 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-10 10:26:24,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 128 [2018-11-10 10:26:25,564 WARN L179 SmtUtils]: Spent 571.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-11-10 10:26:25,564 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 10:26:25,566 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 10:26:25,568 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 10:26:25,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 67 [2018-11-10 10:26:25,585 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:25,601 INFO L477 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 67 treesize of output 68 [2018-11-10 10:26:25,601 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:25,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 64 [2018-11-10 10:26:25,611 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:25,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 64 [2018-11-10 10:26:25,624 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:25,631 INFO L477 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 57 treesize of output 58 [2018-11-10 10:26:25,631 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:25,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 74 [2018-11-10 10:26:25,642 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:25,657 INFO L477 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 70 treesize of output 71 [2018-11-10 10:26:25,657 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:25,663 INFO L477 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 58 treesize of output 57 [2018-11-10 10:26:25,663 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:25,670 INFO L477 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 68 treesize of output 67 [2018-11-10 10:26:25,670 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:26,867 INFO L477 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 68 treesize of output 67 [2018-11-10 10:26:26,867 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:26,873 INFO L477 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 58 treesize of output 57 [2018-11-10 10:26:26,874 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:26,879 INFO L477 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 57 treesize of output 56 [2018-11-10 10:26:26,880 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:26,886 INFO L477 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 64 treesize of output 63 [2018-11-10 10:26:26,886 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:26,894 INFO L477 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 71 treesize of output 70 [2018-11-10 10:26:26,895 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:28,013 INFO L477 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 0 case distinctions, treesize of input 63 treesize of output 53 [2018-11-10 10:26:28,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:28,019 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:28,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-10 10:26:28,059 INFO L267 ElimStorePlain]: Start of recursive call 107: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:28,099 INFO L267 ElimStorePlain]: Start of recursive call 105: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:28,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 60 [2018-11-10 10:26:28,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:28,134 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:28,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-10 10:26:28,197 INFO L267 ElimStorePlain]: Start of recursive call 110: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:28,242 INFO L267 ElimStorePlain]: Start of recursive call 108: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:28,252 INFO L477 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-11-10 10:26:28,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-10 10:26:28,259 INFO L267 ElimStorePlain]: Start of recursive call 112: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:28,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:28,302 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:28,329 INFO L267 ElimStorePlain]: Start of recursive call 111: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:28,339 INFO L477 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 57 treesize of output 53 [2018-11-10 10:26:28,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:28,347 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:28,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:28,413 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:28,462 INFO L267 ElimStorePlain]: Start of recursive call 114: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:28,477 INFO L477 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 67 treesize of output 61 [2018-11-10 10:26:28,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:28,485 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:28,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 10:26:28,558 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:28,597 INFO L267 ElimStorePlain]: Start of recursive call 117: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:29,861 INFO L477 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 62 [2018-11-10 10:26:29,875 INFO L477 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 25 treesize of output 14 [2018-11-10 10:26:29,875 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:29,925 INFO L267 ElimStorePlain]: Start of recursive call 120: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:29,935 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-11-10 10:26:29,945 INFO L477 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 44 treesize of output 33 [2018-11-10 10:26:29,946 INFO L267 ElimStorePlain]: Start of recursive call 123: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:29,981 INFO L267 ElimStorePlain]: Start of recursive call 122: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:29,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-11-10 10:26:29,995 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:26:29,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 8 [2018-11-10 10:26:29,997 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:30,037 INFO L267 ElimStorePlain]: Start of recursive call 124: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:30,042 INFO L477 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 57 treesize of output 49 [2018-11-10 10:26:30,053 INFO L477 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 39 treesize of output 30 [2018-11-10 10:26:30,053 INFO L267 ElimStorePlain]: Start of recursive call 127: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:30,087 INFO L267 ElimStorePlain]: Start of recursive call 126: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:30,108 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2018-11-10 10:26:30,119 INFO L477 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 44 treesize of output 33 [2018-11-10 10:26:30,120 INFO L267 ElimStorePlain]: Start of recursive call 129: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:30,180 INFO L267 ElimStorePlain]: Start of recursive call 128: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:31,131 INFO L477 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 56 treesize of output 54 [2018-11-10 10:26:31,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-11-10 10:26:31,137 INFO L267 ElimStorePlain]: Start of recursive call 131: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:31,229 INFO L477 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 33 [2018-11-10 10:26:31,230 INFO L267 ElimStorePlain]: Start of recursive call 132: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:31,303 INFO L267 ElimStorePlain]: Start of recursive call 130: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 10:26:31,337 INFO L477 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 70 treesize of output 66 [2018-11-10 10:26:31,348 INFO L477 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 57 treesize of output 43 [2018-11-10 10:26:31,349 INFO L267 ElimStorePlain]: Start of recursive call 134: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:31,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2018-11-10 10:26:31,494 INFO L267 ElimStorePlain]: Start of recursive call 135: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:31,633 INFO L267 ElimStorePlain]: Start of recursive call 133: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 10:26:31,661 INFO L477 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 1 case distinctions, treesize of input 63 treesize of output 59 [2018-11-10 10:26:31,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-10 10:26:31,667 INFO L267 ElimStorePlain]: Start of recursive call 137: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:31,756 INFO L477 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 50 treesize of output 36 [2018-11-10 10:26:31,757 INFO L267 ElimStorePlain]: Start of recursive call 138: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:31,848 INFO L267 ElimStorePlain]: Start of recursive call 136: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 10:26:33,273 INFO L267 ElimStorePlain]: Start of recursive call 90: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 12 dim-0 vars, and 14 xjuncts. [2018-11-10 10:26:33,300 INFO L477 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 176 treesize of output 121 [2018-11-10 10:26:33,715 WARN L179 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2018-11-10 10:26:33,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:26:33,724 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:33,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-11-10 10:26:33,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:33,994 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:34,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-10 10:26:34,046 INFO L267 ElimStorePlain]: Start of recursive call 143: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:34,087 INFO L267 ElimStorePlain]: Start of recursive call 141: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:34,097 INFO L477 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 57 treesize of output 50 [2018-11-10 10:26:34,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:34,103 INFO L267 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:34,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-10 10:26:34,150 INFO L267 ElimStorePlain]: Start of recursive call 146: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:34,182 INFO L267 ElimStorePlain]: Start of recursive call 144: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:34,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-11-10 10:26:34,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:34,209 INFO L267 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:34,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-10 10:26:34,256 INFO L267 ElimStorePlain]: Start of recursive call 149: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:34,286 INFO L267 ElimStorePlain]: Start of recursive call 147: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:34,301 INFO L477 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 57 treesize of output 50 [2018-11-10 10:26:34,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:34,308 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:34,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-10 10:26:34,347 INFO L267 ElimStorePlain]: Start of recursive call 152: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:34,394 INFO L267 ElimStorePlain]: Start of recursive call 150: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:34,404 INFO L477 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 45 [2018-11-10 10:26:34,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:34,409 INFO L267 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:34,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-10 10:26:34,450 INFO L267 ElimStorePlain]: Start of recursive call 155: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:34,478 INFO L267 ElimStorePlain]: Start of recursive call 153: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:34,489 INFO L477 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 67 treesize of output 60 [2018-11-10 10:26:34,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:34,498 INFO L267 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:34,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-10 10:26:34,561 INFO L267 ElimStorePlain]: Start of recursive call 158: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:34,592 INFO L267 ElimStorePlain]: Start of recursive call 156: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:34,607 INFO L477 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 51 treesize of output 50 [2018-11-10 10:26:34,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:34,614 INFO L267 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:34,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:34,655 INFO L267 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:34,680 INFO L267 ElimStorePlain]: Start of recursive call 159: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:34,693 INFO L477 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 67 treesize of output 60 [2018-11-10 10:26:34,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:34,702 INFO L267 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:34,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-10 10:26:34,764 INFO L267 ElimStorePlain]: Start of recursive call 164: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:34,814 INFO L267 ElimStorePlain]: Start of recursive call 162: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:34,827 INFO L477 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 61 treesize of output 58 [2018-11-10 10:26:34,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:34,835 INFO L267 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:34,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 10:26:34,890 INFO L267 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:34,940 INFO L267 ElimStorePlain]: Start of recursive call 165: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:34,949 INFO L477 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 60 treesize of output 55 [2018-11-10 10:26:34,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:34,966 INFO L267 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:35,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-10 10:26:35,022 INFO L267 ElimStorePlain]: Start of recursive call 170: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:35,072 INFO L267 ElimStorePlain]: Start of recursive call 168: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:36,050 INFO L267 ElimStorePlain]: Start of recursive call 139: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 21 dim-0 vars, and 24 xjuncts. [2018-11-10 10:26:36,077 INFO L477 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 141 treesize of output 102 [2018-11-10 10:26:36,346 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-10 10:26:36,354 INFO L477 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 9 treesize of output 8 [2018-11-10 10:26:36,354 INFO L267 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:36,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-11-10 10:26:36,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:36,703 INFO L267 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:36,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-10 10:26:36,775 INFO L267 ElimStorePlain]: Start of recursive call 175: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:36,824 INFO L267 ElimStorePlain]: Start of recursive call 173: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:36,840 INFO L477 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 61 treesize of output 58 [2018-11-10 10:26:36,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:36,849 INFO L267 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:36,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 10:26:36,907 INFO L267 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:36,946 INFO L267 ElimStorePlain]: Start of recursive call 176: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:36,964 INFO L477 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 57 treesize of output 50 [2018-11-10 10:26:36,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:36,974 INFO L267 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:37,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 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-11-10 10:26:37,015 INFO L267 ElimStorePlain]: Start of recursive call 181: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:37,047 INFO L267 ElimStorePlain]: Start of recursive call 179: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:37,060 INFO L477 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 60 treesize of output 55 [2018-11-10 10:26:37,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:37,069 INFO L267 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:37,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-10 10:26:37,118 INFO L267 ElimStorePlain]: Start of recursive call 184: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:37,155 INFO L267 ElimStorePlain]: Start of recursive call 182: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:37,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-11-10 10:26:37,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:37,176 INFO L267 ElimStorePlain]: Start of recursive call 186: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:37,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-10 10:26:37,227 INFO L267 ElimStorePlain]: Start of recursive call 187: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:37,266 INFO L267 ElimStorePlain]: Start of recursive call 185: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:37,288 INFO L477 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 67 treesize of output 60 [2018-11-10 10:26:37,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:37,304 INFO L267 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:37,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 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-11-10 10:26:37,405 INFO L267 ElimStorePlain]: Start of recursive call 190: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:37,452 INFO L267 ElimStorePlain]: Start of recursive call 188: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:37,468 INFO L477 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 45 [2018-11-10 10:26:37,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:37,477 INFO L267 ElimStorePlain]: Start of recursive call 192: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:37,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-10 10:26:37,525 INFO L267 ElimStorePlain]: Start of recursive call 193: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:37,557 INFO L267 ElimStorePlain]: Start of recursive call 191: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:37,569 INFO L477 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 46 [2018-11-10 10:26:37,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:37,577 INFO L267 ElimStorePlain]: Start of recursive call 195: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:37,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:37,629 INFO L267 ElimStorePlain]: Start of recursive call 196: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:37,661 INFO L267 ElimStorePlain]: Start of recursive call 194: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:38,250 INFO L267 ElimStorePlain]: Start of recursive call 171: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-11-10 10:26:38,278 INFO L477 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 138 treesize of output 99 [2018-11-10 10:26:38,422 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-10 10:26:38,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:26:38,429 INFO L267 ElimStorePlain]: Start of recursive call 198: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:38,631 INFO L477 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 67 treesize of output 60 [2018-11-10 10:26:38,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:38,640 INFO L267 ElimStorePlain]: Start of recursive call 200: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:38,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-10 10:26:38,707 INFO L267 ElimStorePlain]: Start of recursive call 201: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:38,761 INFO L267 ElimStorePlain]: Start of recursive call 199: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:38,772 INFO L477 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 46 [2018-11-10 10:26:38,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:38,779 INFO L267 ElimStorePlain]: Start of recursive call 203: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:38,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:38,817 INFO L267 ElimStorePlain]: Start of recursive call 204: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:38,841 INFO L267 ElimStorePlain]: Start of recursive call 202: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:38,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-11-10 10:26:38,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:38,858 INFO L267 ElimStorePlain]: Start of recursive call 206: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:38,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-10 10:26:38,891 INFO L267 ElimStorePlain]: Start of recursive call 207: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:38,916 INFO L267 ElimStorePlain]: Start of recursive call 205: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:38,934 INFO L477 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 61 treesize of output 58 [2018-11-10 10:26:38,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 10:26:38,945 INFO L267 ElimStorePlain]: Start of recursive call 209: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:39,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:39,022 INFO L267 ElimStorePlain]: Start of recursive call 210: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:39,088 INFO L267 ElimStorePlain]: Start of recursive call 208: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:39,106 INFO L477 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 45 [2018-11-10 10:26:39,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:39,115 INFO L267 ElimStorePlain]: Start of recursive call 212: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:39,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-10 10:26:39,156 INFO L267 ElimStorePlain]: Start of recursive call 213: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:39,189 INFO L267 ElimStorePlain]: Start of recursive call 211: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:39,199 INFO L477 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 57 treesize of output 50 [2018-11-10 10:26:39,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:39,206 INFO L267 ElimStorePlain]: Start of recursive call 215: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:39,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-10 10:26:39,248 INFO L267 ElimStorePlain]: Start of recursive call 216: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:39,289 INFO L267 ElimStorePlain]: Start of recursive call 214: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:39,303 INFO L477 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 60 treesize of output 55 [2018-11-10 10:26:39,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:39,313 INFO L267 ElimStorePlain]: Start of recursive call 218: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:39,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-10 10:26:39,362 INFO L267 ElimStorePlain]: Start of recursive call 219: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:39,423 INFO L267 ElimStorePlain]: Start of recursive call 217: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:39,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-11-10 10:26:39,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-10 10:26:39,448 INFO L267 ElimStorePlain]: Start of recursive call 221: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:39,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:39,520 INFO L267 ElimStorePlain]: Start of recursive call 222: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:39,569 INFO L267 ElimStorePlain]: Start of recursive call 220: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:39,981 INFO L267 ElimStorePlain]: Start of recursive call 197: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-11-10 10:26:40,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 106 [2018-11-10 10:26:40,600 WARN L179 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-10 10:26:40,608 INFO L477 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 68 treesize of output 67 [2018-11-10 10:26:40,608 INFO L267 ElimStorePlain]: Start of recursive call 224: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:40,617 INFO L477 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 71 treesize of output 70 [2018-11-10 10:26:40,617 INFO L267 ElimStorePlain]: Start of recursive call 225: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:40,622 INFO L477 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 61 treesize of output 60 [2018-11-10 10:26:40,623 INFO L267 ElimStorePlain]: Start of recursive call 226: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:40,630 INFO L477 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 74 treesize of output 73 [2018-11-10 10:26:40,631 INFO L267 ElimStorePlain]: Start of recursive call 227: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:40,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-11-10 10:26:40,637 INFO L267 ElimStorePlain]: Start of recursive call 228: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:40,644 INFO L477 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 67 treesize of output 66 [2018-11-10 10:26:40,645 INFO L267 ElimStorePlain]: Start of recursive call 229: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:40,651 INFO L477 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 54 treesize of output 53 [2018-11-10 10:26:40,651 INFO L267 ElimStorePlain]: Start of recursive call 230: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:40,657 INFO L477 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 57 treesize of output 56 [2018-11-10 10:26:40,657 INFO L267 ElimStorePlain]: Start of recursive call 231: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:41,437 INFO L477 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 58 treesize of output 57 [2018-11-10 10:26:41,437 INFO L267 ElimStorePlain]: Start of recursive call 232: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:41,445 INFO L477 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 60 treesize of output 61 [2018-11-10 10:26:41,446 INFO L267 ElimStorePlain]: Start of recursive call 233: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:41,455 INFO L477 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 53 treesize of output 54 [2018-11-10 10:26:41,455 INFO L267 ElimStorePlain]: Start of recursive call 234: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:42,070 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-11-10 10:26:42,080 INFO L477 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 44 treesize of output 33 [2018-11-10 10:26:42,081 INFO L267 ElimStorePlain]: Start of recursive call 236: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:42,117 INFO L267 ElimStorePlain]: Start of recursive call 235: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:42,123 INFO L477 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 57 treesize of output 49 [2018-11-10 10:26:42,132 INFO L477 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 39 treesize of output 30 [2018-11-10 10:26:42,132 INFO L267 ElimStorePlain]: Start of recursive call 238: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:42,168 INFO L267 ElimStorePlain]: Start of recursive call 237: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:42,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-11-10 10:26:42,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-10 10:26:42,186 INFO L267 ElimStorePlain]: Start of recursive call 240: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:42,225 INFO L267 ElimStorePlain]: Start of recursive call 239: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:42,769 INFO L477 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-11-10 10:26:42,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:42,776 INFO L267 ElimStorePlain]: Start of recursive call 242: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:42,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-10 10:26:42,818 INFO L267 ElimStorePlain]: Start of recursive call 243: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:42,852 INFO L267 ElimStorePlain]: Start of recursive call 241: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:42,876 INFO L477 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 50 treesize of output 54 [2018-11-10 10:26:42,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-11-10 10:26:42,884 INFO L267 ElimStorePlain]: Start of recursive call 245: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:42,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-11-10 10:26:42,998 INFO L267 ElimStorePlain]: Start of recursive call 246: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:43,094 INFO L477 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 46 treesize of output 34 [2018-11-10 10:26:43,094 INFO L267 ElimStorePlain]: Start of recursive call 247: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:43,145 INFO L267 ElimStorePlain]: Start of recursive call 244: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:26:43,154 INFO L477 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 60 treesize of output 50 [2018-11-10 10:26:43,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:26:43,159 INFO L267 ElimStorePlain]: Start of recursive call 249: End of recursive call: and 1 xjuncts. [2018-11-10 10:26:43,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-10 10:26:43,195 INFO L267 ElimStorePlain]: Start of recursive call 250: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:43,238 INFO L267 ElimStorePlain]: Start of recursive call 248: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:43,659 INFO L477 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 56 treesize of output 54 [2018-11-10 10:26:43,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-11-10 10:26:43,666 INFO L267 ElimStorePlain]: Start of recursive call 252: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:43,769 INFO L477 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 33 [2018-11-10 10:26:43,770 INFO L267 ElimStorePlain]: Start of recursive call 253: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:43,831 INFO L267 ElimStorePlain]: Start of recursive call 251: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 10:26:43,854 INFO L477 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 60 treesize of output 56 [2018-11-10 10:26:43,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-11-10 10:26:43,861 INFO L267 ElimStorePlain]: Start of recursive call 255: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:43,936 INFO L477 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 47 treesize of output 33 [2018-11-10 10:26:43,937 INFO L267 ElimStorePlain]: Start of recursive call 256: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:26:44,015 INFO L267 ElimStorePlain]: Start of recursive call 254: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 10:26:44,601 INFO L267 ElimStorePlain]: Start of recursive call 223: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 8 dim-0 vars, and 9 xjuncts. [2018-11-10 10:28:06,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 462 dim-0 vars, and 85 xjuncts. [2018-11-10 10:28:06,428 INFO L202 ElimStorePlain]: Needed 256 recursive calls to eliminate 7 variables, input treesize:213, output treesize:5882 [2018-11-10 10:28:08,618 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_main_write~$Pointer$_#ptr.base| c_main_~x~0.base)) (.cse0 (= c_main_~x~0.offset |c_main_write~$Pointer$_#ptr.offset|))) (let ((.cse69 (not .cse0)) (.cse8 (not .cse1)) (.cse80 (= |c_main_write~$Pointer$_#value.base| c_main_~x~0.base))) (and (or .cse0 .cse1 (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_prenex_70 (_ BitVec 32)) (v_prenex_71 (_ BitVec 32)) (v_prenex_67 (_ BitVec 32)) (v_prenex_68 (_ BitVec 32)) (v_prenex_69 (_ BitVec 32))) (let ((.cse4 (bvadd v_prenex_71 (_ bv8 32))) (.cse6 (bvadd v_prenex_67 v_prenex_71)) (.cse2 (bvadd v_prenex_71 (_ bv4 32))) (.cse3 (store |c_#length| v_prenex_69 v_prenex_68)) (.cse5 (bvadd v_prenex_71 (_ bv12 32))) (.cse7 (select |c_#length| v_arrayElimCell_32))) (or (bvsle .cse2 (select .cse3 v_arrayElimCell_32)) (not (bvsle .cse4 .cse5)) (not (bvsle .cse6 .cse7)) (not (= (select |c_#valid| v_prenex_69) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse4)) (not (bvsle v_prenex_71 .cse6)) (bvsle .cse2 (select .cse3 v_prenex_70)) (not (bvsle .cse5 .cse7)) (= v_arrayElimCell_32 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_71)))))) (or .cse0 .cse8 (forall ((v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_317 (_ BitVec 32)) (v_prenex_316 (_ BitVec 32)) (v_prenex_315 (_ BitVec 32)) (v_prenex_314 (_ BitVec 32))) (let ((.cse11 (select |c_#length| v_arrayElimCell_112)) (.cse9 (bvadd v_prenex_315 (_ bv8 32))) (.cse10 (bvadd v_prenex_315 (_ bv12 32))) (.cse12 (bvadd v_prenex_317 v_prenex_315))) (or (not (bvsle (_ bv0 32) .cse9)) (bvsle (bvadd v_prenex_315 (_ bv4 32)) (select (store |c_#length| v_prenex_314 v_prenex_316) v_arrayElimCell_112)) (not (= (select |c_#valid| v_prenex_314) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_315)) (not (bvsle .cse10 .cse11)) (not (bvsle .cse12 .cse11)) (not (bvsle .cse9 .cse10)) (not (bvsle v_prenex_315 .cse12)))))) (or .cse0 .cse1 (forall ((v_prenex_63 (_ BitVec 32)) (v_prenex_64 (_ BitVec 32)) (v_prenex_65 (_ BitVec 32)) (v_prenex_66 (_ BitVec 32)) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse13 (bvadd v_prenex_63 v_prenex_66)) (.cse15 (select |c_#length| v_arrayElimCell_176)) (.cse14 (bvadd v_prenex_66 (_ bv8 32))) (.cse16 (bvadd v_prenex_66 (_ bv12 32)))) (or (not (= (select |c_#valid| v_prenex_65) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_66)) (not (bvsle v_prenex_66 .cse13)) (not (bvsle (_ bv0 32) .cse14)) (bvsle (bvadd v_prenex_66 (_ bv4 32)) (select (store |c_#length| v_prenex_65 v_prenex_64) v_arrayElimCell_176)) (not (bvsle .cse13 .cse15)) (not (bvsle .cse16 .cse15)) (not (bvsle .cse14 .cse16)))))) (or .cse0 .cse8 (forall ((v_arrayElimCell_205 (_ BitVec 32)) (v_prenex_113 (_ BitVec 32)) (v_prenex_112 (_ BitVec 32)) (v_prenex_111 (_ BitVec 32)) (v_prenex_110 (_ BitVec 32))) (let ((.cse19 (bvadd v_prenex_112 (_ bv8 32))) (.cse17 (bvadd v_prenex_110 v_prenex_112)) (.cse20 (bvadd v_prenex_112 (_ bv12 32))) (.cse18 (select |c_#length| v_arrayElimCell_205))) (or (not (bvsle .cse17 .cse18)) (not (bvsle .cse19 .cse20)) (not (bvsle (_ bv0 32) .cse19)) (not (bvsle (_ bv0 32) v_prenex_112)) (not (= (select |c_#valid| v_prenex_111) (_ bv0 1))) (bvsle (bvadd v_prenex_112 (_ bv4 32)) (select (store |c_#length| v_prenex_111 v_prenex_113) v_arrayElimCell_205)) (not (bvsle v_prenex_112 .cse17)) (not (bvsle .cse20 .cse18)) (= v_arrayElimCell_205 c_main_~x~0.base))))) (or .cse0 .cse1 (forall ((v_prenex_373 (_ BitVec 32)) (v_prenex_372 (_ BitVec 32)) (v_prenex_371 (_ BitVec 32)) (v_arrayElimCell_159 (_ BitVec 32)) (v_prenex_375 (_ BitVec 32)) (v_prenex_374 (_ BitVec 32))) (let ((.cse22 (select |c_#length| v_arrayElimCell_159)) (.cse25 (bvadd v_prenex_374 (_ bv8 32))) (.cse26 (bvadd v_prenex_374 (_ bv12 32))) (.cse21 (bvadd v_prenex_375 v_prenex_374)) (.cse23 (bvadd v_prenex_374 (_ bv4 32))) (.cse24 (store |c_#length| v_prenex_373 v_prenex_372))) (or (not (bvsle .cse21 .cse22)) (bvsle .cse23 (select .cse24 v_prenex_371)) (not (bvsle (_ bv0 32) .cse25)) (= v_arrayElimCell_159 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_373) (_ bv0 1))) (not (bvsle .cse26 .cse22)) (not (bvsle .cse25 .cse26)) (not (bvsle v_prenex_374 .cse21)) (not (bvsle (_ bv0 32) v_prenex_374)) (bvsle .cse23 (select .cse24 v_arrayElimCell_159)))))) (or .cse0 (forall ((v_prenex_80 (_ BitVec 32)) (v_prenex_81 (_ BitVec 32)) (v_arrayElimCell_77 (_ BitVec 32)) (v_prenex_77 (_ BitVec 32)) (v_prenex_78 (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (let ((.cse27 (bvadd v_prenex_80 (_ bv8 32))) (.cse29 (bvadd v_prenex_77 v_prenex_80)) (.cse31 (bvadd v_prenex_80 (_ bv4 32))) (.cse32 (store |c_#length| v_prenex_78 v_prenex_81)) (.cse28 (bvadd v_prenex_80 (_ bv12 32))) (.cse30 (select |c_#length| v_arrayElimCell_77))) (or (not (bvsle (_ bv0 32) v_prenex_80)) (not (= (select |c_#valid| v_prenex_78) (_ bv0 1))) (= v_arrayElimCell_77 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse27)) (not (bvsle .cse27 .cse28)) (not (bvsle .cse29 .cse30)) (bvsle .cse31 (select .cse32 v_arrayElimCell_77)) (not (bvsle v_prenex_80 .cse29)) (bvsle .cse31 (select .cse32 v_prenex_79)) (not (bvsle .cse28 .cse30))))) .cse1) (or .cse0 .cse1 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_prenex_291 (_ BitVec 32)) (v_prenex_290 (_ BitVec 32)) (v_prenex_289 (_ BitVec 32)) (v_prenex_288 (_ BitVec 32)) (v_prenex_287 (_ BitVec 32))) (let ((.cse37 (select |c_#length| v_arrayElimCell_35)) (.cse36 (bvadd v_prenex_291 v_prenex_289)) (.cse35 (bvadd v_prenex_289 (_ bv8 32))) (.cse38 (bvadd v_prenex_289 (_ bv12 32))) (.cse33 (bvadd v_prenex_289 (_ bv4 32))) (.cse34 (store |c_#length| v_prenex_287 v_prenex_290))) (or (bvsle .cse33 (select .cse34 v_arrayElimCell_35)) (not (bvsle (_ bv0 32) .cse35)) (not (bvsle .cse36 .cse37)) (not (bvsle .cse38 .cse37)) (not (bvsle v_prenex_289 .cse36)) (not (= (select |c_#valid| v_prenex_287) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_289)) (= v_arrayElimCell_35 c_main_~x~0.base) (not (bvsle .cse35 .cse38)) (bvsle .cse33 (select .cse34 v_prenex_288)))))) (or (forall ((v_prenex_319 (_ BitVec 32)) (v_prenex_318 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_prenex_322 (_ BitVec 32)) (v_prenex_321 (_ BitVec 32)) (v_prenex_320 (_ BitVec 32))) (let ((.cse39 (bvadd v_prenex_322 v_prenex_320)) (.cse42 (bvadd v_prenex_320 (_ bv12 32))) (.cse40 (select |c_#length| v_arrayElimCell_182)) (.cse41 (bvadd v_prenex_320 (_ bv8 32))) (.cse43 (bvadd v_prenex_320 (_ bv4 32))) (.cse44 (store |c_#length| v_prenex_318 v_prenex_321))) (or (not (bvsle .cse39 .cse40)) (not (bvsle .cse41 .cse42)) (not (= (select |c_#valid| v_prenex_318) (_ bv0 1))) (bvsle .cse43 (select .cse44 v_arrayElimCell_182)) (= v_arrayElimCell_182 c_main_~x~0.base) (not (bvsle v_prenex_320 .cse39)) (not (bvsle .cse42 .cse40)) (not (bvsle (_ bv0 32) v_prenex_320)) (not (bvsle (_ bv0 32) .cse41)) (bvsle .cse43 (select .cse44 v_prenex_319))))) .cse1) (or (forall ((v_arrayElimCell_66 (_ BitVec 32)) (v_prenex_339 (_ BitVec 32)) (v_prenex_338 (_ BitVec 32)) (v_prenex_337 (_ BitVec 32)) (v_prenex_336 (_ BitVec 32))) (let ((.cse45 (bvadd v_prenex_339 v_prenex_337)) (.cse46 (select |c_#length| v_arrayElimCell_66)) (.cse47 (bvadd v_prenex_337 (_ bv8 32))) (.cse48 (bvadd v_prenex_337 (_ bv12 32)))) (or (not (bvsle v_prenex_337 .cse45)) (not (bvsle .cse45 .cse46)) (not (= (select |c_#valid| v_prenex_336) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_337)) (not (bvsle (_ bv0 32) .cse47)) (bvsle (bvadd v_prenex_337 (_ bv4 32)) (select (store |c_#length| v_prenex_336 v_prenex_338) v_arrayElimCell_66)) (not (bvsle .cse48 .cse46)) (not (bvsle .cse47 .cse48))))) .cse0 .cse1) (or .cse0 .cse1 (forall ((v_arrayElimCell_167 (_ BitVec 32)) (v_prenex_142 (_ BitVec 32)) (v_prenex_141 (_ BitVec 32)) (v_prenex_140 (_ BitVec 32)) (v_prenex_144 (_ BitVec 32)) (v_prenex_143 (_ BitVec 32))) (let ((.cse52 (bvadd v_prenex_143 (_ bv12 32))) (.cse50 (select |c_#length| v_arrayElimCell_167)) (.cse49 (bvadd v_prenex_141 v_prenex_143)) (.cse51 (bvadd v_prenex_143 (_ bv8 32))) (.cse53 (bvadd v_prenex_143 (_ bv4 32))) (.cse54 (store |c_#length| v_prenex_140 v_prenex_144))) (or (not (bvsle .cse49 .cse50)) (not (bvsle .cse51 .cse52)) (bvsle .cse53 (select .cse54 v_arrayElimCell_167)) (not (bvsle .cse52 .cse50)) (not (bvsle v_prenex_143 .cse49)) (not (bvsle (_ bv0 32) .cse51)) (not (bvsle (_ bv0 32) v_prenex_143)) (not (= (select |c_#valid| v_prenex_140) (_ bv0 1))) (bvsle .cse53 (select .cse54 v_prenex_142)))))) (or .cse0 (forall ((v_prenex_186 (_ BitVec 32)) (v_prenex_189 (_ BitVec 32)) (v_prenex_13 (_ BitVec 32)) (v_prenex_188 (_ BitVec 32)) (v_prenex_187 (_ BitVec 32))) (let ((.cse55 (bvadd v_prenex_187 v_prenex_188)) (.cse57 (bvadd v_prenex_188 (_ bv12 32))) (.cse58 (select |c_#length| v_prenex_13)) (.cse56 (bvadd v_prenex_188 (_ bv8 32)))) (or (not (bvsle v_prenex_188 .cse55)) (not (bvsle .cse56 .cse57)) (not (bvsle .cse55 .cse58)) (not (bvsle (_ bv0 32) v_prenex_188)) (= v_prenex_13 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_186) (_ bv0 1))) (not (bvsle .cse57 .cse58)) (bvsle (bvadd v_prenex_188 (_ bv4 32)) (select (store |c_#length| v_prenex_186 v_prenex_189) v_prenex_13)) (not (bvsle (_ bv0 32) .cse56))))) .cse1) (or (forall ((v_prenex_104 (_ BitVec 32)) (v_prenex_103 (_ BitVec 32)) (v_prenex_102 (_ BitVec 32)) (v_prenex_101 (_ BitVec 32)) (v_prenex_100 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (let ((.cse59 (bvadd v_prenex_100 v_prenex_103)) (.cse61 (select |c_#length| v_arrayElimCell_155)) (.cse62 (bvadd v_prenex_103 (_ bv4 32))) (.cse63 (store |c_#length| v_prenex_101 v_prenex_104)) (.cse64 (bvadd v_prenex_103 (_ bv8 32))) (.cse60 (bvadd v_prenex_103 (_ bv12 32)))) (or (not (bvsle v_prenex_103 .cse59)) (not (bvsle .cse60 .cse61)) (not (bvsle .cse59 .cse61)) (bvsle .cse62 (select .cse63 v_prenex_102)) (not (bvsle (_ bv0 32) v_prenex_103)) (bvsle .cse62 (select .cse63 v_arrayElimCell_155)) (not (= (select |c_#valid| v_prenex_101) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse64)) (not (bvsle .cse64 .cse60))))) .cse1) (or .cse0 .cse8 (forall ((v_arrayElimCell_207 (_ BitVec 32)) (v_prenex_256 (_ BitVec 32)) (v_prenex_255 (_ BitVec 32)) (v_prenex_254 (_ BitVec 32)) (v_prenex_253 (_ BitVec 32))) (let ((.cse67 (bvadd v_prenex_254 (_ bv12 32))) (.cse65 (bvadd v_prenex_256 v_prenex_254)) (.cse68 (select |c_#length| v_arrayElimCell_207)) (.cse66 (bvadd v_prenex_254 (_ bv8 32)))) (or (not (bvsle v_prenex_254 .cse65)) (not (bvsle (_ bv0 32) v_prenex_254)) (not (bvsle .cse66 .cse67)) (not (= (select |c_#valid| v_prenex_253) (_ bv0 1))) (not (bvsle .cse67 .cse68)) (bvsle (bvadd v_prenex_254 (_ bv4 32)) (select (store |c_#length| v_prenex_253 v_prenex_255) v_arrayElimCell_207)) (not (bvsle .cse65 .cse68)) (not (bvsle (_ bv0 32) .cse66)))))) (or .cse8 .cse69 (forall ((v_prenex_361 (_ BitVec 32)) (v_prenex_360 (_ BitVec 32)) (v_prenex_359 (_ BitVec 32)) (v_prenex_358 (_ BitVec 32))) (let ((.cse72 (bvadd v_prenex_360 (_ bv12 32))) (.cse70 (bvadd v_prenex_361 v_prenex_360)) (.cse73 (select |c_#length| |c_main_write~$Pointer$_#value.base|)) (.cse71 (bvadd v_prenex_360 (_ bv8 32)))) (or (not (bvsle v_prenex_360 .cse70)) (not (bvsle .cse71 .cse72)) (not (bvsle .cse72 .cse73)) (not (bvsle (_ bv0 32) v_prenex_360)) (bvsle (bvadd v_prenex_360 (_ bv4 32)) (select (store |c_#length| v_prenex_359 v_prenex_358) |c_main_write~$Pointer$_#value.base|)) (not (= (select |c_#valid| v_prenex_359) (_ bv0 1))) (not (bvsle .cse70 .cse73)) (not (bvsle (_ bv0 32) .cse71)))))) (or (forall ((v_arrayElimCell_201 (_ BitVec 32)) (v_prenex_219 (_ BitVec 32)) (v_prenex_218 (_ BitVec 32)) (v_prenex_217 (_ BitVec 32)) (v_prenex_216 (_ BitVec 32)) (v_prenex_220 (_ BitVec 32))) (let ((.cse75 (bvadd v_prenex_218 (_ bv4 32))) (.cse76 (store |c_#length| v_prenex_216 v_prenex_219)) (.cse74 (bvadd v_prenex_220 v_prenex_218)) (.cse78 (select |c_#length| v_arrayElimCell_201)) (.cse79 (bvadd v_prenex_218 (_ bv8 32))) (.cse77 (bvadd v_prenex_218 (_ bv12 32)))) (or (not (bvsle v_prenex_218 .cse74)) (bvsle .cse75 (select .cse76 v_arrayElimCell_201)) (= v_arrayElimCell_201 c_main_~x~0.base) (bvsle .cse75 (select .cse76 v_prenex_217)) (not (bvsle (_ bv0 32) v_prenex_218)) (not (bvsle .cse77 .cse78)) (not (bvsle .cse74 .cse78)) (not (= (select |c_#valid| v_prenex_216) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse79)) (not (bvsle .cse79 .cse77))))) .cse1) (or .cse80 .cse0 .cse8 (forall ((v_prenex_340 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_343 (_ BitVec 32)) (v_prenex_342 (_ BitVec 32)) (v_prenex_341 (_ BitVec 32))) (let ((.cse81 (bvadd v_prenex_343 v_prenex_341)) (.cse83 (bvadd v_prenex_341 (_ bv8 32))) (.cse84 (bvadd v_prenex_341 (_ bv12 32))) (.cse82 (select |c_#length| v_arrayElimCell_109))) (or (bvsle (bvadd v_prenex_341 (_ bv4 32)) (select (store |c_#length| v_prenex_340 v_prenex_342) v_arrayElimCell_109)) (not (bvsle .cse81 .cse82)) (not (bvsle (_ bv0 32) .cse83)) (not (bvsle v_prenex_341 .cse81)) (not (bvsle (_ bv0 32) v_prenex_341)) (not (bvsle .cse83 .cse84)) (not (= (select |c_#valid| v_prenex_340) (_ bv0 1))) (= v_arrayElimCell_109 c_main_~x~0.base) (not (bvsle .cse84 .cse82)))))) (or .cse1 (forall ((v_prenex_263 (_ BitVec 32)) (v_prenex_262 (_ BitVec 32)) (v_prenex_261 (_ BitVec 32)) (v_arrayElimCell_133 (_ BitVec 32)) (v_prenex_264 (_ BitVec 32))) (let ((.cse86 (select |c_#length| v_arrayElimCell_133)) (.cse88 (bvadd v_prenex_264 v_prenex_262)) (.cse87 (bvadd v_prenex_262 (_ bv8 32))) (.cse85 (bvadd v_prenex_262 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_262)) (not (bvsle .cse85 .cse86)) (not (bvsle (_ bv0 32) .cse87)) (not (bvsle .cse88 .cse86)) (not (bvsle v_prenex_262 .cse88)) (= v_arrayElimCell_133 c_main_~x~0.base) (not (bvsle .cse87 .cse85)) (bvsle (bvadd v_prenex_262 (_ bv4 32)) (select (store |c_#length| v_prenex_261 v_prenex_263) v_arrayElimCell_133)) (not (= (select |c_#valid| v_prenex_261) (_ bv0 1))))))) (or .cse80 .cse0 .cse1 (forall ((v_arrayElimCell_125 (_ BitVec 32)) (v_prenex_234 (_ BitVec 32)) (v_prenex_233 (_ BitVec 32)) (v_prenex_232 (_ BitVec 32)) (v_prenex_231 (_ BitVec 32))) (let ((.cse90 (bvadd v_prenex_232 (_ bv12 32))) (.cse89 (bvadd v_prenex_232 (_ bv8 32))) (.cse91 (select |c_#length| v_arrayElimCell_125)) (.cse92 (bvadd v_prenex_234 v_prenex_232))) (or (not (= (select |c_#valid| v_prenex_231) (_ bv0 1))) (not (bvsle .cse89 .cse90)) (not (bvsle .cse90 .cse91)) (not (bvsle (_ bv0 32) .cse89)) (= v_arrayElimCell_125 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_232)) (not (bvsle .cse92 .cse91)) (bvsle (bvadd v_prenex_232 (_ bv4 32)) (select (store |c_#length| v_prenex_231 v_prenex_233) v_arrayElimCell_125)) (not (bvsle v_prenex_232 .cse92)))))) (or .cse0 .cse1 (forall ((v_prenex_274 (_ BitVec 32)) (v_arrayElimCell_102 (_ BitVec 32)) (v_prenex_277 (_ BitVec 32)) (v_prenex_276 (_ BitVec 32)) (v_prenex_275 (_ BitVec 32))) (let ((.cse94 (bvadd v_prenex_275 (_ bv12 32))) (.cse93 (bvadd v_prenex_275 (_ bv8 32))) (.cse95 (bvadd v_prenex_277 v_prenex_275)) (.cse96 (select |c_#length| v_arrayElimCell_102))) (or (not (bvsle .cse93 .cse94)) (not (bvsle v_prenex_275 .cse95)) (not (bvsle .cse94 .cse96)) (bvsle (bvadd v_prenex_275 (_ bv4 32)) (select (store |c_#length| v_prenex_274 v_prenex_276) v_arrayElimCell_102)) (not (bvsle (_ bv0 32) .cse93)) (not (= (select |c_#valid| v_prenex_274) (_ bv0 1))) (not (bvsle .cse95 .cse96)) (not (bvsle (_ bv0 32) v_prenex_275)))))) (or .cse80 .cse0 .cse1 (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_prenex_296 (_ BitVec 32)) (v_prenex_295 (_ BitVec 32)) (v_prenex_294 (_ BitVec 32)) (v_prenex_293 (_ BitVec 32)) (v_prenex_292 (_ BitVec 32))) (let ((.cse100 (select |c_#length| v_arrayElimCell_46)) (.cse99 (bvadd v_prenex_294 (_ bv12 32))) (.cse101 (bvadd v_prenex_296 v_prenex_294)) (.cse102 (bvadd v_prenex_294 (_ bv8 32))) (.cse97 (bvadd v_prenex_294 (_ bv4 32))) (.cse98 (store |c_#length| v_prenex_292 v_prenex_295))) (or (not (= (select |c_#valid| v_prenex_292) (_ bv0 1))) (bvsle .cse97 (select .cse98 v_arrayElimCell_46)) (not (bvsle (_ bv0 32) v_prenex_294)) (not (bvsle .cse99 .cse100)) (not (bvsle .cse101 .cse100)) (= v_arrayElimCell_46 c_main_~x~0.base) (not (bvsle .cse102 .cse99)) (not (bvsle v_prenex_294 .cse101)) (not (bvsle (_ bv0 32) .cse102)) (bvsle .cse97 (select .cse98 v_prenex_293)))))) (or .cse80 (forall ((v_prenex_370 (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_369 (_ BitVec 32)) (v_prenex_368 (_ BitVec 32)) (v_prenex_367 (_ BitVec 32))) (let ((.cse104 (bvadd v_prenex_369 (_ bv8 32))) (.cse103 (bvadd v_prenex_370 v_prenex_369)) (.cse105 (bvadd v_prenex_369 (_ bv12 32))) (.cse106 (select |c_#length| v_prenex_16))) (or (not (= (select |c_#valid| v_prenex_368) (_ bv0 1))) (= v_prenex_16 c_main_~x~0.base) (not (bvsle v_prenex_369 .cse103)) (not (bvsle .cse104 .cse105)) (bvsle (bvadd v_prenex_369 (_ bv4 32)) (select (store |c_#length| v_prenex_368 v_prenex_367) v_prenex_16)) (not (bvsle (_ bv0 32) .cse104)) (not (bvsle (_ bv0 32) v_prenex_369)) (not (bvsle .cse103 .cse106)) (not (bvsle .cse105 .cse106))))) .cse0 .cse1) (or (forall ((v_prenex_209 (_ BitVec 32)) (v_prenex_208 (_ BitVec 32)) (v_prenex_207 (_ BitVec 32)) (v_arrayElimCell_195 (_ BitVec 32)) (v_prenex_210 (_ BitVec 32))) (let ((.cse107 (bvadd v_prenex_210 v_prenex_208)) (.cse109 (select |c_#length| v_arrayElimCell_195)) (.cse108 (bvadd v_prenex_208 (_ bv8 32))) (.cse110 (bvadd v_prenex_208 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_208)) (not (bvsle v_prenex_208 .cse107)) (= v_arrayElimCell_195 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse108)) (not (bvsle .cse107 .cse109)) (bvsle (bvadd v_prenex_208 (_ bv4 32)) (select (store |c_#length| v_prenex_207 v_prenex_209) v_arrayElimCell_195)) (not (= (select |c_#valid| v_prenex_207) (_ bv0 1))) (not (bvsle .cse110 .cse109)) (not (bvsle .cse108 .cse110))))) .cse1) (or .cse0 .cse1 (forall ((v_prenex_84 (_ BitVec 32)) (v_prenex_85 (_ BitVec 32)) (v_arrayElimCell_49 (_ BitVec 32)) (v_prenex_82 (_ BitVec 32)) (v_prenex_83 (_ BitVec 32))) (let ((.cse113 (bvadd v_prenex_82 v_prenex_84)) (.cse112 (select |c_#length| v_arrayElimCell_49)) (.cse114 (bvadd v_prenex_84 (_ bv8 32))) (.cse111 (bvadd v_prenex_84 (_ bv12 32)))) (or (not (bvsle .cse111 .cse112)) (not (bvsle v_prenex_84 .cse113)) (not (bvsle .cse113 .cse112)) (= v_arrayElimCell_49 c_main_~x~0.base) (bvsle (bvadd v_prenex_84 (_ bv4 32)) (select (store |c_#length| v_prenex_83 v_prenex_85) v_arrayElimCell_49)) (not (bvsle (_ bv0 32) v_prenex_84)) (not (bvsle (_ bv0 32) .cse114)) (not (bvsle .cse114 .cse111)) (not (= (select |c_#valid| v_prenex_83) (_ bv0 1))))))) (or .cse0 .cse1 (forall ((v_prenex_348 (_ BitVec 32)) (v_prenex_347 (_ BitVec 32)) (v_prenex_346 (_ BitVec 32)) (v_prenex_345 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_344 (_ BitVec 32))) (let ((.cse117 (select |c_#length| v_prenex_4)) (.cse118 (bvadd v_prenex_346 (_ bv4 32))) (.cse119 (store |c_#length| v_prenex_344 v_prenex_347)) (.cse116 (bvadd v_prenex_348 v_prenex_346)) (.cse115 (bvadd v_prenex_346 (_ bv8 32))) (.cse120 (bvadd v_prenex_346 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_346)) (not (bvsle (_ bv0 32) .cse115)) (not (bvsle .cse116 .cse117)) (not (= (select |c_#valid| v_prenex_344) (_ bv0 1))) (bvsle .cse118 (select .cse119 v_prenex_345)) (not (bvsle .cse120 .cse117)) (bvsle .cse118 (select .cse119 v_prenex_4)) (not (bvsle v_prenex_346 .cse116)) (not (bvsle .cse115 .cse120)) (= v_prenex_4 c_main_~x~0.base))))) (or .cse80 .cse1 (forall ((v_prenex_409 (_ BitVec 32)) (v_prenex_408 (_ BitVec 32)) (v_prenex_407 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32)) (v_prenex_411 (_ BitVec 32)) (v_prenex_410 (_ BitVec 32))) (let ((.cse124 (bvadd v_prenex_411 v_prenex_410)) (.cse125 (select |c_#length| v_prenex_28)) (.cse121 (bvadd v_prenex_410 (_ bv4 32))) (.cse122 (store |c_#length| v_prenex_409 v_prenex_408)) (.cse123 (bvadd v_prenex_410 (_ bv8 32))) (.cse126 (bvadd v_prenex_410 (_ bv12 32)))) (or (bvsle .cse121 (select .cse122 v_prenex_28)) (not (bvsle (_ bv0 32) .cse123)) (not (= (select |c_#valid| v_prenex_409) (_ bv0 1))) (not (bvsle .cse124 .cse125)) (not (bvsle v_prenex_410 .cse124)) (not (bvsle .cse126 .cse125)) (bvsle .cse121 (select .cse122 v_prenex_407)) (not (bvsle .cse123 .cse126)) (not (bvsle (_ bv0 32) v_prenex_410)))))) (or .cse0 (forall ((v_arrayElimCell_170 (_ BitVec 32)) (v_prenex_202 (_ BitVec 32)) (v_prenex_201 (_ BitVec 32)) (v_prenex_200 (_ BitVec 32)) (v_prenex_199 (_ BitVec 32))) (let ((.cse127 (bvadd v_prenex_202 v_prenex_200)) (.cse129 (bvadd v_prenex_200 (_ bv12 32))) (.cse130 (select |c_#length| v_arrayElimCell_170)) (.cse128 (bvadd v_prenex_200 (_ bv8 32)))) (or (= v_arrayElimCell_170 c_main_~x~0.base) (not (bvsle v_prenex_200 .cse127)) (bvsle (bvadd v_prenex_200 (_ bv4 32)) (select (store |c_#length| v_prenex_199 v_prenex_201) v_arrayElimCell_170)) (not (bvsle .cse128 .cse129)) (not (bvsle .cse127 .cse130)) (not (= (select |c_#valid| v_prenex_199) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_200)) (not (bvsle .cse129 .cse130)) (not (bvsle (_ bv0 32) .cse128))))) .cse1) (or .cse1 (forall ((v_arrayElimCell_192 (_ BitVec 32)) (v_prenex_402 (_ BitVec 32)) (v_prenex_401 (_ BitVec 32)) (v_prenex_400 (_ BitVec 32)) (v_prenex_399 (_ BitVec 32))) (let ((.cse132 (bvadd v_prenex_401 (_ bv12 32))) (.cse134 (bvadd v_prenex_402 v_prenex_401)) (.cse133 (select |c_#length| v_arrayElimCell_192)) (.cse131 (bvadd v_prenex_401 (_ bv8 32)))) (or (not (bvsle .cse131 .cse132)) (not (bvsle (_ bv0 32) v_prenex_401)) (not (bvsle .cse132 .cse133)) (not (bvsle v_prenex_401 .cse134)) (bvsle (bvadd v_prenex_401 (_ bv4 32)) (select (store |c_#length| v_prenex_400 v_prenex_399) v_arrayElimCell_192)) (not (bvsle .cse134 .cse133)) (not (= (select |c_#valid| v_prenex_400) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse131)))))) (or .cse80 .cse1 (forall ((v_prenex_86 (_ BitVec 32)) (v_prenex_87 (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_88 (_ BitVec 32)) (v_prenex_23 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (let ((.cse135 (bvadd v_prenex_86 v_prenex_89)) (.cse137 (bvadd v_prenex_89 (_ bv4 32))) (.cse138 (store |c_#length| v_prenex_87 v_prenex_90)) (.cse139 (bvadd v_prenex_89 (_ bv8 32))) (.cse140 (bvadd v_prenex_89 (_ bv12 32))) (.cse136 (select |c_#length| v_prenex_23))) (or (not (bvsle .cse135 .cse136)) (= v_prenex_23 c_main_~x~0.base) (bvsle .cse137 (select .cse138 v_prenex_23)) (not (bvsle .cse139 .cse140)) (not (bvsle v_prenex_89 .cse135)) (bvsle .cse137 (select .cse138 v_prenex_88)) (not (bvsle (_ bv0 32) v_prenex_89)) (not (bvsle (_ bv0 32) .cse139)) (not (bvsle .cse140 .cse136)) (not (= (select |c_#valid| v_prenex_87) (_ bv0 1))))))) (or .cse80 .cse8 (forall ((v_prenex_268 (_ BitVec 32)) (v_prenex_267 (_ BitVec 32)) (v_prenex_266 (_ BitVec 32)) (v_prenex_265 (_ BitVec 32))) (let ((.cse143 (bvadd v_prenex_266 (_ bv8 32))) (.cse141 (bvadd v_prenex_266 (_ bv12 32))) (.cse144 (bvadd v_prenex_268 v_prenex_266)) (.cse142 (select |c_#length| |c_main_write~$Pointer$_#value.base|))) (or (not (bvsle .cse141 .cse142)) (not (= (select |c_#valid| v_prenex_265) (_ bv0 1))) (bvsle (bvadd v_prenex_266 (_ bv4 32)) (select (store |c_#length| v_prenex_265 v_prenex_267) |c_main_write~$Pointer$_#value.base|)) (not (bvsle (_ bv0 32) .cse143)) (not (bvsle (_ bv0 32) v_prenex_266)) (not (bvsle v_prenex_266 .cse144)) (not (bvsle .cse143 .cse141)) (not (bvsle .cse144 .cse142))))) .cse69) (or .cse0 .cse1 (forall ((v_prenex_273 (_ BitVec 32)) (v_prenex_272 (_ BitVec 32)) (v_prenex_271 (_ BitVec 32)) (v_prenex_270 (_ BitVec 32)) (v_prenex_269 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse145 (bvadd v_prenex_271 (_ bv12 32))) (.cse148 (bvadd v_prenex_271 (_ bv4 32))) (.cse149 (store |c_#length| v_prenex_269 v_prenex_272)) (.cse150 (bvadd v_prenex_271 (_ bv8 32))) (.cse147 (bvadd v_prenex_273 v_prenex_271)) (.cse146 (select |c_#length| v_prenex_11))) (or (not (bvsle .cse145 .cse146)) (not (= (select |c_#valid| v_prenex_269) (_ bv0 1))) (= v_prenex_11 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_271)) (not (bvsle v_prenex_271 .cse147)) (bvsle .cse148 (select .cse149 v_prenex_11)) (not (bvsle .cse150 .cse145)) (bvsle .cse148 (select .cse149 v_prenex_270)) (not (bvsle (_ bv0 32) .cse150)) (not (bvsle .cse147 .cse146)))))) (or .cse80 .cse0 .cse1 (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_126 (_ BitVec 32)) (v_prenex_125 (_ BitVec 32)) (v_prenex_124 (_ BitVec 32)) (v_prenex_123 (_ BitVec 32))) (let ((.cse151 (bvadd v_prenex_124 v_prenex_125)) (.cse152 (select |c_#length| v_prenex_15)) (.cse154 (bvadd v_prenex_125 (_ bv8 32))) (.cse153 (bvadd v_prenex_125 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_125)) (bvsle (bvadd v_prenex_125 (_ bv4 32)) (select (store |c_#length| v_prenex_123 v_prenex_126) v_prenex_15)) (not (bvsle v_prenex_125 .cse151)) (not (bvsle .cse151 .cse152)) (not (= (select |c_#valid| v_prenex_123) (_ bv0 1))) (not (bvsle .cse153 .cse152)) (not (bvsle (_ bv0 32) .cse154)) (not (bvsle .cse154 .cse153)))))) (or .cse0 .cse1 (forall ((v_prenex_194 (_ BitVec 32)) (v_prenex_193 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32)) (v_prenex_192 (_ BitVec 32)) (v_prenex_191 (_ BitVec 32)) (v_prenex_190 (_ BitVec 32))) (let ((.cse155 (bvadd v_prenex_192 (_ bv12 32))) (.cse159 (bvadd v_prenex_192 (_ bv8 32))) (.cse157 (bvadd v_prenex_192 (_ bv4 32))) (.cse158 (store |c_#length| v_prenex_190 v_prenex_193)) (.cse160 (bvadd v_prenex_194 v_prenex_192)) (.cse156 (select |c_#length| v_arrayElimCell_43))) (or (not (bvsle .cse155 .cse156)) (not (bvsle (_ bv0 32) v_prenex_192)) (bvsle .cse157 (select .cse158 v_arrayElimCell_43)) (= v_arrayElimCell_43 c_main_~x~0.base) (not (bvsle .cse159 .cse155)) (not (bvsle (_ bv0 32) .cse159)) (not (bvsle v_prenex_192 .cse160)) (not (= (select |c_#valid| v_prenex_190) (_ bv0 1))) (bvsle .cse157 (select .cse158 v_prenex_191)) (not (bvsle .cse160 .cse156)))))) (or (forall ((v_prenex_30 (_ BitVec 32)) (v_prenex_313 (_ BitVec 32)) (v_prenex_312 (_ BitVec 32)) (v_prenex_311 (_ BitVec 32)) (v_prenex_310 (_ BitVec 32))) (let ((.cse161 (bvadd v_prenex_313 v_prenex_311)) (.cse162 (select |c_#length| v_prenex_30)) (.cse163 (bvadd v_prenex_311 (_ bv8 32))) (.cse164 (bvadd v_prenex_311 (_ bv12 32)))) (or (= v_prenex_30 c_main_~x~0.base) (not (bvsle .cse161 .cse162)) (not (bvsle v_prenex_311 .cse161)) (not (= (select |c_#valid| v_prenex_310) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse163)) (not (bvsle (_ bv0 32) v_prenex_311)) (not (bvsle .cse164 .cse162)) (bvsle (bvadd v_prenex_311 (_ bv4 32)) (select (store |c_#length| v_prenex_310 v_prenex_312) v_prenex_30)) (not (bvsle .cse163 .cse164))))) .cse1) (or .cse0 (forall ((v_arrayElimCell_117 (_ BitVec 32)) (v_prenex_326 (_ BitVec 32)) (v_prenex_325 (_ BitVec 32)) (v_prenex_324 (_ BitVec 32)) (v_prenex_323 (_ BitVec 32))) (let ((.cse165 (bvadd v_prenex_324 (_ bv8 32))) (.cse168 (bvadd v_prenex_324 (_ bv12 32))) (.cse167 (select |c_#length| v_arrayElimCell_117)) (.cse166 (bvadd v_prenex_326 v_prenex_324))) (or (not (bvsle (_ bv0 32) .cse165)) (not (bvsle (_ bv0 32) v_prenex_324)) (not (bvsle .cse166 .cse167)) (bvsle (bvadd v_prenex_324 (_ bv4 32)) (select (store |c_#length| v_prenex_323 v_prenex_325) v_arrayElimCell_117)) (not (= (select |c_#valid| v_prenex_323) (_ bv0 1))) (not (bvsle .cse165 .cse168)) (not (bvsle .cse168 .cse167)) (not (bvsle v_prenex_324 .cse166))))) .cse1) (or .cse80 (forall ((v_prenex_27 (_ BitVec 32)) (v_prenex_300 (_ BitVec 32)) (v_prenex_299 (_ BitVec 32)) (v_prenex_298 (_ BitVec 32)) (v_prenex_297 (_ BitVec 32))) (let ((.cse169 (bvadd v_prenex_300 v_prenex_298)) (.cse172 (bvadd v_prenex_298 (_ bv12 32))) (.cse170 (select |c_#length| v_prenex_27)) (.cse171 (bvadd v_prenex_298 (_ bv8 32)))) (or (bvsle (bvadd v_prenex_298 (_ bv4 32)) (select (store |c_#length| v_prenex_297 v_prenex_299) v_prenex_27)) (not (= (select |c_#valid| v_prenex_297) (_ bv0 1))) (not (bvsle v_prenex_298 .cse169)) (not (bvsle .cse169 .cse170)) (not (bvsle (_ bv0 32) v_prenex_298)) (not (bvsle .cse171 .cse172)) (not (bvsle .cse172 .cse170)) (not (bvsle (_ bv0 32) .cse171)) (= v_prenex_27 c_main_~x~0.base)))) .cse1) (or .cse0 .cse1 (forall ((v_prenex_7 (_ BitVec 32)) (v_prenex_357 (_ BitVec 32)) (v_prenex_356 (_ BitVec 32)) (v_prenex_355 (_ BitVec 32)) (v_prenex_354 (_ BitVec 32)) (v_prenex_353 (_ BitVec 32))) (let ((.cse173 (bvadd v_prenex_356 (_ bv8 32))) (.cse174 (bvadd v_prenex_356 (_ bv12 32))) (.cse175 (bvadd v_prenex_356 (_ bv4 32))) (.cse176 (store |c_#length| v_prenex_355 v_prenex_354)) (.cse177 (bvadd v_prenex_357 v_prenex_356)) (.cse178 (select |c_#length| v_prenex_7))) (or (not (bvsle .cse173 .cse174)) (not (= (select |c_#valid| v_prenex_355) (_ bv0 1))) (bvsle .cse175 (select .cse176 v_prenex_7)) (= v_prenex_7 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse173)) (not (bvsle v_prenex_356 .cse177)) (not (bvsle .cse174 .cse178)) (not (bvsle (_ bv0 32) v_prenex_356)) (bvsle .cse175 (select .cse176 v_prenex_353)) (not (bvsle .cse177 .cse178)))))) (or .cse80 (forall ((v_prenex_51 (_ BitVec 32)) (v_prenex_52 (_ BitVec 32)) (v_prenex_50 (_ BitVec 32)) (v_prenex_49 (_ BitVec 32)) (v_prenex_33 (_ BitVec 32))) (let ((.cse180 (select |c_#length| v_prenex_33)) (.cse181 (bvadd v_prenex_49 v_prenex_52)) (.cse182 (bvadd v_prenex_52 (_ bv8 32))) (.cse179 (bvadd v_prenex_52 (_ bv12 32)))) (or (not (bvsle .cse179 .cse180)) (= v_prenex_33 c_main_~x~0.base) (not (bvsle .cse181 .cse180)) (not (bvsle v_prenex_52 .cse181)) (not (bvsle (_ bv0 32) .cse182)) (bvsle (bvadd v_prenex_52 (_ bv4 32)) (select (store |c_#length| v_prenex_50 v_prenex_51) v_prenex_33)) (not (= (select |c_#valid| v_prenex_50) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_52)) (not (bvsle .cse182 .cse179))))) .cse1) (or .cse1 (forall ((v_prenex_53 (_ BitVec 32)) (v_prenex_54 (_ BitVec 32)) (v_prenex_55 (_ BitVec 32)) (v_prenex_56 (_ BitVec 32)) (v_prenex_57 (_ BitVec 32))) (let ((.cse183 (bvadd v_prenex_57 (_ bv8 32))) (.cse184 (bvadd v_prenex_57 (_ bv12 32))) (.cse186 (bvadd v_prenex_53 v_prenex_57)) (.cse185 (select |c_#length| v_prenex_56))) (or (not (bvsle (_ bv0 32) .cse183)) (not (bvsle (_ bv0 32) v_prenex_57)) (not (bvsle .cse184 .cse185)) (bvsle (bvadd v_prenex_57 (_ bv4 32)) (select (store |c_#length| v_prenex_55 v_prenex_54) v_prenex_56)) (not (bvsle v_prenex_57 .cse186)) (not (bvsle .cse183 .cse184)) (not (= (select |c_#valid| v_prenex_55) (_ bv0 1))) (not (bvsle .cse186 .cse185)))))) (or .cse1 (forall ((v_prenex_109 (_ BitVec 32)) (v_prenex_108 (_ BitVec 32)) (v_prenex_107 (_ BitVec 32)) (v_prenex_106 (_ BitVec 32)) (v_prenex_26 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (let ((.cse187 (bvadd v_prenex_105 v_prenex_108)) (.cse189 (bvadd v_prenex_108 (_ bv8 32))) (.cse191 (bvadd v_prenex_108 (_ bv4 32))) (.cse192 (store |c_#length| v_prenex_106 v_prenex_109)) (.cse190 (bvadd v_prenex_108 (_ bv12 32))) (.cse188 (select |c_#length| v_prenex_26))) (or (not (bvsle .cse187 .cse188)) (not (= (select |c_#valid| v_prenex_106) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse189)) (not (bvsle (_ bv0 32) v_prenex_108)) (not (bvsle v_prenex_108 .cse187)) (not (bvsle .cse189 .cse190)) (bvsle .cse191 (select .cse192 v_prenex_26)) (bvsle .cse191 (select .cse192 v_prenex_107)) (not (bvsle .cse190 .cse188)))))) (or .cse80 (forall ((v_prenex_335 (_ BitVec 32)) (v_prenex_334 (_ BitVec 32)) (v_prenex_333 (_ BitVec 32)) (v_prenex_332 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse193 (bvadd v_prenex_333 (_ bv8 32))) (.cse194 (bvadd v_prenex_333 (_ bv12 32))) (.cse195 (select |c_#length| v_prenex_24)) (.cse196 (bvadd v_prenex_335 v_prenex_333))) (or (not (bvsle (_ bv0 32) .cse193)) (bvsle (bvadd v_prenex_333 (_ bv4 32)) (select (store |c_#length| v_prenex_332 v_prenex_334) v_prenex_24)) (not (= (select |c_#valid| v_prenex_332) (_ bv0 1))) (not (bvsle .cse194 .cse195)) (not (bvsle (_ bv0 32) v_prenex_333)) (not (bvsle .cse193 .cse194)) (not (bvsle .cse196 .cse195)) (not (bvsle v_prenex_333 .cse196))))) .cse1) (or (forall ((v_prenex_393 (_ BitVec 32)) (v_prenex_392 (_ BitVec 32)) (v_prenex_391 (_ BitVec 32)) (v_prenex_390 (_ BitVec 32)) (v_prenex_389 (_ BitVec 32)) (v_arrayElimCell_130 (_ BitVec 32))) (let ((.cse201 (bvadd v_prenex_392 (_ bv4 32))) (.cse202 (store |c_#length| v_prenex_391 v_prenex_390)) (.cse198 (bvadd v_prenex_393 v_prenex_392)) (.cse200 (select |c_#length| v_arrayElimCell_130)) (.cse197 (bvadd v_prenex_392 (_ bv8 32))) (.cse199 (bvadd v_prenex_392 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) .cse197)) (not (bvsle v_prenex_392 .cse198)) (not (bvsle .cse199 .cse200)) (not (= (select |c_#valid| v_prenex_391) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_392)) (= v_arrayElimCell_130 c_main_~x~0.base) (bvsle .cse201 (select .cse202 v_arrayElimCell_130)) (bvsle .cse201 (select .cse202 v_prenex_389)) (not (bvsle .cse198 .cse200)) (not (bvsle .cse197 .cse199))))) .cse1) (or .cse0 (forall ((v_prenex_282 (_ BitVec 32)) (v_prenex_281 (_ BitVec 32)) (v_prenex_280 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_279 (_ BitVec 32)) (v_prenex_278 (_ BitVec 32))) (let ((.cse203 (bvadd v_prenex_280 (_ bv8 32))) (.cse205 (bvadd v_prenex_280 (_ bv12 32))) (.cse206 (bvadd v_prenex_280 (_ bv4 32))) (.cse207 (store |c_#length| v_prenex_278 v_prenex_281)) (.cse204 (bvadd v_prenex_282 v_prenex_280)) (.cse208 (select |c_#length| v_prenex_8))) (or (not (bvsle (_ bv0 32) .cse203)) (not (bvsle v_prenex_280 .cse204)) (not (bvsle .cse203 .cse205)) (not (bvsle (_ bv0 32) v_prenex_280)) (bvsle .cse206 (select .cse207 v_prenex_8)) (not (= (select |c_#valid| v_prenex_278) (_ bv0 1))) (not (bvsle .cse205 .cse208)) (bvsle .cse206 (select .cse207 v_prenex_279)) (not (bvsle .cse204 .cse208))))) .cse1) (or .cse1 (forall ((v_prenex_73 (_ BitVec 32)) (v_prenex_74 (_ BitVec 32)) (v_prenex_75 (_ BitVec 32)) (v_prenex_76 (_ BitVec 32)) (v_prenex_72 (_ BitVec 32)) (v_arrayElimCell_198 (_ BitVec 32))) (let ((.cse212 (select |c_#length| v_arrayElimCell_198)) (.cse211 (bvadd v_prenex_72 v_prenex_75)) (.cse213 (bvadd v_prenex_75 (_ bv12 32))) (.cse214 (bvadd v_prenex_75 (_ bv8 32))) (.cse209 (bvadd v_prenex_75 (_ bv4 32))) (.cse210 (store |c_#length| v_prenex_73 v_prenex_76))) (or (bvsle .cse209 (select .cse210 v_arrayElimCell_198)) (not (bvsle .cse211 .cse212)) (not (bvsle .cse213 .cse212)) (not (bvsle (_ bv0 32) v_prenex_75)) (not (bvsle v_prenex_75 .cse211)) (not (= (select |c_#valid| v_prenex_73) (_ bv0 1))) (not (bvsle .cse214 .cse213)) (not (bvsle (_ bv0 32) .cse214)) (bvsle .cse209 (select .cse210 v_prenex_74)))))) (or .cse0 (forall ((v_prenex_238 (_ BitVec 32)) (v_prenex_237 (_ BitVec 32)) (v_prenex_236 (_ BitVec 32)) (v_prenex_235 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse215 (bvadd v_prenex_236 (_ bv8 32))) (.cse216 (bvadd v_prenex_236 (_ bv12 32))) (.cse218 (select |c_#length| v_prenex_12)) (.cse217 (bvadd v_prenex_238 v_prenex_236))) (or (bvsle (bvadd v_prenex_236 (_ bv4 32)) (select (store |c_#length| v_prenex_235 v_prenex_237) v_prenex_12)) (not (bvsle (_ bv0 32) v_prenex_236)) (not (bvsle .cse215 .cse216)) (not (bvsle .cse217 .cse218)) (not (bvsle (_ bv0 32) .cse215)) (not (bvsle .cse216 .cse218)) (not (= (select |c_#valid| v_prenex_235) (_ bv0 1))) (not (bvsle v_prenex_236 .cse217))))) .cse1) (or .cse0 .cse1 (forall ((v_prenex_135 (_ BitVec 32)) (v_arrayElimCell_164 (_ BitVec 32)) (v_prenex_134 (_ BitVec 32)) (v_prenex_133 (_ BitVec 32)) (v_prenex_132 (_ BitVec 32))) (let ((.cse219 (bvadd v_prenex_134 (_ bv12 32))) (.cse222 (bvadd v_prenex_133 v_prenex_134)) (.cse220 (select |c_#length| v_arrayElimCell_164)) (.cse221 (bvadd v_prenex_134 (_ bv8 32)))) (or (not (bvsle .cse219 .cse220)) (= v_arrayElimCell_164 c_main_~x~0.base) (bvsle (bvadd v_prenex_134 (_ bv4 32)) (select (store |c_#length| v_prenex_132 v_prenex_135) v_arrayElimCell_164)) (not (bvsle (_ bv0 32) v_prenex_134)) (not (bvsle .cse221 .cse219)) (not (= (select |c_#valid| v_prenex_132) (_ bv0 1))) (not (bvsle v_prenex_134 .cse222)) (not (bvsle .cse222 .cse220)) (not (bvsle (_ bv0 32) .cse221)))))) (or .cse0 (forall ((v_arrayElimCell_224 (_ BitVec 32)) (v_prenex_260 (_ BitVec 32)) (v_prenex_259 (_ BitVec 32)) (v_prenex_258 (_ BitVec 32)) (v_prenex_257 (_ BitVec 32))) (let ((.cse226 (bvadd v_prenex_258 (_ bv12 32))) (.cse224 (select |c_#length| v_arrayElimCell_224)) (.cse223 (bvadd v_prenex_260 v_prenex_258)) (.cse225 (bvadd v_prenex_258 (_ bv8 32)))) (or (= v_arrayElimCell_224 c_main_~x~0.base) (not (bvsle .cse223 .cse224)) (not (bvsle .cse225 .cse226)) (bvsle (bvadd v_prenex_258 (_ bv4 32)) (select (store |c_#length| v_prenex_257 v_prenex_259) v_arrayElimCell_224)) (not (bvsle .cse226 .cse224)) (not (= (select |c_#valid| v_prenex_257) (_ bv0 1))) (not (bvsle v_prenex_258 .cse223)) (not (bvsle (_ bv0 32) v_prenex_258)) (not (bvsle (_ bv0 32) .cse225)))))) (or .cse80 .cse0 .cse1 (forall ((v_prenex_5 (_ BitVec 32)) (v_prenex_225 (_ BitVec 32)) (v_prenex_224 (_ BitVec 32)) (v_prenex_223 (_ BitVec 32)) (v_prenex_222 (_ BitVec 32)) (v_prenex_221 (_ BitVec 32))) (let ((.cse227 (bvadd v_prenex_223 (_ bv12 32))) (.cse232 (bvadd v_prenex_223 (_ bv8 32))) (.cse229 (bvadd v_prenex_225 v_prenex_223)) (.cse228 (select |c_#length| v_prenex_5)) (.cse230 (bvadd v_prenex_223 (_ bv4 32))) (.cse231 (store |c_#length| v_prenex_221 v_prenex_224))) (or (not (bvsle (_ bv0 32) v_prenex_223)) (not (bvsle .cse227 .cse228)) (not (bvsle v_prenex_223 .cse229)) (bvsle .cse230 (select .cse231 v_prenex_5)) (not (bvsle .cse232 .cse227)) (not (bvsle (_ bv0 32) .cse232)) (not (= (select |c_#valid| v_prenex_221) (_ bv0 1))) (not (bvsle .cse229 .cse228)) (bvsle .cse230 (select .cse231 v_prenex_222)) (= v_prenex_5 c_main_~x~0.base))))) (or .cse0 .cse1 (forall ((v_prenex_175 (_ BitVec 32)) (v_prenex_174 (_ BitVec 32)) (v_prenex_173 (_ BitVec 32)) (v_prenex_172 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 32)) (v_prenex_176 (_ BitVec 32))) (let ((.cse234 (select |c_#length| v_arrayElimCell_52)) (.cse233 (bvadd v_prenex_173 v_prenex_175)) (.cse236 (bvadd v_prenex_175 (_ bv4 32))) (.cse237 (store |c_#length| v_prenex_172 v_prenex_176)) (.cse238 (bvadd v_prenex_175 (_ bv8 32))) (.cse235 (bvadd v_prenex_175 (_ bv12 32)))) (or (not (bvsle .cse233 .cse234)) (not (bvsle .cse235 .cse234)) (not (= (select |c_#valid| v_prenex_172) (_ bv0 1))) (bvsle .cse236 (select .cse237 v_prenex_174)) (not (bvsle v_prenex_175 .cse233)) (not (bvsle (_ bv0 32) .cse238)) (bvsle .cse236 (select .cse237 v_arrayElimCell_52)) (not (bvsle (_ bv0 32) v_prenex_175)) (not (bvsle .cse238 .cse235)) (= v_arrayElimCell_52 c_main_~x~0.base))))) (or .cse0 .cse1 (forall ((v_prenex_395 (_ BitVec 32)) (v_prenex_394 (_ BitVec 32)) (v_arrayElimCell_99 (_ BitVec 32)) (v_prenex_398 (_ BitVec 32)) (v_prenex_397 (_ BitVec 32)) (v_prenex_396 (_ BitVec 32))) (let ((.cse241 (bvadd v_prenex_397 (_ bv12 32))) (.cse240 (bvadd v_prenex_397 (_ bv8 32))) (.cse239 (bvadd v_prenex_398 v_prenex_397)) (.cse242 (select |c_#length| v_arrayElimCell_99)) (.cse243 (bvadd v_prenex_397 (_ bv4 32))) (.cse244 (store |c_#length| v_prenex_396 v_prenex_395))) (or (not (= (select |c_#valid| v_prenex_396) (_ bv0 1))) (not (bvsle v_prenex_397 .cse239)) (= v_arrayElimCell_99 c_main_~x~0.base) (not (bvsle .cse240 .cse241)) (not (bvsle .cse241 .cse242)) (bvsle .cse243 (select .cse244 v_arrayElimCell_99)) (not (bvsle (_ bv0 32) v_prenex_397)) (not (bvsle (_ bv0 32) .cse240)) (not (bvsle .cse239 .cse242)) (bvsle .cse243 (select .cse244 v_prenex_394)))))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_prenex_329 (_ BitVec 32)) (v_prenex_328 (_ BitVec 32)) (v_prenex_327 (_ BitVec 32)) (v_prenex_331 (_ BitVec 32)) (v_prenex_330 (_ BitVec 32))) (let ((.cse245 (bvadd v_prenex_329 (_ bv8 32))) (.cse246 (bvadd v_prenex_329 (_ bv12 32))) (.cse248 (bvadd v_prenex_329 (_ bv4 32))) (.cse249 (store |c_#length| v_prenex_327 v_prenex_330)) (.cse250 (bvadd v_prenex_331 v_prenex_329)) (.cse247 (select |c_#length| v_arrayElimCell_38))) (or (not (bvsle .cse245 .cse246)) (not (bvsle (_ bv0 32) .cse245)) (not (bvsle .cse246 .cse247)) (bvsle .cse248 (select .cse249 v_prenex_328)) (not (bvsle (_ bv0 32) v_prenex_329)) (bvsle .cse248 (select .cse249 v_arrayElimCell_38)) (not (bvsle v_prenex_329 .cse250)) (not (= (select |c_#valid| v_prenex_327) (_ bv0 1))) (not (bvsle .cse250 .cse247))))) .cse0 .cse1) (or .cse1 (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_prenex_148 (_ BitVec 32)) (v_prenex_147 (_ BitVec 32)) (v_prenex_146 (_ BitVec 32)) (v_prenex_145 (_ BitVec 32))) (let ((.cse251 (bvadd v_prenex_147 (_ bv12 32))) (.cse253 (bvadd v_prenex_146 v_prenex_147)) (.cse252 (select |c_#length| v_arrayElimCell_139)) (.cse254 (bvadd v_prenex_147 (_ bv8 32)))) (or (not (bvsle .cse251 .cse252)) (not (= (select |c_#valid| v_prenex_145) (_ bv0 1))) (not (bvsle v_prenex_147 .cse253)) (= v_arrayElimCell_139 c_main_~x~0.base) (not (bvsle .cse254 .cse251)) (not (bvsle (_ bv0 32) v_prenex_147)) (not (bvsle .cse253 .cse252)) (bvsle (bvadd v_prenex_147 (_ bv4 32)) (select (store |c_#length| v_prenex_145 v_prenex_148) v_arrayElimCell_139)) (not (bvsle (_ bv0 32) .cse254)))))) (or .cse0 .cse1 (forall ((v_prenex_185 (_ BitVec 32)) (v_prenex_184 (_ BitVec 32)) (v_prenex_183 (_ BitVec 32)) (v_prenex_182 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse256 (bvadd v_prenex_184 (_ bv8 32))) (.cse255 (bvadd v_prenex_183 v_prenex_184)) (.cse257 (bvadd v_prenex_184 (_ bv12 32))) (.cse258 (select |c_#length| v_arrayElimCell_74))) (or (not (bvsle v_prenex_184 .cse255)) (not (bvsle .cse256 .cse257)) (not (bvsle (_ bv0 32) .cse256)) (not (bvsle .cse255 .cse258)) (not (bvsle (_ bv0 32) v_prenex_184)) (= v_arrayElimCell_74 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_182) (_ bv0 1))) (not (bvsle .cse257 .cse258)) (bvsle (bvadd v_prenex_184 (_ bv4 32)) (select (store |c_#length| v_prenex_182 v_prenex_185) v_arrayElimCell_74)))))) (or (forall ((v_arrayElimCell_145 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (|main_write~$Pointer$_#sizeOfWrittenType| (_ BitVec 32)) (|v_main_#Ultimate.alloc_~size_4| (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (|v_main_write~$Pointer$_#ptr.offset_35| (_ BitVec 32))) (let ((.cse261 (bvadd |main_write~$Pointer$_#sizeOfWrittenType| |v_main_write~$Pointer$_#ptr.offset_35|)) (.cse259 (bvadd |v_main_write~$Pointer$_#ptr.offset_35| (_ bv4 32))) (.cse260 (store |c_#length| v_prenex_2 |v_main_#Ultimate.alloc_~size_4|)) (.cse263 (bvadd |v_main_write~$Pointer$_#ptr.offset_35| (_ bv8 32))) (.cse264 (bvadd |v_main_write~$Pointer$_#ptr.offset_35| (_ bv12 32))) (.cse262 (select |c_#length| v_arrayElimCell_145))) (or (bvsle .cse259 (select .cse260 v_arrayElimCell_145)) (not (= (select |c_#valid| v_prenex_2) (_ bv0 1))) (not (bvsle .cse261 .cse262)) (not (bvsle (_ bv0 32) .cse263)) (not (bvsle |v_main_write~$Pointer$_#ptr.offset_35| .cse261)) (bvsle .cse259 (select .cse260 v_subst_2)) (= v_arrayElimCell_145 c_main_~x~0.base) (not (bvsle .cse263 .cse264)) (not (bvsle .cse264 .cse262)) (not (bvsle (_ bv0 32) |v_main_write~$Pointer$_#ptr.offset_35|))))) .cse1) (or .cse0 .cse8 (forall ((v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_215 (_ BitVec 32)) (v_prenex_214 (_ BitVec 32)) (v_prenex_213 (_ BitVec 32)) (v_prenex_212 (_ BitVec 32)) (v_prenex_211 (_ BitVec 32))) (let ((.cse265 (bvadd v_prenex_213 (_ bv12 32))) (.cse269 (bvadd v_prenex_213 (_ bv8 32))) (.cse267 (bvadd v_prenex_213 (_ bv4 32))) (.cse268 (store |c_#length| v_prenex_211 v_prenex_214)) (.cse266 (select |c_#length| v_arrayElimCell_114)) (.cse270 (bvadd v_prenex_215 v_prenex_213))) (or (not (bvsle .cse265 .cse266)) (= v_arrayElimCell_114 c_main_~x~0.base) (bvsle .cse267 (select .cse268 v_prenex_212)) (not (bvsle .cse269 .cse265)) (not (bvsle (_ bv0 32) .cse269)) (bvsle .cse267 (select .cse268 v_arrayElimCell_114)) (not (= (select |c_#valid| v_prenex_211) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_213)) (not (bvsle .cse270 .cse266)) (not (bvsle v_prenex_213 .cse270)))))) (or .cse0 .cse1 (forall ((v_prenex_131 (_ BitVec 32)) (v_prenex_130 (_ BitVec 32)) (v_prenex_129 (_ BitVec 32)) (v_prenex_128 (_ BitVec 32)) (v_prenex_127 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse272 (bvadd v_prenex_130 (_ bv12 32))) (.cse276 (select |c_#length| v_arrayElimCell_122)) (.cse271 (bvadd v_prenex_130 (_ bv8 32))) (.cse273 (bvadd v_prenex_130 (_ bv4 32))) (.cse274 (store |c_#length| v_prenex_127 v_prenex_131)) (.cse275 (bvadd v_prenex_128 v_prenex_130))) (or (not (bvsle .cse271 .cse272)) (bvsle .cse273 (select .cse274 v_prenex_129)) (= v_arrayElimCell_122 c_main_~x~0.base) (not (bvsle .cse275 .cse276)) (not (bvsle .cse272 .cse276)) (not (bvsle (_ bv0 32) .cse271)) (not (bvsle (_ bv0 32) v_prenex_130)) (bvsle .cse273 (select .cse274 v_arrayElimCell_122)) (not (= (select |c_#valid| v_prenex_127) (_ bv0 1))) (not (bvsle v_prenex_130 .cse275)))))) (or .cse80 .cse1 (forall ((v_prenex_31 (_ BitVec 32)) (v_prenex_304 (_ BitVec 32)) (v_prenex_303 (_ BitVec 32)) (v_prenex_302 (_ BitVec 32)) (v_prenex_301 (_ BitVec 32))) (let ((.cse277 (bvadd v_prenex_302 (_ bv8 32))) (.cse279 (bvadd v_prenex_302 (_ bv12 32))) (.cse278 (bvadd v_prenex_304 v_prenex_302)) (.cse280 (select |c_#length| v_prenex_31))) (or (not (bvsle (_ bv0 32) .cse277)) (not (bvsle v_prenex_302 .cse278)) (= v_prenex_31 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_302)) (not (bvsle .cse279 .cse280)) (not (bvsle .cse277 .cse279)) (not (= (select |c_#valid| v_prenex_301) (_ bv0 1))) (bvsle (bvadd v_prenex_302 (_ bv4 32)) (select (store |c_#length| v_prenex_301 v_prenex_303) v_prenex_31)) (not (bvsle .cse278 .cse280)))))) (or (forall ((v_prenex_384 (_ BitVec 32)) (v_prenex_383 (_ BitVec 32)) (v_prenex_382 (_ BitVec 32)) (v_prenex_381 (_ BitVec 32)) (v_prenex_380 (_ BitVec 32))) (let ((.cse281 (bvadd v_prenex_384 v_prenex_383)) (.cse284 (bvadd v_prenex_383 (_ bv12 32))) (.cse282 (select |c_#length| v_prenex_380)) (.cse283 (bvadd v_prenex_383 (_ bv8 32)))) (or (not (bvsle .cse281 .cse282)) (not (bvsle v_prenex_383 .cse281)) (not (bvsle .cse283 .cse284)) (not (bvsle .cse284 .cse282)) (not (bvsle (_ bv0 32) v_prenex_383)) (not (bvsle (_ bv0 32) .cse283)) (not (= (select |c_#valid| v_prenex_382) (_ bv0 1))) (bvsle (bvadd v_prenex_383 (_ bv4 32)) (select (store |c_#length| v_prenex_382 v_prenex_381) v_prenex_380))))) (not .cse80)) (or .cse1 (forall ((v_prenex_40 (_ BitVec 32)) (v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32)) (v_arrayElimCell_150 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse287 (bvadd v_prenex_44 (_ bv4 32))) (.cse288 (store |c_#length| v_prenex_41 v_prenex_43)) (.cse290 (bvadd v_prenex_44 (_ bv8 32))) (.cse285 (bvadd v_prenex_44 (_ bv12 32))) (.cse289 (bvadd v_prenex_40 v_prenex_44)) (.cse286 (select |c_#length| v_arrayElimCell_150))) (or (not (bvsle .cse285 .cse286)) (bvsle .cse287 (select .cse288 v_prenex_42)) (not (= (select |c_#valid| v_prenex_41) (_ bv0 1))) (not (bvsle v_prenex_44 .cse289)) (= v_arrayElimCell_150 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse290)) (bvsle .cse287 (select .cse288 v_arrayElimCell_150)) (not (bvsle .cse290 .cse285)) (not (bvsle .cse289 .cse286)) (not (bvsle (_ bv0 32) v_prenex_44)))))) (or (forall ((v_prenex_164 (_ BitVec 32)) (v_prenex_163 (_ BitVec 32)) (v_prenex_162 (_ BitVec 32)) (v_arrayElimCell_136 (_ BitVec 32)) (v_prenex_166 (_ BitVec 32)) (v_prenex_165 (_ BitVec 32))) (let ((.cse291 (bvadd v_prenex_163 v_prenex_165)) (.cse292 (bvadd v_prenex_165 (_ bv8 32))) (.cse295 (bvadd v_prenex_165 (_ bv4 32))) (.cse296 (store |c_#length| v_prenex_162 v_prenex_166)) (.cse293 (bvadd v_prenex_165 (_ bv12 32))) (.cse294 (select |c_#length| v_arrayElimCell_136))) (or (not (bvsle v_prenex_165 .cse291)) (= v_arrayElimCell_136 c_main_~x~0.base) (not (bvsle .cse292 .cse293)) (not (bvsle .cse291 .cse294)) (bvsle .cse295 (select .cse296 v_prenex_164)) (not (bvsle (_ bv0 32) .cse292)) (bvsle .cse295 (select .cse296 v_arrayElimCell_136)) (not (bvsle .cse293 .cse294)) (not (= (select |c_#valid| v_prenex_162) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_165))))) .cse1) (or .cse0 (forall ((v_prenex_161 (_ BitVec 32)) (v_prenex_160 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32)) (v_prenex_159 (_ BitVec 32)) (v_prenex_158 (_ BitVec 32))) (let ((.cse299 (bvadd v_prenex_159 v_prenex_160)) (.cse297 (bvadd v_prenex_160 (_ bv8 32))) (.cse298 (bvadd v_prenex_160 (_ bv12 32))) (.cse300 (select |c_#length| v_arrayElimCell_118))) (or (not (= (select |c_#valid| v_prenex_158) (_ bv0 1))) (not (bvsle .cse297 .cse298)) (not (bvsle v_prenex_160 .cse299)) (not (bvsle .cse299 .cse300)) (not (bvsle (_ bv0 32) .cse297)) (not (bvsle .cse298 .cse300)) (bvsle (bvadd v_prenex_160 (_ bv4 32)) (select (store |c_#length| v_prenex_158 v_prenex_161) v_arrayElimCell_118)) (not (bvsle (_ bv0 32) v_prenex_160)))))) (or .cse0 (forall ((v_prenex_362 (_ BitVec 32)) (v_prenex_366 (_ BitVec 32)) (v_prenex_365 (_ BitVec 32)) (v_prenex_364 (_ BitVec 32)) (v_arrayElimCell_121 (_ BitVec 32)) (v_prenex_363 (_ BitVec 32))) (let ((.cse301 (bvadd v_prenex_365 (_ bv4 32))) (.cse302 (store |c_#length| v_prenex_364 v_prenex_363)) (.cse304 (select |c_#length| v_arrayElimCell_121)) (.cse305 (bvadd v_prenex_366 v_prenex_365)) (.cse303 (bvadd v_prenex_365 (_ bv12 32))) (.cse306 (bvadd v_prenex_365 (_ bv8 32)))) (or (= v_arrayElimCell_121 c_main_~x~0.base) (bvsle .cse301 (select .cse302 v_prenex_362)) (not (bvsle (_ bv0 32) v_prenex_365)) (bvsle .cse301 (select .cse302 v_arrayElimCell_121)) (not (= (select |c_#valid| v_prenex_364) (_ bv0 1))) (not (bvsle .cse303 .cse304)) (not (bvsle .cse305 .cse304)) (not (bvsle v_prenex_365 .cse305)) (not (bvsle .cse306 .cse303)) (not (bvsle (_ bv0 32) .cse306)))))) (or (forall ((v_prenex_206 (_ BitVec 32)) (v_prenex_205 (_ BitVec 32)) (v_prenex_204 (_ BitVec 32)) (v_prenex_203 (_ BitVec 32)) (v_arrayElimCell_142 (_ BitVec 32))) (let ((.cse309 (bvadd v_prenex_206 v_prenex_204)) (.cse307 (bvadd v_prenex_204 (_ bv8 32))) (.cse308 (bvadd v_prenex_204 (_ bv12 32))) (.cse310 (select |c_#length| v_arrayElimCell_142))) (or (not (bvsle .cse307 .cse308)) (not (bvsle v_prenex_204 .cse309)) (not (bvsle (_ bv0 32) v_prenex_204)) (not (bvsle .cse309 .cse310)) (not (bvsle (_ bv0 32) .cse307)) (not (= (select |c_#valid| v_prenex_203) (_ bv0 1))) (not (bvsle .cse308 .cse310)) (bvsle (bvadd v_prenex_204 (_ bv4 32)) (select (store |c_#length| v_prenex_203 v_prenex_205) v_arrayElimCell_142))))) .cse1) (or .cse80 .cse1 (forall ((v_prenex_118 (_ BitVec 32)) (v_prenex_117 (_ BitVec 32)) (v_prenex_116 (_ BitVec 32)) (v_prenex_115 (_ BitVec 32)) (v_prenex_114 (_ BitVec 32)) (v_prenex_25 (_ BitVec 32))) (let ((.cse311 (bvadd v_prenex_117 (_ bv8 32))) (.cse312 (bvadd v_prenex_117 (_ bv12 32))) (.cse315 (bvadd v_prenex_115 v_prenex_117)) (.cse316 (select |c_#length| v_prenex_25)) (.cse313 (bvadd v_prenex_117 (_ bv4 32))) (.cse314 (store |c_#length| v_prenex_114 v_prenex_118))) (or (not (bvsle (_ bv0 32) v_prenex_117)) (not (bvsle (_ bv0 32) .cse311)) (= v_prenex_25 c_main_~x~0.base) (not (bvsle .cse311 .cse312)) (bvsle .cse313 (select .cse314 v_prenex_116)) (not (bvsle v_prenex_117 .cse315)) (not (= (select |c_#valid| v_prenex_114) (_ bv0 1))) (not (bvsle .cse312 .cse316)) (not (bvsle .cse315 .cse316)) (bvsle .cse313 (select .cse314 v_prenex_25)))))) (or .cse1 (forall ((v_prenex_32 (_ BitVec 32)) (v_prenex_181 (_ BitVec 32)) (v_prenex_180 (_ BitVec 32)) (v_prenex_179 (_ BitVec 32)) (v_prenex_178 (_ BitVec 32)) (v_prenex_177 (_ BitVec 32))) (let ((.cse319 (select |c_#length| v_prenex_32)) (.cse317 (bvadd v_prenex_180 (_ bv8 32))) (.cse322 (bvadd v_prenex_180 (_ bv12 32))) (.cse318 (bvadd v_prenex_178 v_prenex_180)) (.cse320 (bvadd v_prenex_180 (_ bv4 32))) (.cse321 (store |c_#length| v_prenex_177 v_prenex_181))) (or (not (bvsle (_ bv0 32) .cse317)) (not (bvsle (_ bv0 32) v_prenex_180)) (not (bvsle .cse318 .cse319)) (bvsle .cse320 (select .cse321 v_prenex_179)) (not (bvsle .cse322 .cse319)) (not (= (select |c_#valid| v_prenex_177) (_ bv0 1))) (not (bvsle .cse317 .cse322)) (= v_prenex_32 c_main_~x~0.base) (not (bvsle v_prenex_180 .cse318)) (bvsle .cse320 (select .cse321 v_prenex_32)))))) (or .cse80 .cse0 (forall ((v_prenex_241 (_ BitVec 32)) (v_prenex_240 (_ BitVec 32)) (v_prenex_239 (_ BitVec 32)) (v_arrayElimCell_96 (_ BitVec 32)) (v_prenex_242 (_ BitVec 32))) (let ((.cse323 (bvadd v_prenex_242 v_prenex_240)) (.cse326 (bvadd v_prenex_240 (_ bv12 32))) (.cse324 (select |c_#length| v_arrayElimCell_96)) (.cse325 (bvadd v_prenex_240 (_ bv8 32)))) (or (not (bvsle .cse323 .cse324)) (not (bvsle (_ bv0 32) v_prenex_240)) (= v_arrayElimCell_96 c_main_~x~0.base) (not (bvsle v_prenex_240 .cse323)) (not (bvsle .cse325 .cse326)) (not (bvsle .cse326 .cse324)) (bvsle (bvadd v_prenex_240 (_ bv4 32)) (select (store |c_#length| v_prenex_239 v_prenex_241) v_arrayElimCell_96)) (not (bvsle (_ bv0 32) .cse325)) (not (= (select |c_#valid| v_prenex_239) (_ bv0 1)))))) .cse1) (or .cse1 (forall ((v_prenex_230 (_ BitVec 32)) (v_prenex_229 (_ BitVec 32)) (v_prenex_228 (_ BitVec 32)) (v_prenex_227 (_ BitVec 32)) (v_prenex_226 (_ BitVec 32)) (v_prenex_35 (_ BitVec 32))) (let ((.cse331 (bvadd v_prenex_230 v_prenex_228)) (.cse329 (bvadd v_prenex_228 (_ bv8 32))) (.cse327 (bvadd v_prenex_228 (_ bv4 32))) (.cse328 (store |c_#length| v_prenex_226 v_prenex_229)) (.cse330 (bvadd v_prenex_228 (_ bv12 32))) (.cse332 (select |c_#length| v_prenex_35))) (or (bvsle .cse327 (select .cse328 v_prenex_227)) (not (bvsle (_ bv0 32) v_prenex_228)) (not (= (select |c_#valid| v_prenex_226) (_ bv0 1))) (not (bvsle .cse329 .cse330)) (= v_prenex_35 c_main_~x~0.base) (not (bvsle .cse331 .cse332)) (not (bvsle v_prenex_228 .cse331)) (not (bvsle (_ bv0 32) .cse329)) (bvsle .cse327 (select .cse328 v_prenex_35)) (not (bvsle .cse330 .cse332)))))) (or .cse0 .cse1 (forall ((v_arrayElimCell_211 (_ BitVec 32)) (v_prenex_351 (_ BitVec 32)) (v_prenex_350 (_ BitVec 32)) (v_prenex_349 (_ BitVec 32)) (v_prenex_352 (_ BitVec 32))) (let ((.cse333 (bvadd v_prenex_351 (_ bv8 32))) (.cse334 (bvadd v_prenex_351 (_ bv12 32))) (.cse336 (bvadd v_prenex_352 v_prenex_351)) (.cse335 (select |c_#length| v_arrayElimCell_211))) (or (not (bvsle (_ bv0 32) .cse333)) (bvsle (bvadd v_prenex_351 (_ bv4 32)) (select (store |c_#length| v_prenex_350 v_prenex_349) v_arrayElimCell_211)) (not (bvsle .cse333 .cse334)) (not (bvsle .cse334 .cse335)) (not (bvsle v_prenex_351 .cse336)) (not (bvsle .cse336 .cse335)) (not (= (select |c_#valid| v_prenex_350) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_351)))))) (or .cse0 (forall ((v_prenex_388 (_ BitVec 32)) (v_prenex_387 (_ BitVec 32)) (v_prenex_386 (_ BitVec 32)) (v_arrayElimCell_220 (_ BitVec 32)) (v_prenex_385 (_ BitVec 32))) (let ((.cse337 (bvadd v_prenex_387 (_ bv8 32))) (.cse340 (bvadd v_prenex_387 (_ bv12 32))) (.cse339 (select |c_#length| v_arrayElimCell_220)) (.cse338 (bvadd v_prenex_388 v_prenex_387))) (or (not (bvsle (_ bv0 32) .cse337)) (not (bvsle (_ bv0 32) v_prenex_387)) (bvsle (bvadd v_prenex_387 (_ bv4 32)) (select (store |c_#length| v_prenex_386 v_prenex_385) v_arrayElimCell_220)) (not (bvsle .cse338 .cse339)) (not (bvsle .cse337 .cse340)) (not (bvsle .cse340 .cse339)) (not (bvsle v_prenex_387 .cse338)) (not (= (select |c_#valid| v_prenex_386) (_ bv0 1))))))) (or .cse1 (forall ((v_prenex_252 (_ BitVec 32)) (v_prenex_251 (_ BitVec 32)) (v_prenex_250 (_ BitVec 32)) (v_prenex_249 (_ BitVec 32)) (v_prenex_248 (_ BitVec 32)) (v_prenex_34 (_ BitVec 32))) (let ((.cse343 (bvadd v_prenex_250 (_ bv4 32))) (.cse344 (store |c_#length| v_prenex_248 v_prenex_251)) (.cse345 (bvadd v_prenex_250 (_ bv8 32))) (.cse346 (bvadd v_prenex_250 (_ bv12 32))) (.cse342 (select |c_#length| v_prenex_34)) (.cse341 (bvadd v_prenex_252 v_prenex_250))) (or (not (bvsle .cse341 .cse342)) (bvsle .cse343 (select .cse344 v_prenex_34)) (= v_prenex_34 c_main_~x~0.base) (bvsle .cse343 (select .cse344 v_prenex_249)) (not (bvsle .cse345 .cse346)) (not (bvsle (_ bv0 32) .cse345)) (not (bvsle (_ bv0 32) v_prenex_250)) (not (bvsle .cse346 .cse342)) (not (bvsle v_prenex_250 .cse341)) (not (= (select |c_#valid| v_prenex_248) (_ bv0 1))))))) (or (forall ((v_prenex_285 (_ BitVec 32)) (v_prenex_284 (_ BitVec 32)) (v_prenex_283 (_ BitVec 32)) (v_arrayElimCell_63 (_ BitVec 32)) (v_prenex_286 (_ BitVec 32))) (let ((.cse349 (select |c_#length| v_arrayElimCell_63)) (.cse347 (bvadd v_prenex_284 (_ bv8 32))) (.cse350 (bvadd v_prenex_284 (_ bv12 32))) (.cse348 (bvadd v_prenex_286 v_prenex_284))) (or (not (bvsle (_ bv0 32) .cse347)) (not (bvsle (_ bv0 32) v_prenex_284)) (not (bvsle .cse348 .cse349)) (not (bvsle .cse350 .cse349)) (= v_arrayElimCell_63 c_main_~x~0.base) (not (bvsle .cse347 .cse350)) (bvsle (bvadd v_prenex_284 (_ bv4 32)) (select (store |c_#length| v_prenex_283 v_prenex_285) v_arrayElimCell_63)) (not (bvsle v_prenex_284 .cse348)) (not (= (select |c_#valid| v_prenex_283) (_ bv0 1)))))) .cse0 .cse1) (or .cse80 .cse0 .cse1 (forall ((v_prenex_95 (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (v_prenex_93 (_ BitVec 32)) (v_prenex_94 (_ BitVec 32)) (v_arrayElimCell_29 (_ BitVec 32))) (let ((.cse351 (bvadd v_prenex_94 (_ bv4 32))) (.cse352 (store |c_#length| v_prenex_92 v_prenex_95)) (.cse353 (bvadd v_prenex_91 v_prenex_94)) (.cse354 (bvadd v_prenex_94 (_ bv8 32))) (.cse356 (bvadd v_prenex_94 (_ bv12 32))) (.cse355 (select |c_#length| v_arrayElimCell_29))) (or (bvsle .cse351 (select .cse352 v_arrayElimCell_29)) (not (bvsle v_prenex_94 .cse353)) (not (bvsle (_ bv0 32) .cse354)) (bvsle .cse351 (select .cse352 v_prenex_93)) (not (bvsle .cse353 .cse355)) (not (bvsle (_ bv0 32) v_prenex_94)) (not (= (select |c_#valid| v_prenex_92) (_ bv0 1))) (not (bvsle .cse354 .cse356)) (not (bvsle .cse356 .cse355)))))) (or .cse80 .cse0 .cse1 (forall ((v_prenex_406 (_ BitVec 32)) (v_prenex_405 (_ BitVec 32)) (v_prenex_404 (_ BitVec 32)) (v_prenex_403 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse357 (bvadd v_prenex_406 v_prenex_405)) (.cse360 (bvadd v_prenex_405 (_ bv12 32))) (.cse358 (select |c_#length| v_prenex_14)) (.cse359 (bvadd v_prenex_405 (_ bv8 32)))) (or (not (bvsle (_ bv0 32) v_prenex_405)) (not (bvsle .cse357 .cse358)) (not (= (select |c_#valid| v_prenex_404) (_ bv0 1))) (bvsle (bvadd v_prenex_405 (_ bv4 32)) (select (store |c_#length| v_prenex_404 v_prenex_403) v_prenex_14)) (= v_prenex_14 c_main_~x~0.base) (not (bvsle .cse359 .cse360)) (not (bvsle v_prenex_405 .cse357)) (not (bvsle .cse360 .cse358)) (not (bvsle (_ bv0 32) .cse359)))))) (or .cse0 (forall ((v_prenex_62 (_ BitVec 32)) (v_prenex_60 (_ BitVec 32)) (v_prenex_61 (_ BitVec 32)) (v_prenex_59 (_ BitVec 32)) (v_prenex_58 (_ BitVec 32))) (let ((.cse362 (select |c_#length| v_prenex_61)) (.cse361 (bvadd v_prenex_58 v_prenex_62)) (.cse363 (bvadd v_prenex_62 (_ bv12 32))) (.cse364 (bvadd v_prenex_62 (_ bv8 32)))) (or (not (= (select |c_#valid| v_prenex_60) (_ bv0 1))) (not (bvsle .cse361 .cse362)) (not (bvsle (_ bv0 32) v_prenex_62)) (not (bvsle .cse363 .cse362)) (not (bvsle v_prenex_62 .cse361)) (not (bvsle .cse364 .cse363)) (bvsle (bvadd v_prenex_62 (_ bv4 32)) (select (store |c_#length| v_prenex_60 v_prenex_59) v_prenex_61)) (not (bvsle (_ bv0 32) .cse364)))))) (or .cse80 .cse0 .cse1 (forall ((v_prenex_139 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_138 (_ BitVec 32)) (v_prenex_137 (_ BitVec 32)) (v_prenex_136 (_ BitVec 32))) (let ((.cse365 (bvadd v_prenex_137 v_prenex_138)) (.cse366 (select |c_#length| v_prenex_6)) (.cse368 (bvadd v_prenex_138 (_ bv8 32))) (.cse367 (bvadd v_prenex_138 (_ bv12 32)))) (or (bvsle (bvadd v_prenex_138 (_ bv4 32)) (select (store |c_#length| v_prenex_136 v_prenex_139) v_prenex_6)) (not (bvsle .cse365 .cse366)) (not (bvsle v_prenex_138 .cse365)) (not (bvsle .cse367 .cse366)) (not (bvsle (_ bv0 32) .cse368)) (= v_prenex_6 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_138)) (not (= (select |c_#valid| v_prenex_136) (_ bv0 1))) (not (bvsle .cse368 .cse367)))))) (or (forall ((v_prenex_171 (_ BitVec 32)) (v_prenex_170 (_ BitVec 32)) (v_prenex_169 (_ BitVec 32)) (v_arrayElimCell_173 (_ BitVec 32)) (v_prenex_168 (_ BitVec 32)) (v_prenex_167 (_ BitVec 32))) (let ((.cse372 (bvadd v_prenex_170 (_ bv8 32))) (.cse369 (bvadd v_prenex_170 (_ bv4 32))) (.cse370 (store |c_#length| v_prenex_167 v_prenex_171)) (.cse371 (bvadd v_prenex_168 v_prenex_170)) (.cse373 (bvadd v_prenex_170 (_ bv12 32))) (.cse374 (select |c_#length| v_arrayElimCell_173))) (or (bvsle .cse369 (select .cse370 v_prenex_169)) (not (bvsle v_prenex_170 .cse371)) (not (bvsle (_ bv0 32) v_prenex_170)) (not (bvsle .cse372 .cse373)) (not (bvsle (_ bv0 32) .cse372)) (bvsle .cse369 (select .cse370 v_arrayElimCell_173)) (not (bvsle .cse371 .cse374)) (not (= (select |c_#valid| v_prenex_167) (_ bv0 1))) (= v_arrayElimCell_173 c_main_~x~0.base) (not (bvsle .cse373 .cse374))))) .cse0 .cse1) (or .cse0 .cse1 (forall ((v_prenex_197 (_ BitVec 32)) (v_prenex_196 (_ BitVec 32)) (v_prenex_195 (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (v_prenex_198 (_ BitVec 32))) (let ((.cse375 (bvadd v_prenex_196 (_ bv8 32))) (.cse376 (bvadd v_prenex_196 (_ bv12 32))) (.cse378 (bvadd v_prenex_198 v_prenex_196)) (.cse377 (select |c_#length| v_prenex_10))) (or (not (bvsle (_ bv0 32) .cse375)) (not (bvsle (_ bv0 32) v_prenex_196)) (not (bvsle .cse376 .cse377)) (bvsle (bvadd v_prenex_196 (_ bv4 32)) (select (store |c_#length| v_prenex_195 v_prenex_197) v_prenex_10)) (not (= (select |c_#valid| v_prenex_195) (_ bv0 1))) (not (bvsle v_prenex_196 .cse378)) (= v_prenex_10 c_main_~x~0.base) (not (bvsle .cse375 .cse376)) (not (bvsle .cse378 .cse377)))))) (or .cse0 (forall ((v_prenex_96 (_ BitVec 32)) (v_prenex_97 (_ BitVec 32)) (v_prenex_98 (_ BitVec 32)) (v_arrayElimCell_216 (_ BitVec 32)) (v_prenex_99 (_ BitVec 32))) (let ((.cse381 (bvadd v_prenex_98 (_ bv8 32))) (.cse382 (bvadd v_prenex_98 (_ bv12 32))) (.cse380 (select |c_#length| v_arrayElimCell_216)) (.cse379 (bvadd v_prenex_96 v_prenex_98))) (or (not (= (select |c_#valid| v_prenex_97) (_ bv0 1))) (bvsle (bvadd v_prenex_98 (_ bv4 32)) (select (store |c_#length| v_prenex_97 v_prenex_99) v_arrayElimCell_216)) (not (bvsle (_ bv0 32) v_prenex_98)) (not (bvsle .cse379 .cse380)) (not (bvsle (_ bv0 32) .cse381)) (= v_arrayElimCell_216 c_main_~x~0.base) (not (bvsle .cse381 .cse382)) (not (bvsle .cse382 .cse380)) (not (bvsle v_prenex_98 .cse379))))) .cse1) (or .cse0 (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_prenex_416 (_ BitVec 32)) (v_prenex_415 (_ BitVec 32)) (v_prenex_414 (_ BitVec 32)) (v_prenex_413 (_ BitVec 32)) (v_prenex_412 (_ BitVec 32))) (let ((.cse385 (bvadd v_prenex_415 (_ bv8 32))) (.cse387 (bvadd v_prenex_416 v_prenex_415)) (.cse383 (bvadd v_prenex_415 (_ bv4 32))) (.cse384 (store |c_#length| v_prenex_414 v_prenex_413)) (.cse386 (bvadd v_prenex_415 (_ bv12 32))) (.cse388 (select |c_#length| v_arrayElimCell_69))) (or (bvsle .cse383 (select .cse384 v_prenex_412)) (not (bvsle (_ bv0 32) .cse385)) (not (bvsle (_ bv0 32) v_prenex_415)) (not (bvsle .cse385 .cse386)) (not (bvsle .cse387 .cse388)) (not (bvsle v_prenex_415 .cse387)) (not (= (select |c_#valid| v_prenex_414) (_ bv0 1))) (bvsle .cse383 (select .cse384 v_arrayElimCell_69)) (not (bvsle .cse386 .cse388))))) .cse1) (or .cse80 .cse0 .cse1 (forall ((v_prenex_9 (_ BitVec 32)) (v_prenex_247 (_ BitVec 32)) (v_prenex_246 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32)) (v_prenex_244 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (let ((.cse389 (bvadd v_prenex_247 v_prenex_245)) (.cse391 (select |c_#length| v_prenex_9)) (.cse392 (bvadd v_prenex_245 (_ bv8 32))) (.cse390 (bvadd v_prenex_245 (_ bv12 32))) (.cse393 (bvadd v_prenex_245 (_ bv4 32))) (.cse394 (store |c_#length| v_prenex_243 v_prenex_246))) (or (not (bvsle v_prenex_245 .cse389)) (not (bvsle .cse390 .cse391)) (not (= (select |c_#valid| v_prenex_243) (_ bv0 1))) (not (bvsle .cse389 .cse391)) (not (bvsle (_ bv0 32) .cse392)) (not (bvsle .cse392 .cse390)) (not (bvsle (_ bv0 32) v_prenex_245)) (bvsle .cse393 (select .cse394 v_prenex_9)) (= v_prenex_9 c_main_~x~0.base) (bvsle .cse393 (select .cse394 v_prenex_244)))))) (or .cse1 (forall ((v_prenex_379 (_ BitVec 32)) (v_prenex_378 (_ BitVec 32)) (v_prenex_377 (_ BitVec 32)) (v_prenex_376 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse396 (bvadd v_prenex_379 v_prenex_378)) (.cse395 (bvadd v_prenex_378 (_ bv8 32))) (.cse398 (bvadd v_prenex_378 (_ bv12 32))) (.cse397 (select |c_#length| v_arrayElimCell_187))) (or (bvsle (bvadd v_prenex_378 (_ bv4 32)) (select (store |c_#length| v_prenex_377 v_prenex_376) v_arrayElimCell_187)) (not (bvsle (_ bv0 32) .cse395)) (not (bvsle v_prenex_378 .cse396)) (not (bvsle .cse396 .cse397)) (= v_arrayElimCell_187 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_377) (_ bv0 1))) (not (bvsle .cse395 .cse398)) (not (bvsle .cse398 .cse397)) (not (bvsle (_ bv0 32) v_prenex_378)))))) (or .cse80 .cse0 (forall ((v_prenex_120 (_ BitVec 32)) (v_arrayElimCell_126 (_ BitVec 32)) (v_prenex_119 (_ BitVec 32)) (v_prenex_122 (_ BitVec 32)) (v_prenex_121 (_ BitVec 32))) (let ((.cse401 (bvadd v_prenex_120 v_prenex_121)) (.cse400 (select |c_#length| v_arrayElimCell_126)) (.cse402 (bvadd v_prenex_121 (_ bv8 32))) (.cse399 (bvadd v_prenex_121 (_ bv12 32)))) (or (bvsle (bvadd v_prenex_121 (_ bv4 32)) (select (store |c_#length| v_prenex_119 v_prenex_122) v_arrayElimCell_126)) (not (bvsle .cse399 .cse400)) (not (bvsle (_ bv0 32) v_prenex_121)) (not (bvsle v_prenex_121 .cse401)) (not (bvsle .cse401 .cse400)) (not (bvsle (_ bv0 32) .cse402)) (not (= (select |c_#valid| v_prenex_119) (_ bv0 1))) (= v_arrayElimCell_126 c_main_~x~0.base) (not (bvsle .cse402 .cse399)))))) (or .cse80 (forall ((v_prenex_309 (_ BitVec 32)) (v_prenex_308 (_ BitVec 32)) (v_prenex_307 (_ BitVec 32)) (v_prenex_306 (_ BitVec 32)) (v_prenex_305 (_ BitVec 32)) (v_prenex_29 (_ BitVec 32))) (let ((.cse403 (bvadd v_prenex_307 (_ bv8 32))) (.cse406 (bvadd v_prenex_307 (_ bv12 32))) (.cse408 (bvadd v_prenex_309 v_prenex_307)) (.cse407 (select |c_#length| v_prenex_29)) (.cse404 (bvadd v_prenex_307 (_ bv4 32))) (.cse405 (store |c_#length| v_prenex_305 v_prenex_308))) (or (not (bvsle (_ bv0 32) v_prenex_307)) (not (bvsle (_ bv0 32) .cse403)) (bvsle .cse404 (select .cse405 v_prenex_29)) (not (bvsle .cse403 .cse406)) (= v_prenex_29 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_305) (_ bv0 1))) (not (bvsle .cse406 .cse407)) (not (bvsle v_prenex_307 .cse408)) (not (bvsle .cse408 .cse407)) (bvsle .cse404 (select .cse405 v_prenex_306))))) .cse1) (or .cse0 .cse1 (forall ((v_prenex_152 (_ BitVec 32)) (v_arrayElimCell_223 (_ BitVec 32)) (v_prenex_151 (_ BitVec 32)) (v_prenex_150 (_ BitVec 32)) (v_prenex_149 (_ BitVec 32))) (let ((.cse409 (bvadd v_prenex_150 v_prenex_151)) (.cse410 (select |c_#length| v_arrayElimCell_223)) (.cse412 (bvadd v_prenex_151 (_ bv8 32))) (.cse411 (bvadd v_prenex_151 (_ bv12 32)))) (or (not (bvsle v_prenex_151 .cse409)) (not (bvsle .cse409 .cse410)) (= v_arrayElimCell_223 c_main_~x~0.base) (bvsle (bvadd v_prenex_151 (_ bv4 32)) (select (store |c_#length| v_prenex_149 v_prenex_152) v_arrayElimCell_223)) (not (bvsle .cse411 .cse410)) (not (bvsle (_ bv0 32) .cse412)) (not (bvsle .cse412 .cse411)) (not (= (select |c_#valid| v_prenex_149) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_151)))))) (or .cse0 .cse1 (forall ((v_arrayElimCell_219 (_ BitVec 32)) (v_prenex_48 (_ BitVec 32)) (v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32)) (v_prenex_47 (_ BitVec 32))) (let ((.cse413 (bvadd v_prenex_45 v_prenex_48)) (.cse415 (select |c_#length| v_arrayElimCell_219)) (.cse414 (bvadd v_prenex_48 (_ bv8 32))) (.cse416 (bvadd v_prenex_48 (_ bv12 32)))) (or (not (bvsle v_prenex_48 .cse413)) (not (= (select |c_#valid| v_prenex_46) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse414)) (not (bvsle (_ bv0 32) v_prenex_48)) (not (bvsle .cse413 .cse415)) (not (bvsle .cse416 .cse415)) (bvsle (bvadd v_prenex_48 (_ bv4 32)) (select (store |c_#length| v_prenex_46 v_prenex_47) v_arrayElimCell_219)) (not (bvsle .cse414 .cse416)))))) (or .cse0 .cse1 (forall ((v_prenex_153 (_ BitVec 32)) (v_arrayElimCell_58 (_ BitVec 32)) (v_prenex_157 (_ BitVec 32)) (v_prenex_156 (_ BitVec 32)) (v_prenex_155 (_ BitVec 32)) (v_prenex_154 (_ BitVec 32))) (let ((.cse420 (bvadd v_prenex_156 (_ bv12 32))) (.cse418 (select |c_#length| v_arrayElimCell_58)) (.cse417 (bvadd v_prenex_154 v_prenex_156)) (.cse419 (bvadd v_prenex_156 (_ bv8 32))) (.cse421 (bvadd v_prenex_156 (_ bv4 32))) (.cse422 (store |c_#length| v_prenex_153 v_prenex_157))) (or (not (bvsle .cse417 .cse418)) (not (bvsle .cse419 .cse420)) (not (bvsle (_ bv0 32) v_prenex_156)) (= v_arrayElimCell_58 c_main_~x~0.base) (bvsle .cse421 (select .cse422 v_prenex_155)) (not (bvsle .cse420 .cse418)) (not (bvsle v_prenex_156 .cse417)) (not (= (select |c_#valid| v_prenex_153) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse419)) (bvsle .cse421 (select .cse422 v_arrayElimCell_58))))))))) is different from true [2018-11-10 10:28:09,014 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 46 [2018-11-10 10:28:09,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-11-10 10:28:09,079 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:28:09,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:09,088 INFO L477 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 29 treesize of output 20 [2018-11-10 10:28:09,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:09,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:09,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:09,173 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 18 variables, input treesize:209, output treesize:16 [2018-11-10 10:28:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-10 10:28:09,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:28:09,527 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/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-11-10 10:28:09,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:09,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:10,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:28:10,197 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:28:10,197 INFO L477 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-11-10 10:28:10,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:10,222 INFO L477 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-11-10 10:28:10,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:10,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:10,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2018-11-10 10:28:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:28:10,379 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:28:10,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:28:10,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 12] total 29 [2018-11-10 10:28:10,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-10 10:28:10,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-10 10:28:10,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=690, Unknown=1, NotChecked=54, Total=870 [2018-11-10 10:28:10,397 INFO L87 Difference]: Start difference. First operand 256 states and 300 transitions. Second operand 30 states. [2018-11-10 10:28:13,447 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse80 (= |c_main_write~$Pointer$_#value.base| c_main_~x~0.base)) (.cse1 (= |c_main_write~$Pointer$_#ptr.base| c_main_~x~0.base)) (.cse0 (= c_main_~x~0.offset |c_main_write~$Pointer$_#ptr.offset|))) (let ((.cse69 (not .cse0)) (.cse8 (not .cse1)) (.cse215 (select |c_#valid| |c_main_write~$Pointer$_#ptr.base|)) (.cse286 (not .cse80))) (and (or .cse0 .cse1 (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_prenex_70 (_ BitVec 32)) (v_prenex_71 (_ BitVec 32)) (v_prenex_67 (_ BitVec 32)) (v_prenex_68 (_ BitVec 32)) (v_prenex_69 (_ BitVec 32))) (let ((.cse4 (bvadd v_prenex_71 (_ bv8 32))) (.cse6 (bvadd v_prenex_67 v_prenex_71)) (.cse2 (bvadd v_prenex_71 (_ bv4 32))) (.cse3 (store |c_#length| v_prenex_69 v_prenex_68)) (.cse5 (bvadd v_prenex_71 (_ bv12 32))) (.cse7 (select |c_#length| v_arrayElimCell_32))) (or (bvsle .cse2 (select .cse3 v_arrayElimCell_32)) (not (bvsle .cse4 .cse5)) (not (bvsle .cse6 .cse7)) (not (= (select |c_#valid| v_prenex_69) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse4)) (not (bvsle v_prenex_71 .cse6)) (bvsle .cse2 (select .cse3 v_prenex_70)) (not (bvsle .cse5 .cse7)) (= v_arrayElimCell_32 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_71)))))) (or .cse0 .cse8 (forall ((v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_317 (_ BitVec 32)) (v_prenex_316 (_ BitVec 32)) (v_prenex_315 (_ BitVec 32)) (v_prenex_314 (_ BitVec 32))) (let ((.cse11 (select |c_#length| v_arrayElimCell_112)) (.cse9 (bvadd v_prenex_315 (_ bv8 32))) (.cse10 (bvadd v_prenex_315 (_ bv12 32))) (.cse12 (bvadd v_prenex_317 v_prenex_315))) (or (not (bvsle (_ bv0 32) .cse9)) (bvsle (bvadd v_prenex_315 (_ bv4 32)) (select (store |c_#length| v_prenex_314 v_prenex_316) v_arrayElimCell_112)) (not (= (select |c_#valid| v_prenex_314) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_315)) (not (bvsle .cse10 .cse11)) (not (bvsle .cse12 .cse11)) (not (bvsle .cse9 .cse10)) (not (bvsle v_prenex_315 .cse12)))))) (or .cse0 .cse1 (forall ((v_prenex_63 (_ BitVec 32)) (v_prenex_64 (_ BitVec 32)) (v_prenex_65 (_ BitVec 32)) (v_prenex_66 (_ BitVec 32)) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse13 (bvadd v_prenex_63 v_prenex_66)) (.cse15 (select |c_#length| v_arrayElimCell_176)) (.cse14 (bvadd v_prenex_66 (_ bv8 32))) (.cse16 (bvadd v_prenex_66 (_ bv12 32)))) (or (not (= (select |c_#valid| v_prenex_65) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_66)) (not (bvsle v_prenex_66 .cse13)) (not (bvsle (_ bv0 32) .cse14)) (bvsle (bvadd v_prenex_66 (_ bv4 32)) (select (store |c_#length| v_prenex_65 v_prenex_64) v_arrayElimCell_176)) (not (bvsle .cse13 .cse15)) (not (bvsle .cse16 .cse15)) (not (bvsle .cse14 .cse16)))))) (or .cse0 .cse8 (forall ((v_arrayElimCell_205 (_ BitVec 32)) (v_prenex_113 (_ BitVec 32)) (v_prenex_112 (_ BitVec 32)) (v_prenex_111 (_ BitVec 32)) (v_prenex_110 (_ BitVec 32))) (let ((.cse19 (bvadd v_prenex_112 (_ bv8 32))) (.cse17 (bvadd v_prenex_110 v_prenex_112)) (.cse20 (bvadd v_prenex_112 (_ bv12 32))) (.cse18 (select |c_#length| v_arrayElimCell_205))) (or (not (bvsle .cse17 .cse18)) (not (bvsle .cse19 .cse20)) (not (bvsle (_ bv0 32) .cse19)) (not (bvsle (_ bv0 32) v_prenex_112)) (not (= (select |c_#valid| v_prenex_111) (_ bv0 1))) (bvsle (bvadd v_prenex_112 (_ bv4 32)) (select (store |c_#length| v_prenex_111 v_prenex_113) v_arrayElimCell_205)) (not (bvsle v_prenex_112 .cse17)) (not (bvsle .cse20 .cse18)) (= v_arrayElimCell_205 c_main_~x~0.base))))) (or .cse0 .cse1 (forall ((v_prenex_373 (_ BitVec 32)) (v_prenex_372 (_ BitVec 32)) (v_prenex_371 (_ BitVec 32)) (v_arrayElimCell_159 (_ BitVec 32)) (v_prenex_375 (_ BitVec 32)) (v_prenex_374 (_ BitVec 32))) (let ((.cse22 (select |c_#length| v_arrayElimCell_159)) (.cse25 (bvadd v_prenex_374 (_ bv8 32))) (.cse26 (bvadd v_prenex_374 (_ bv12 32))) (.cse21 (bvadd v_prenex_375 v_prenex_374)) (.cse23 (bvadd v_prenex_374 (_ bv4 32))) (.cse24 (store |c_#length| v_prenex_373 v_prenex_372))) (or (not (bvsle .cse21 .cse22)) (bvsle .cse23 (select .cse24 v_prenex_371)) (not (bvsle (_ bv0 32) .cse25)) (= v_arrayElimCell_159 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_373) (_ bv0 1))) (not (bvsle .cse26 .cse22)) (not (bvsle .cse25 .cse26)) (not (bvsle v_prenex_374 .cse21)) (not (bvsle (_ bv0 32) v_prenex_374)) (bvsle .cse23 (select .cse24 v_arrayElimCell_159)))))) (or .cse0 (forall ((v_prenex_80 (_ BitVec 32)) (v_prenex_81 (_ BitVec 32)) (v_arrayElimCell_77 (_ BitVec 32)) (v_prenex_77 (_ BitVec 32)) (v_prenex_78 (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (let ((.cse27 (bvadd v_prenex_80 (_ bv8 32))) (.cse29 (bvadd v_prenex_77 v_prenex_80)) (.cse31 (bvadd v_prenex_80 (_ bv4 32))) (.cse32 (store |c_#length| v_prenex_78 v_prenex_81)) (.cse28 (bvadd v_prenex_80 (_ bv12 32))) (.cse30 (select |c_#length| v_arrayElimCell_77))) (or (not (bvsle (_ bv0 32) v_prenex_80)) (not (= (select |c_#valid| v_prenex_78) (_ bv0 1))) (= v_arrayElimCell_77 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse27)) (not (bvsle .cse27 .cse28)) (not (bvsle .cse29 .cse30)) (bvsle .cse31 (select .cse32 v_arrayElimCell_77)) (not (bvsle v_prenex_80 .cse29)) (bvsle .cse31 (select .cse32 v_prenex_79)) (not (bvsle .cse28 .cse30))))) .cse1) (or .cse0 .cse1 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_prenex_291 (_ BitVec 32)) (v_prenex_290 (_ BitVec 32)) (v_prenex_289 (_ BitVec 32)) (v_prenex_288 (_ BitVec 32)) (v_prenex_287 (_ BitVec 32))) (let ((.cse37 (select |c_#length| v_arrayElimCell_35)) (.cse36 (bvadd v_prenex_291 v_prenex_289)) (.cse35 (bvadd v_prenex_289 (_ bv8 32))) (.cse38 (bvadd v_prenex_289 (_ bv12 32))) (.cse33 (bvadd v_prenex_289 (_ bv4 32))) (.cse34 (store |c_#length| v_prenex_287 v_prenex_290))) (or (bvsle .cse33 (select .cse34 v_arrayElimCell_35)) (not (bvsle (_ bv0 32) .cse35)) (not (bvsle .cse36 .cse37)) (not (bvsle .cse38 .cse37)) (not (bvsle v_prenex_289 .cse36)) (not (= (select |c_#valid| v_prenex_287) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_289)) (= v_arrayElimCell_35 c_main_~x~0.base) (not (bvsle .cse35 .cse38)) (bvsle .cse33 (select .cse34 v_prenex_288)))))) (or (forall ((v_prenex_319 (_ BitVec 32)) (v_prenex_318 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_prenex_322 (_ BitVec 32)) (v_prenex_321 (_ BitVec 32)) (v_prenex_320 (_ BitVec 32))) (let ((.cse39 (bvadd v_prenex_322 v_prenex_320)) (.cse42 (bvadd v_prenex_320 (_ bv12 32))) (.cse40 (select |c_#length| v_arrayElimCell_182)) (.cse41 (bvadd v_prenex_320 (_ bv8 32))) (.cse43 (bvadd v_prenex_320 (_ bv4 32))) (.cse44 (store |c_#length| v_prenex_318 v_prenex_321))) (or (not (bvsle .cse39 .cse40)) (not (bvsle .cse41 .cse42)) (not (= (select |c_#valid| v_prenex_318) (_ bv0 1))) (bvsle .cse43 (select .cse44 v_arrayElimCell_182)) (= v_arrayElimCell_182 c_main_~x~0.base) (not (bvsle v_prenex_320 .cse39)) (not (bvsle .cse42 .cse40)) (not (bvsle (_ bv0 32) v_prenex_320)) (not (bvsle (_ bv0 32) .cse41)) (bvsle .cse43 (select .cse44 v_prenex_319))))) .cse1) (or (forall ((v_arrayElimCell_66 (_ BitVec 32)) (v_prenex_339 (_ BitVec 32)) (v_prenex_338 (_ BitVec 32)) (v_prenex_337 (_ BitVec 32)) (v_prenex_336 (_ BitVec 32))) (let ((.cse45 (bvadd v_prenex_339 v_prenex_337)) (.cse46 (select |c_#length| v_arrayElimCell_66)) (.cse47 (bvadd v_prenex_337 (_ bv8 32))) (.cse48 (bvadd v_prenex_337 (_ bv12 32)))) (or (not (bvsle v_prenex_337 .cse45)) (not (bvsle .cse45 .cse46)) (not (= (select |c_#valid| v_prenex_336) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_337)) (not (bvsle (_ bv0 32) .cse47)) (bvsle (bvadd v_prenex_337 (_ bv4 32)) (select (store |c_#length| v_prenex_336 v_prenex_338) v_arrayElimCell_66)) (not (bvsle .cse48 .cse46)) (not (bvsle .cse47 .cse48))))) .cse0 .cse1) (or .cse0 .cse1 (forall ((v_arrayElimCell_167 (_ BitVec 32)) (v_prenex_142 (_ BitVec 32)) (v_prenex_141 (_ BitVec 32)) (v_prenex_140 (_ BitVec 32)) (v_prenex_144 (_ BitVec 32)) (v_prenex_143 (_ BitVec 32))) (let ((.cse52 (bvadd v_prenex_143 (_ bv12 32))) (.cse50 (select |c_#length| v_arrayElimCell_167)) (.cse49 (bvadd v_prenex_141 v_prenex_143)) (.cse51 (bvadd v_prenex_143 (_ bv8 32))) (.cse53 (bvadd v_prenex_143 (_ bv4 32))) (.cse54 (store |c_#length| v_prenex_140 v_prenex_144))) (or (not (bvsle .cse49 .cse50)) (not (bvsle .cse51 .cse52)) (bvsle .cse53 (select .cse54 v_arrayElimCell_167)) (not (bvsle .cse52 .cse50)) (not (bvsle v_prenex_143 .cse49)) (not (bvsle (_ bv0 32) .cse51)) (not (bvsle (_ bv0 32) v_prenex_143)) (not (= (select |c_#valid| v_prenex_140) (_ bv0 1))) (bvsle .cse53 (select .cse54 v_prenex_142)))))) (or .cse0 (forall ((v_prenex_186 (_ BitVec 32)) (v_prenex_189 (_ BitVec 32)) (v_prenex_13 (_ BitVec 32)) (v_prenex_188 (_ BitVec 32)) (v_prenex_187 (_ BitVec 32))) (let ((.cse55 (bvadd v_prenex_187 v_prenex_188)) (.cse57 (bvadd v_prenex_188 (_ bv12 32))) (.cse58 (select |c_#length| v_prenex_13)) (.cse56 (bvadd v_prenex_188 (_ bv8 32)))) (or (not (bvsle v_prenex_188 .cse55)) (not (bvsle .cse56 .cse57)) (not (bvsle .cse55 .cse58)) (not (bvsle (_ bv0 32) v_prenex_188)) (= v_prenex_13 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_186) (_ bv0 1))) (not (bvsle .cse57 .cse58)) (bvsle (bvadd v_prenex_188 (_ bv4 32)) (select (store |c_#length| v_prenex_186 v_prenex_189) v_prenex_13)) (not (bvsle (_ bv0 32) .cse56))))) .cse1) (or (forall ((v_prenex_104 (_ BitVec 32)) (v_prenex_103 (_ BitVec 32)) (v_prenex_102 (_ BitVec 32)) (v_prenex_101 (_ BitVec 32)) (v_prenex_100 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (let ((.cse59 (bvadd v_prenex_100 v_prenex_103)) (.cse61 (select |c_#length| v_arrayElimCell_155)) (.cse62 (bvadd v_prenex_103 (_ bv4 32))) (.cse63 (store |c_#length| v_prenex_101 v_prenex_104)) (.cse64 (bvadd v_prenex_103 (_ bv8 32))) (.cse60 (bvadd v_prenex_103 (_ bv12 32)))) (or (not (bvsle v_prenex_103 .cse59)) (not (bvsle .cse60 .cse61)) (not (bvsle .cse59 .cse61)) (bvsle .cse62 (select .cse63 v_prenex_102)) (not (bvsle (_ bv0 32) v_prenex_103)) (bvsle .cse62 (select .cse63 v_arrayElimCell_155)) (not (= (select |c_#valid| v_prenex_101) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse64)) (not (bvsle .cse64 .cse60))))) .cse1) (or .cse0 .cse8 (forall ((v_arrayElimCell_207 (_ BitVec 32)) (v_prenex_256 (_ BitVec 32)) (v_prenex_255 (_ BitVec 32)) (v_prenex_254 (_ BitVec 32)) (v_prenex_253 (_ BitVec 32))) (let ((.cse67 (bvadd v_prenex_254 (_ bv12 32))) (.cse65 (bvadd v_prenex_256 v_prenex_254)) (.cse68 (select |c_#length| v_arrayElimCell_207)) (.cse66 (bvadd v_prenex_254 (_ bv8 32)))) (or (not (bvsle v_prenex_254 .cse65)) (not (bvsle (_ bv0 32) v_prenex_254)) (not (bvsle .cse66 .cse67)) (not (= (select |c_#valid| v_prenex_253) (_ bv0 1))) (not (bvsle .cse67 .cse68)) (bvsle (bvadd v_prenex_254 (_ bv4 32)) (select (store |c_#length| v_prenex_253 v_prenex_255) v_arrayElimCell_207)) (not (bvsle .cse65 .cse68)) (not (bvsle (_ bv0 32) .cse66)))))) (or .cse8 .cse69 (forall ((v_prenex_361 (_ BitVec 32)) (v_prenex_360 (_ BitVec 32)) (v_prenex_359 (_ BitVec 32)) (v_prenex_358 (_ BitVec 32))) (let ((.cse72 (bvadd v_prenex_360 (_ bv12 32))) (.cse70 (bvadd v_prenex_361 v_prenex_360)) (.cse73 (select |c_#length| |c_main_write~$Pointer$_#value.base|)) (.cse71 (bvadd v_prenex_360 (_ bv8 32)))) (or (not (bvsle v_prenex_360 .cse70)) (not (bvsle .cse71 .cse72)) (not (bvsle .cse72 .cse73)) (not (bvsle (_ bv0 32) v_prenex_360)) (bvsle (bvadd v_prenex_360 (_ bv4 32)) (select (store |c_#length| v_prenex_359 v_prenex_358) |c_main_write~$Pointer$_#value.base|)) (not (= (select |c_#valid| v_prenex_359) (_ bv0 1))) (not (bvsle .cse70 .cse73)) (not (bvsle (_ bv0 32) .cse71)))))) (or (forall ((v_arrayElimCell_201 (_ BitVec 32)) (v_prenex_219 (_ BitVec 32)) (v_prenex_218 (_ BitVec 32)) (v_prenex_217 (_ BitVec 32)) (v_prenex_216 (_ BitVec 32)) (v_prenex_220 (_ BitVec 32))) (let ((.cse75 (bvadd v_prenex_218 (_ bv4 32))) (.cse76 (store |c_#length| v_prenex_216 v_prenex_219)) (.cse74 (bvadd v_prenex_220 v_prenex_218)) (.cse78 (select |c_#length| v_arrayElimCell_201)) (.cse79 (bvadd v_prenex_218 (_ bv8 32))) (.cse77 (bvadd v_prenex_218 (_ bv12 32)))) (or (not (bvsle v_prenex_218 .cse74)) (bvsle .cse75 (select .cse76 v_arrayElimCell_201)) (= v_arrayElimCell_201 c_main_~x~0.base) (bvsle .cse75 (select .cse76 v_prenex_217)) (not (bvsle (_ bv0 32) v_prenex_218)) (not (bvsle .cse77 .cse78)) (not (bvsle .cse74 .cse78)) (not (= (select |c_#valid| v_prenex_216) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse79)) (not (bvsle .cse79 .cse77))))) .cse1) (or .cse80 .cse0 .cse8 (forall ((v_prenex_340 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_343 (_ BitVec 32)) (v_prenex_342 (_ BitVec 32)) (v_prenex_341 (_ BitVec 32))) (let ((.cse81 (bvadd v_prenex_343 v_prenex_341)) (.cse83 (bvadd v_prenex_341 (_ bv8 32))) (.cse84 (bvadd v_prenex_341 (_ bv12 32))) (.cse82 (select |c_#length| v_arrayElimCell_109))) (or (bvsle (bvadd v_prenex_341 (_ bv4 32)) (select (store |c_#length| v_prenex_340 v_prenex_342) v_arrayElimCell_109)) (not (bvsle .cse81 .cse82)) (not (bvsle (_ bv0 32) .cse83)) (not (bvsle v_prenex_341 .cse81)) (not (bvsle (_ bv0 32) v_prenex_341)) (not (bvsle .cse83 .cse84)) (not (= (select |c_#valid| v_prenex_340) (_ bv0 1))) (= v_arrayElimCell_109 c_main_~x~0.base) (not (bvsle .cse84 .cse82)))))) (or .cse1 (forall ((v_prenex_263 (_ BitVec 32)) (v_prenex_262 (_ BitVec 32)) (v_prenex_261 (_ BitVec 32)) (v_arrayElimCell_133 (_ BitVec 32)) (v_prenex_264 (_ BitVec 32))) (let ((.cse86 (select |c_#length| v_arrayElimCell_133)) (.cse88 (bvadd v_prenex_264 v_prenex_262)) (.cse87 (bvadd v_prenex_262 (_ bv8 32))) (.cse85 (bvadd v_prenex_262 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_262)) (not (bvsle .cse85 .cse86)) (not (bvsle (_ bv0 32) .cse87)) (not (bvsle .cse88 .cse86)) (not (bvsle v_prenex_262 .cse88)) (= v_arrayElimCell_133 c_main_~x~0.base) (not (bvsle .cse87 .cse85)) (bvsle (bvadd v_prenex_262 (_ bv4 32)) (select (store |c_#length| v_prenex_261 v_prenex_263) v_arrayElimCell_133)) (not (= (select |c_#valid| v_prenex_261) (_ bv0 1))))))) (or .cse80 .cse0 .cse1 (forall ((v_arrayElimCell_125 (_ BitVec 32)) (v_prenex_234 (_ BitVec 32)) (v_prenex_233 (_ BitVec 32)) (v_prenex_232 (_ BitVec 32)) (v_prenex_231 (_ BitVec 32))) (let ((.cse90 (bvadd v_prenex_232 (_ bv12 32))) (.cse89 (bvadd v_prenex_232 (_ bv8 32))) (.cse91 (select |c_#length| v_arrayElimCell_125)) (.cse92 (bvadd v_prenex_234 v_prenex_232))) (or (not (= (select |c_#valid| v_prenex_231) (_ bv0 1))) (not (bvsle .cse89 .cse90)) (not (bvsle .cse90 .cse91)) (not (bvsle (_ bv0 32) .cse89)) (= v_arrayElimCell_125 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_232)) (not (bvsle .cse92 .cse91)) (bvsle (bvadd v_prenex_232 (_ bv4 32)) (select (store |c_#length| v_prenex_231 v_prenex_233) v_arrayElimCell_125)) (not (bvsle v_prenex_232 .cse92)))))) (or .cse0 .cse1 (forall ((v_prenex_274 (_ BitVec 32)) (v_arrayElimCell_102 (_ BitVec 32)) (v_prenex_277 (_ BitVec 32)) (v_prenex_276 (_ BitVec 32)) (v_prenex_275 (_ BitVec 32))) (let ((.cse94 (bvadd v_prenex_275 (_ bv12 32))) (.cse93 (bvadd v_prenex_275 (_ bv8 32))) (.cse95 (bvadd v_prenex_277 v_prenex_275)) (.cse96 (select |c_#length| v_arrayElimCell_102))) (or (not (bvsle .cse93 .cse94)) (not (bvsle v_prenex_275 .cse95)) (not (bvsle .cse94 .cse96)) (bvsle (bvadd v_prenex_275 (_ bv4 32)) (select (store |c_#length| v_prenex_274 v_prenex_276) v_arrayElimCell_102)) (not (bvsle (_ bv0 32) .cse93)) (not (= (select |c_#valid| v_prenex_274) (_ bv0 1))) (not (bvsle .cse95 .cse96)) (not (bvsle (_ bv0 32) v_prenex_275)))))) (or .cse80 .cse0 .cse1 (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_prenex_296 (_ BitVec 32)) (v_prenex_295 (_ BitVec 32)) (v_prenex_294 (_ BitVec 32)) (v_prenex_293 (_ BitVec 32)) (v_prenex_292 (_ BitVec 32))) (let ((.cse100 (select |c_#length| v_arrayElimCell_46)) (.cse99 (bvadd v_prenex_294 (_ bv12 32))) (.cse101 (bvadd v_prenex_296 v_prenex_294)) (.cse102 (bvadd v_prenex_294 (_ bv8 32))) (.cse97 (bvadd v_prenex_294 (_ bv4 32))) (.cse98 (store |c_#length| v_prenex_292 v_prenex_295))) (or (not (= (select |c_#valid| v_prenex_292) (_ bv0 1))) (bvsle .cse97 (select .cse98 v_arrayElimCell_46)) (not (bvsle (_ bv0 32) v_prenex_294)) (not (bvsle .cse99 .cse100)) (not (bvsle .cse101 .cse100)) (= v_arrayElimCell_46 c_main_~x~0.base) (not (bvsle .cse102 .cse99)) (not (bvsle v_prenex_294 .cse101)) (not (bvsle (_ bv0 32) .cse102)) (bvsle .cse97 (select .cse98 v_prenex_293)))))) (or .cse80 (forall ((v_prenex_370 (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_369 (_ BitVec 32)) (v_prenex_368 (_ BitVec 32)) (v_prenex_367 (_ BitVec 32))) (let ((.cse104 (bvadd v_prenex_369 (_ bv8 32))) (.cse103 (bvadd v_prenex_370 v_prenex_369)) (.cse105 (bvadd v_prenex_369 (_ bv12 32))) (.cse106 (select |c_#length| v_prenex_16))) (or (not (= (select |c_#valid| v_prenex_368) (_ bv0 1))) (= v_prenex_16 c_main_~x~0.base) (not (bvsle v_prenex_369 .cse103)) (not (bvsle .cse104 .cse105)) (bvsle (bvadd v_prenex_369 (_ bv4 32)) (select (store |c_#length| v_prenex_368 v_prenex_367) v_prenex_16)) (not (bvsle (_ bv0 32) .cse104)) (not (bvsle (_ bv0 32) v_prenex_369)) (not (bvsle .cse103 .cse106)) (not (bvsle .cse105 .cse106))))) .cse0 .cse1) (or (forall ((v_prenex_209 (_ BitVec 32)) (v_prenex_208 (_ BitVec 32)) (v_prenex_207 (_ BitVec 32)) (v_arrayElimCell_195 (_ BitVec 32)) (v_prenex_210 (_ BitVec 32))) (let ((.cse107 (bvadd v_prenex_210 v_prenex_208)) (.cse109 (select |c_#length| v_arrayElimCell_195)) (.cse108 (bvadd v_prenex_208 (_ bv8 32))) (.cse110 (bvadd v_prenex_208 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_208)) (not (bvsle v_prenex_208 .cse107)) (= v_arrayElimCell_195 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse108)) (not (bvsle .cse107 .cse109)) (bvsle (bvadd v_prenex_208 (_ bv4 32)) (select (store |c_#length| v_prenex_207 v_prenex_209) v_arrayElimCell_195)) (not (= (select |c_#valid| v_prenex_207) (_ bv0 1))) (not (bvsle .cse110 .cse109)) (not (bvsle .cse108 .cse110))))) .cse1) (or .cse0 .cse1 (forall ((v_prenex_84 (_ BitVec 32)) (v_prenex_85 (_ BitVec 32)) (v_arrayElimCell_49 (_ BitVec 32)) (v_prenex_82 (_ BitVec 32)) (v_prenex_83 (_ BitVec 32))) (let ((.cse113 (bvadd v_prenex_82 v_prenex_84)) (.cse112 (select |c_#length| v_arrayElimCell_49)) (.cse114 (bvadd v_prenex_84 (_ bv8 32))) (.cse111 (bvadd v_prenex_84 (_ bv12 32)))) (or (not (bvsle .cse111 .cse112)) (not (bvsle v_prenex_84 .cse113)) (not (bvsle .cse113 .cse112)) (= v_arrayElimCell_49 c_main_~x~0.base) (bvsle (bvadd v_prenex_84 (_ bv4 32)) (select (store |c_#length| v_prenex_83 v_prenex_85) v_arrayElimCell_49)) (not (bvsle (_ bv0 32) v_prenex_84)) (not (bvsle (_ bv0 32) .cse114)) (not (bvsle .cse114 .cse111)) (not (= (select |c_#valid| v_prenex_83) (_ bv0 1))))))) (or .cse0 .cse1 (forall ((v_prenex_348 (_ BitVec 32)) (v_prenex_347 (_ BitVec 32)) (v_prenex_346 (_ BitVec 32)) (v_prenex_345 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_344 (_ BitVec 32))) (let ((.cse117 (select |c_#length| v_prenex_4)) (.cse118 (bvadd v_prenex_346 (_ bv4 32))) (.cse119 (store |c_#length| v_prenex_344 v_prenex_347)) (.cse116 (bvadd v_prenex_348 v_prenex_346)) (.cse115 (bvadd v_prenex_346 (_ bv8 32))) (.cse120 (bvadd v_prenex_346 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_346)) (not (bvsle (_ bv0 32) .cse115)) (not (bvsle .cse116 .cse117)) (not (= (select |c_#valid| v_prenex_344) (_ bv0 1))) (bvsle .cse118 (select .cse119 v_prenex_345)) (not (bvsle .cse120 .cse117)) (bvsle .cse118 (select .cse119 v_prenex_4)) (not (bvsle v_prenex_346 .cse116)) (not (bvsle .cse115 .cse120)) (= v_prenex_4 c_main_~x~0.base))))) (or .cse80 .cse1 (forall ((v_prenex_409 (_ BitVec 32)) (v_prenex_408 (_ BitVec 32)) (v_prenex_407 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32)) (v_prenex_411 (_ BitVec 32)) (v_prenex_410 (_ BitVec 32))) (let ((.cse124 (bvadd v_prenex_411 v_prenex_410)) (.cse125 (select |c_#length| v_prenex_28)) (.cse121 (bvadd v_prenex_410 (_ bv4 32))) (.cse122 (store |c_#length| v_prenex_409 v_prenex_408)) (.cse123 (bvadd v_prenex_410 (_ bv8 32))) (.cse126 (bvadd v_prenex_410 (_ bv12 32)))) (or (bvsle .cse121 (select .cse122 v_prenex_28)) (not (bvsle (_ bv0 32) .cse123)) (not (= (select |c_#valid| v_prenex_409) (_ bv0 1))) (not (bvsle .cse124 .cse125)) (not (bvsle v_prenex_410 .cse124)) (not (bvsle .cse126 .cse125)) (bvsle .cse121 (select .cse122 v_prenex_407)) (not (bvsle .cse123 .cse126)) (not (bvsle (_ bv0 32) v_prenex_410)))))) (= (bvadd (select |c_#valid| |c_main_write~$Pointer$_#value.base|) (_ bv1 1)) (_ bv0 1)) (or .cse0 (forall ((v_arrayElimCell_170 (_ BitVec 32)) (v_prenex_202 (_ BitVec 32)) (v_prenex_201 (_ BitVec 32)) (v_prenex_200 (_ BitVec 32)) (v_prenex_199 (_ BitVec 32))) (let ((.cse127 (bvadd v_prenex_202 v_prenex_200)) (.cse129 (bvadd v_prenex_200 (_ bv12 32))) (.cse130 (select |c_#length| v_arrayElimCell_170)) (.cse128 (bvadd v_prenex_200 (_ bv8 32)))) (or (= v_arrayElimCell_170 c_main_~x~0.base) (not (bvsle v_prenex_200 .cse127)) (bvsle (bvadd v_prenex_200 (_ bv4 32)) (select (store |c_#length| v_prenex_199 v_prenex_201) v_arrayElimCell_170)) (not (bvsle .cse128 .cse129)) (not (bvsle .cse127 .cse130)) (not (= (select |c_#valid| v_prenex_199) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_200)) (not (bvsle .cse129 .cse130)) (not (bvsle (_ bv0 32) .cse128))))) .cse1) (or .cse1 (forall ((v_arrayElimCell_192 (_ BitVec 32)) (v_prenex_402 (_ BitVec 32)) (v_prenex_401 (_ BitVec 32)) (v_prenex_400 (_ BitVec 32)) (v_prenex_399 (_ BitVec 32))) (let ((.cse132 (bvadd v_prenex_401 (_ bv12 32))) (.cse134 (bvadd v_prenex_402 v_prenex_401)) (.cse133 (select |c_#length| v_arrayElimCell_192)) (.cse131 (bvadd v_prenex_401 (_ bv8 32)))) (or (not (bvsle .cse131 .cse132)) (not (bvsle (_ bv0 32) v_prenex_401)) (not (bvsle .cse132 .cse133)) (not (bvsle v_prenex_401 .cse134)) (bvsle (bvadd v_prenex_401 (_ bv4 32)) (select (store |c_#length| v_prenex_400 v_prenex_399) v_arrayElimCell_192)) (not (bvsle .cse134 .cse133)) (not (= (select |c_#valid| v_prenex_400) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse131)))))) (or .cse80 .cse1 (forall ((v_prenex_86 (_ BitVec 32)) (v_prenex_87 (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_88 (_ BitVec 32)) (v_prenex_23 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (let ((.cse135 (bvadd v_prenex_86 v_prenex_89)) (.cse137 (bvadd v_prenex_89 (_ bv4 32))) (.cse138 (store |c_#length| v_prenex_87 v_prenex_90)) (.cse139 (bvadd v_prenex_89 (_ bv8 32))) (.cse140 (bvadd v_prenex_89 (_ bv12 32))) (.cse136 (select |c_#length| v_prenex_23))) (or (not (bvsle .cse135 .cse136)) (= v_prenex_23 c_main_~x~0.base) (bvsle .cse137 (select .cse138 v_prenex_23)) (not (bvsle .cse139 .cse140)) (not (bvsle v_prenex_89 .cse135)) (bvsle .cse137 (select .cse138 v_prenex_88)) (not (bvsle (_ bv0 32) v_prenex_89)) (not (bvsle (_ bv0 32) .cse139)) (not (bvsle .cse140 .cse136)) (not (= (select |c_#valid| v_prenex_87) (_ bv0 1))))))) (or .cse80 .cse8 (forall ((v_prenex_268 (_ BitVec 32)) (v_prenex_267 (_ BitVec 32)) (v_prenex_266 (_ BitVec 32)) (v_prenex_265 (_ BitVec 32))) (let ((.cse143 (bvadd v_prenex_266 (_ bv8 32))) (.cse141 (bvadd v_prenex_266 (_ bv12 32))) (.cse144 (bvadd v_prenex_268 v_prenex_266)) (.cse142 (select |c_#length| |c_main_write~$Pointer$_#value.base|))) (or (not (bvsle .cse141 .cse142)) (not (= (select |c_#valid| v_prenex_265) (_ bv0 1))) (bvsle (bvadd v_prenex_266 (_ bv4 32)) (select (store |c_#length| v_prenex_265 v_prenex_267) |c_main_write~$Pointer$_#value.base|)) (not (bvsle (_ bv0 32) .cse143)) (not (bvsle (_ bv0 32) v_prenex_266)) (not (bvsle v_prenex_266 .cse144)) (not (bvsle .cse143 .cse141)) (not (bvsle .cse144 .cse142))))) .cse69) (or .cse0 .cse1 (forall ((v_prenex_273 (_ BitVec 32)) (v_prenex_272 (_ BitVec 32)) (v_prenex_271 (_ BitVec 32)) (v_prenex_270 (_ BitVec 32)) (v_prenex_269 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse145 (bvadd v_prenex_271 (_ bv12 32))) (.cse148 (bvadd v_prenex_271 (_ bv4 32))) (.cse149 (store |c_#length| v_prenex_269 v_prenex_272)) (.cse150 (bvadd v_prenex_271 (_ bv8 32))) (.cse147 (bvadd v_prenex_273 v_prenex_271)) (.cse146 (select |c_#length| v_prenex_11))) (or (not (bvsle .cse145 .cse146)) (not (= (select |c_#valid| v_prenex_269) (_ bv0 1))) (= v_prenex_11 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_271)) (not (bvsle v_prenex_271 .cse147)) (bvsle .cse148 (select .cse149 v_prenex_11)) (not (bvsle .cse150 .cse145)) (bvsle .cse148 (select .cse149 v_prenex_270)) (not (bvsle (_ bv0 32) .cse150)) (not (bvsle .cse147 .cse146)))))) (or .cse80 .cse0 .cse1 (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_126 (_ BitVec 32)) (v_prenex_125 (_ BitVec 32)) (v_prenex_124 (_ BitVec 32)) (v_prenex_123 (_ BitVec 32))) (let ((.cse151 (bvadd v_prenex_124 v_prenex_125)) (.cse152 (select |c_#length| v_prenex_15)) (.cse154 (bvadd v_prenex_125 (_ bv8 32))) (.cse153 (bvadd v_prenex_125 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_125)) (bvsle (bvadd v_prenex_125 (_ bv4 32)) (select (store |c_#length| v_prenex_123 v_prenex_126) v_prenex_15)) (not (bvsle v_prenex_125 .cse151)) (not (bvsle .cse151 .cse152)) (not (= (select |c_#valid| v_prenex_123) (_ bv0 1))) (not (bvsle .cse153 .cse152)) (not (bvsle (_ bv0 32) .cse154)) (not (bvsle .cse154 .cse153)))))) (or .cse0 .cse1 (forall ((v_prenex_194 (_ BitVec 32)) (v_prenex_193 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32)) (v_prenex_192 (_ BitVec 32)) (v_prenex_191 (_ BitVec 32)) (v_prenex_190 (_ BitVec 32))) (let ((.cse155 (bvadd v_prenex_192 (_ bv12 32))) (.cse159 (bvadd v_prenex_192 (_ bv8 32))) (.cse157 (bvadd v_prenex_192 (_ bv4 32))) (.cse158 (store |c_#length| v_prenex_190 v_prenex_193)) (.cse160 (bvadd v_prenex_194 v_prenex_192)) (.cse156 (select |c_#length| v_arrayElimCell_43))) (or (not (bvsle .cse155 .cse156)) (not (bvsle (_ bv0 32) v_prenex_192)) (bvsle .cse157 (select .cse158 v_arrayElimCell_43)) (= v_arrayElimCell_43 c_main_~x~0.base) (not (bvsle .cse159 .cse155)) (not (bvsle (_ bv0 32) .cse159)) (not (bvsle v_prenex_192 .cse160)) (not (= (select |c_#valid| v_prenex_190) (_ bv0 1))) (bvsle .cse157 (select .cse158 v_prenex_191)) (not (bvsle .cse160 .cse156)))))) (= (_ bv0 32) c_main_~head~0.offset) (or (forall ((v_prenex_30 (_ BitVec 32)) (v_prenex_313 (_ BitVec 32)) (v_prenex_312 (_ BitVec 32)) (v_prenex_311 (_ BitVec 32)) (v_prenex_310 (_ BitVec 32))) (let ((.cse161 (bvadd v_prenex_313 v_prenex_311)) (.cse162 (select |c_#length| v_prenex_30)) (.cse163 (bvadd v_prenex_311 (_ bv8 32))) (.cse164 (bvadd v_prenex_311 (_ bv12 32)))) (or (= v_prenex_30 c_main_~x~0.base) (not (bvsle .cse161 .cse162)) (not (bvsle v_prenex_311 .cse161)) (not (= (select |c_#valid| v_prenex_310) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse163)) (not (bvsle (_ bv0 32) v_prenex_311)) (not (bvsle .cse164 .cse162)) (bvsle (bvadd v_prenex_311 (_ bv4 32)) (select (store |c_#length| v_prenex_310 v_prenex_312) v_prenex_30)) (not (bvsle .cse163 .cse164))))) .cse1) (or .cse0 (forall ((v_arrayElimCell_117 (_ BitVec 32)) (v_prenex_326 (_ BitVec 32)) (v_prenex_325 (_ BitVec 32)) (v_prenex_324 (_ BitVec 32)) (v_prenex_323 (_ BitVec 32))) (let ((.cse165 (bvadd v_prenex_324 (_ bv8 32))) (.cse168 (bvadd v_prenex_324 (_ bv12 32))) (.cse167 (select |c_#length| v_arrayElimCell_117)) (.cse166 (bvadd v_prenex_326 v_prenex_324))) (or (not (bvsle (_ bv0 32) .cse165)) (not (bvsle (_ bv0 32) v_prenex_324)) (not (bvsle .cse166 .cse167)) (bvsle (bvadd v_prenex_324 (_ bv4 32)) (select (store |c_#length| v_prenex_323 v_prenex_325) v_arrayElimCell_117)) (not (= (select |c_#valid| v_prenex_323) (_ bv0 1))) (not (bvsle .cse165 .cse168)) (not (bvsle .cse168 .cse167)) (not (bvsle v_prenex_324 .cse166))))) .cse1) (or .cse80 (forall ((v_prenex_27 (_ BitVec 32)) (v_prenex_300 (_ BitVec 32)) (v_prenex_299 (_ BitVec 32)) (v_prenex_298 (_ BitVec 32)) (v_prenex_297 (_ BitVec 32))) (let ((.cse169 (bvadd v_prenex_300 v_prenex_298)) (.cse172 (bvadd v_prenex_298 (_ bv12 32))) (.cse170 (select |c_#length| v_prenex_27)) (.cse171 (bvadd v_prenex_298 (_ bv8 32)))) (or (bvsle (bvadd v_prenex_298 (_ bv4 32)) (select (store |c_#length| v_prenex_297 v_prenex_299) v_prenex_27)) (not (= (select |c_#valid| v_prenex_297) (_ bv0 1))) (not (bvsle v_prenex_298 .cse169)) (not (bvsle .cse169 .cse170)) (not (bvsle (_ bv0 32) v_prenex_298)) (not (bvsle .cse171 .cse172)) (not (bvsle .cse172 .cse170)) (not (bvsle (_ bv0 32) .cse171)) (= v_prenex_27 c_main_~x~0.base)))) .cse1) .cse0 (= (bvadd (select |c_#valid| c_main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (or .cse0 .cse1 (forall ((v_prenex_7 (_ BitVec 32)) (v_prenex_357 (_ BitVec 32)) (v_prenex_356 (_ BitVec 32)) (v_prenex_355 (_ BitVec 32)) (v_prenex_354 (_ BitVec 32)) (v_prenex_353 (_ BitVec 32))) (let ((.cse173 (bvadd v_prenex_356 (_ bv8 32))) (.cse174 (bvadd v_prenex_356 (_ bv12 32))) (.cse175 (bvadd v_prenex_356 (_ bv4 32))) (.cse176 (store |c_#length| v_prenex_355 v_prenex_354)) (.cse177 (bvadd v_prenex_357 v_prenex_356)) (.cse178 (select |c_#length| v_prenex_7))) (or (not (bvsle .cse173 .cse174)) (not (= (select |c_#valid| v_prenex_355) (_ bv0 1))) (bvsle .cse175 (select .cse176 v_prenex_7)) (= v_prenex_7 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse173)) (not (bvsle v_prenex_356 .cse177)) (not (bvsle .cse174 .cse178)) (not (bvsle (_ bv0 32) v_prenex_356)) (bvsle .cse175 (select .cse176 v_prenex_353)) (not (bvsle .cse177 .cse178)))))) (or .cse80 (forall ((v_prenex_51 (_ BitVec 32)) (v_prenex_52 (_ BitVec 32)) (v_prenex_50 (_ BitVec 32)) (v_prenex_49 (_ BitVec 32)) (v_prenex_33 (_ BitVec 32))) (let ((.cse180 (select |c_#length| v_prenex_33)) (.cse181 (bvadd v_prenex_49 v_prenex_52)) (.cse182 (bvadd v_prenex_52 (_ bv8 32))) (.cse179 (bvadd v_prenex_52 (_ bv12 32)))) (or (not (bvsle .cse179 .cse180)) (= v_prenex_33 c_main_~x~0.base) (not (bvsle .cse181 .cse180)) (not (bvsle v_prenex_52 .cse181)) (not (bvsle (_ bv0 32) .cse182)) (bvsle (bvadd v_prenex_52 (_ bv4 32)) (select (store |c_#length| v_prenex_50 v_prenex_51) v_prenex_33)) (not (= (select |c_#valid| v_prenex_50) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_52)) (not (bvsle .cse182 .cse179))))) .cse1) (or .cse1 (forall ((v_prenex_53 (_ BitVec 32)) (v_prenex_54 (_ BitVec 32)) (v_prenex_55 (_ BitVec 32)) (v_prenex_56 (_ BitVec 32)) (v_prenex_57 (_ BitVec 32))) (let ((.cse183 (bvadd v_prenex_57 (_ bv8 32))) (.cse184 (bvadd v_prenex_57 (_ bv12 32))) (.cse186 (bvadd v_prenex_53 v_prenex_57)) (.cse185 (select |c_#length| v_prenex_56))) (or (not (bvsle (_ bv0 32) .cse183)) (not (bvsle (_ bv0 32) v_prenex_57)) (not (bvsle .cse184 .cse185)) (bvsle (bvadd v_prenex_57 (_ bv4 32)) (select (store |c_#length| v_prenex_55 v_prenex_54) v_prenex_56)) (not (bvsle v_prenex_57 .cse186)) (not (bvsle .cse183 .cse184)) (not (= (select |c_#valid| v_prenex_55) (_ bv0 1))) (not (bvsle .cse186 .cse185)))))) (or .cse1 (forall ((v_prenex_109 (_ BitVec 32)) (v_prenex_108 (_ BitVec 32)) (v_prenex_107 (_ BitVec 32)) (v_prenex_106 (_ BitVec 32)) (v_prenex_26 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (let ((.cse187 (bvadd v_prenex_105 v_prenex_108)) (.cse189 (bvadd v_prenex_108 (_ bv8 32))) (.cse191 (bvadd v_prenex_108 (_ bv4 32))) (.cse192 (store |c_#length| v_prenex_106 v_prenex_109)) (.cse190 (bvadd v_prenex_108 (_ bv12 32))) (.cse188 (select |c_#length| v_prenex_26))) (or (not (bvsle .cse187 .cse188)) (not (= (select |c_#valid| v_prenex_106) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse189)) (not (bvsle (_ bv0 32) v_prenex_108)) (not (bvsle v_prenex_108 .cse187)) (not (bvsle .cse189 .cse190)) (bvsle .cse191 (select .cse192 v_prenex_26)) (bvsle .cse191 (select .cse192 v_prenex_107)) (not (bvsle .cse190 .cse188)))))) (or .cse80 (forall ((v_prenex_335 (_ BitVec 32)) (v_prenex_334 (_ BitVec 32)) (v_prenex_333 (_ BitVec 32)) (v_prenex_332 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse193 (bvadd v_prenex_333 (_ bv8 32))) (.cse194 (bvadd v_prenex_333 (_ bv12 32))) (.cse195 (select |c_#length| v_prenex_24)) (.cse196 (bvadd v_prenex_335 v_prenex_333))) (or (not (bvsle (_ bv0 32) .cse193)) (bvsle (bvadd v_prenex_333 (_ bv4 32)) (select (store |c_#length| v_prenex_332 v_prenex_334) v_prenex_24)) (not (= (select |c_#valid| v_prenex_332) (_ bv0 1))) (not (bvsle .cse194 .cse195)) (not (bvsle (_ bv0 32) v_prenex_333)) (not (bvsle .cse193 .cse194)) (not (bvsle .cse196 .cse195)) (not (bvsle v_prenex_333 .cse196))))) .cse1) (or (forall ((v_prenex_393 (_ BitVec 32)) (v_prenex_392 (_ BitVec 32)) (v_prenex_391 (_ BitVec 32)) (v_prenex_390 (_ BitVec 32)) (v_prenex_389 (_ BitVec 32)) (v_arrayElimCell_130 (_ BitVec 32))) (let ((.cse201 (bvadd v_prenex_392 (_ bv4 32))) (.cse202 (store |c_#length| v_prenex_391 v_prenex_390)) (.cse198 (bvadd v_prenex_393 v_prenex_392)) (.cse200 (select |c_#length| v_arrayElimCell_130)) (.cse197 (bvadd v_prenex_392 (_ bv8 32))) (.cse199 (bvadd v_prenex_392 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) .cse197)) (not (bvsle v_prenex_392 .cse198)) (not (bvsle .cse199 .cse200)) (not (= (select |c_#valid| v_prenex_391) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_392)) (= v_arrayElimCell_130 c_main_~x~0.base) (bvsle .cse201 (select .cse202 v_arrayElimCell_130)) (bvsle .cse201 (select .cse202 v_prenex_389)) (not (bvsle .cse198 .cse200)) (not (bvsle .cse197 .cse199))))) .cse1) (or .cse0 (forall ((v_prenex_282 (_ BitVec 32)) (v_prenex_281 (_ BitVec 32)) (v_prenex_280 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_279 (_ BitVec 32)) (v_prenex_278 (_ BitVec 32))) (let ((.cse203 (bvadd v_prenex_280 (_ bv8 32))) (.cse205 (bvadd v_prenex_280 (_ bv12 32))) (.cse206 (bvadd v_prenex_280 (_ bv4 32))) (.cse207 (store |c_#length| v_prenex_278 v_prenex_281)) (.cse204 (bvadd v_prenex_282 v_prenex_280)) (.cse208 (select |c_#length| v_prenex_8))) (or (not (bvsle (_ bv0 32) .cse203)) (not (bvsle v_prenex_280 .cse204)) (not (bvsle .cse203 .cse205)) (not (bvsle (_ bv0 32) v_prenex_280)) (bvsle .cse206 (select .cse207 v_prenex_8)) (not (= (select |c_#valid| v_prenex_278) (_ bv0 1))) (not (bvsle .cse205 .cse208)) (bvsle .cse206 (select .cse207 v_prenex_279)) (not (bvsle .cse204 .cse208))))) .cse1) (or .cse1 (forall ((v_prenex_73 (_ BitVec 32)) (v_prenex_74 (_ BitVec 32)) (v_prenex_75 (_ BitVec 32)) (v_prenex_76 (_ BitVec 32)) (v_prenex_72 (_ BitVec 32)) (v_arrayElimCell_198 (_ BitVec 32))) (let ((.cse212 (select |c_#length| v_arrayElimCell_198)) (.cse211 (bvadd v_prenex_72 v_prenex_75)) (.cse213 (bvadd v_prenex_75 (_ bv12 32))) (.cse214 (bvadd v_prenex_75 (_ bv8 32))) (.cse209 (bvadd v_prenex_75 (_ bv4 32))) (.cse210 (store |c_#length| v_prenex_73 v_prenex_76))) (or (bvsle .cse209 (select .cse210 v_arrayElimCell_198)) (not (bvsle .cse211 .cse212)) (not (bvsle .cse213 .cse212)) (not (bvsle (_ bv0 32) v_prenex_75)) (not (bvsle v_prenex_75 .cse211)) (not (= (select |c_#valid| v_prenex_73) (_ bv0 1))) (not (bvsle .cse214 .cse213)) (not (bvsle (_ bv0 32) .cse214)) (bvsle .cse209 (select .cse210 v_prenex_74)))))) (= (_ bv1 1) .cse215) (or .cse0 (forall ((v_prenex_238 (_ BitVec 32)) (v_prenex_237 (_ BitVec 32)) (v_prenex_236 (_ BitVec 32)) (v_prenex_235 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse216 (bvadd v_prenex_236 (_ bv8 32))) (.cse217 (bvadd v_prenex_236 (_ bv12 32))) (.cse219 (select |c_#length| v_prenex_12)) (.cse218 (bvadd v_prenex_238 v_prenex_236))) (or (bvsle (bvadd v_prenex_236 (_ bv4 32)) (select (store |c_#length| v_prenex_235 v_prenex_237) v_prenex_12)) (not (bvsle (_ bv0 32) v_prenex_236)) (not (bvsle .cse216 .cse217)) (not (bvsle .cse218 .cse219)) (not (bvsle (_ bv0 32) .cse216)) (not (bvsle .cse217 .cse219)) (not (= (select |c_#valid| v_prenex_235) (_ bv0 1))) (not (bvsle v_prenex_236 .cse218))))) .cse1) (or .cse0 .cse1 (forall ((v_prenex_135 (_ BitVec 32)) (v_arrayElimCell_164 (_ BitVec 32)) (v_prenex_134 (_ BitVec 32)) (v_prenex_133 (_ BitVec 32)) (v_prenex_132 (_ BitVec 32))) (let ((.cse220 (bvadd v_prenex_134 (_ bv12 32))) (.cse223 (bvadd v_prenex_133 v_prenex_134)) (.cse221 (select |c_#length| v_arrayElimCell_164)) (.cse222 (bvadd v_prenex_134 (_ bv8 32)))) (or (not (bvsle .cse220 .cse221)) (= v_arrayElimCell_164 c_main_~x~0.base) (bvsle (bvadd v_prenex_134 (_ bv4 32)) (select (store |c_#length| v_prenex_132 v_prenex_135) v_arrayElimCell_164)) (not (bvsle (_ bv0 32) v_prenex_134)) (not (bvsle .cse222 .cse220)) (not (= (select |c_#valid| v_prenex_132) (_ bv0 1))) (not (bvsle v_prenex_134 .cse223)) (not (bvsle .cse223 .cse221)) (not (bvsle (_ bv0 32) .cse222)))))) (or .cse0 (forall ((v_arrayElimCell_224 (_ BitVec 32)) (v_prenex_260 (_ BitVec 32)) (v_prenex_259 (_ BitVec 32)) (v_prenex_258 (_ BitVec 32)) (v_prenex_257 (_ BitVec 32))) (let ((.cse227 (bvadd v_prenex_258 (_ bv12 32))) (.cse225 (select |c_#length| v_arrayElimCell_224)) (.cse224 (bvadd v_prenex_260 v_prenex_258)) (.cse226 (bvadd v_prenex_258 (_ bv8 32)))) (or (= v_arrayElimCell_224 c_main_~x~0.base) (not (bvsle .cse224 .cse225)) (not (bvsle .cse226 .cse227)) (bvsle (bvadd v_prenex_258 (_ bv4 32)) (select (store |c_#length| v_prenex_257 v_prenex_259) v_arrayElimCell_224)) (not (bvsle .cse227 .cse225)) (not (= (select |c_#valid| v_prenex_257) (_ bv0 1))) (not (bvsle v_prenex_258 .cse224)) (not (bvsle (_ bv0 32) v_prenex_258)) (not (bvsle (_ bv0 32) .cse226)))))) (or .cse80 .cse0 .cse1 (forall ((v_prenex_5 (_ BitVec 32)) (v_prenex_225 (_ BitVec 32)) (v_prenex_224 (_ BitVec 32)) (v_prenex_223 (_ BitVec 32)) (v_prenex_222 (_ BitVec 32)) (v_prenex_221 (_ BitVec 32))) (let ((.cse228 (bvadd v_prenex_223 (_ bv12 32))) (.cse233 (bvadd v_prenex_223 (_ bv8 32))) (.cse230 (bvadd v_prenex_225 v_prenex_223)) (.cse229 (select |c_#length| v_prenex_5)) (.cse231 (bvadd v_prenex_223 (_ bv4 32))) (.cse232 (store |c_#length| v_prenex_221 v_prenex_224))) (or (not (bvsle (_ bv0 32) v_prenex_223)) (not (bvsle .cse228 .cse229)) (not (bvsle v_prenex_223 .cse230)) (bvsle .cse231 (select .cse232 v_prenex_5)) (not (bvsle .cse233 .cse228)) (not (bvsle (_ bv0 32) .cse233)) (not (= (select |c_#valid| v_prenex_221) (_ bv0 1))) (not (bvsle .cse230 .cse229)) (bvsle .cse231 (select .cse232 v_prenex_222)) (= v_prenex_5 c_main_~x~0.base))))) (or .cse0 .cse1 (forall ((v_prenex_175 (_ BitVec 32)) (v_prenex_174 (_ BitVec 32)) (v_prenex_173 (_ BitVec 32)) (v_prenex_172 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 32)) (v_prenex_176 (_ BitVec 32))) (let ((.cse235 (select |c_#length| v_arrayElimCell_52)) (.cse234 (bvadd v_prenex_173 v_prenex_175)) (.cse237 (bvadd v_prenex_175 (_ bv4 32))) (.cse238 (store |c_#length| v_prenex_172 v_prenex_176)) (.cse239 (bvadd v_prenex_175 (_ bv8 32))) (.cse236 (bvadd v_prenex_175 (_ bv12 32)))) (or (not (bvsle .cse234 .cse235)) (not (bvsle .cse236 .cse235)) (not (= (select |c_#valid| v_prenex_172) (_ bv0 1))) (bvsle .cse237 (select .cse238 v_prenex_174)) (not (bvsle v_prenex_175 .cse234)) (not (bvsle (_ bv0 32) .cse239)) (bvsle .cse237 (select .cse238 v_arrayElimCell_52)) (not (bvsle (_ bv0 32) v_prenex_175)) (not (bvsle .cse239 .cse236)) (= v_arrayElimCell_52 c_main_~x~0.base))))) (or .cse0 .cse1 (forall ((v_prenex_395 (_ BitVec 32)) (v_prenex_394 (_ BitVec 32)) (v_arrayElimCell_99 (_ BitVec 32)) (v_prenex_398 (_ BitVec 32)) (v_prenex_397 (_ BitVec 32)) (v_prenex_396 (_ BitVec 32))) (let ((.cse242 (bvadd v_prenex_397 (_ bv12 32))) (.cse241 (bvadd v_prenex_397 (_ bv8 32))) (.cse240 (bvadd v_prenex_398 v_prenex_397)) (.cse243 (select |c_#length| v_arrayElimCell_99)) (.cse244 (bvadd v_prenex_397 (_ bv4 32))) (.cse245 (store |c_#length| v_prenex_396 v_prenex_395))) (or (not (= (select |c_#valid| v_prenex_396) (_ bv0 1))) (not (bvsle v_prenex_397 .cse240)) (= v_arrayElimCell_99 c_main_~x~0.base) (not (bvsle .cse241 .cse242)) (not (bvsle .cse242 .cse243)) (bvsle .cse244 (select .cse245 v_arrayElimCell_99)) (not (bvsle (_ bv0 32) v_prenex_397)) (not (bvsle (_ bv0 32) .cse241)) (not (bvsle .cse240 .cse243)) (bvsle .cse244 (select .cse245 v_prenex_394)))))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_prenex_329 (_ BitVec 32)) (v_prenex_328 (_ BitVec 32)) (v_prenex_327 (_ BitVec 32)) (v_prenex_331 (_ BitVec 32)) (v_prenex_330 (_ BitVec 32))) (let ((.cse246 (bvadd v_prenex_329 (_ bv8 32))) (.cse247 (bvadd v_prenex_329 (_ bv12 32))) (.cse249 (bvadd v_prenex_329 (_ bv4 32))) (.cse250 (store |c_#length| v_prenex_327 v_prenex_330)) (.cse251 (bvadd v_prenex_331 v_prenex_329)) (.cse248 (select |c_#length| v_arrayElimCell_38))) (or (not (bvsle .cse246 .cse247)) (not (bvsle (_ bv0 32) .cse246)) (not (bvsle .cse247 .cse248)) (bvsle .cse249 (select .cse250 v_prenex_328)) (not (bvsle (_ bv0 32) v_prenex_329)) (bvsle .cse249 (select .cse250 v_arrayElimCell_38)) (not (bvsle v_prenex_329 .cse251)) (not (= (select |c_#valid| v_prenex_327) (_ bv0 1))) (not (bvsle .cse251 .cse248))))) .cse0 .cse1) (or .cse1 (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_prenex_148 (_ BitVec 32)) (v_prenex_147 (_ BitVec 32)) (v_prenex_146 (_ BitVec 32)) (v_prenex_145 (_ BitVec 32))) (let ((.cse252 (bvadd v_prenex_147 (_ bv12 32))) (.cse254 (bvadd v_prenex_146 v_prenex_147)) (.cse253 (select |c_#length| v_arrayElimCell_139)) (.cse255 (bvadd v_prenex_147 (_ bv8 32)))) (or (not (bvsle .cse252 .cse253)) (not (= (select |c_#valid| v_prenex_145) (_ bv0 1))) (not (bvsle v_prenex_147 .cse254)) (= v_arrayElimCell_139 c_main_~x~0.base) (not (bvsle .cse255 .cse252)) (not (bvsle (_ bv0 32) v_prenex_147)) (not (bvsle .cse254 .cse253)) (bvsle (bvadd v_prenex_147 (_ bv4 32)) (select (store |c_#length| v_prenex_145 v_prenex_148) v_arrayElimCell_139)) (not (bvsle (_ bv0 32) .cse255)))))) (or .cse0 .cse1 (forall ((v_prenex_185 (_ BitVec 32)) (v_prenex_184 (_ BitVec 32)) (v_prenex_183 (_ BitVec 32)) (v_prenex_182 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse257 (bvadd v_prenex_184 (_ bv8 32))) (.cse256 (bvadd v_prenex_183 v_prenex_184)) (.cse258 (bvadd v_prenex_184 (_ bv12 32))) (.cse259 (select |c_#length| v_arrayElimCell_74))) (or (not (bvsle v_prenex_184 .cse256)) (not (bvsle .cse257 .cse258)) (not (bvsle (_ bv0 32) .cse257)) (not (bvsle .cse256 .cse259)) (not (bvsle (_ bv0 32) v_prenex_184)) (= v_arrayElimCell_74 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_182) (_ bv0 1))) (not (bvsle .cse258 .cse259)) (bvsle (bvadd v_prenex_184 (_ bv4 32)) (select (store |c_#length| v_prenex_182 v_prenex_185) v_arrayElimCell_74)))))) (or (forall ((v_arrayElimCell_145 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (|main_write~$Pointer$_#sizeOfWrittenType| (_ BitVec 32)) (|v_main_#Ultimate.alloc_~size_4| (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (|v_main_write~$Pointer$_#ptr.offset_35| (_ BitVec 32))) (let ((.cse262 (bvadd |main_write~$Pointer$_#sizeOfWrittenType| |v_main_write~$Pointer$_#ptr.offset_35|)) (.cse260 (bvadd |v_main_write~$Pointer$_#ptr.offset_35| (_ bv4 32))) (.cse261 (store |c_#length| v_prenex_2 |v_main_#Ultimate.alloc_~size_4|)) (.cse264 (bvadd |v_main_write~$Pointer$_#ptr.offset_35| (_ bv8 32))) (.cse265 (bvadd |v_main_write~$Pointer$_#ptr.offset_35| (_ bv12 32))) (.cse263 (select |c_#length| v_arrayElimCell_145))) (or (bvsle .cse260 (select .cse261 v_arrayElimCell_145)) (not (= (select |c_#valid| v_prenex_2) (_ bv0 1))) (not (bvsle .cse262 .cse263)) (not (bvsle (_ bv0 32) .cse264)) (not (bvsle |v_main_write~$Pointer$_#ptr.offset_35| .cse262)) (bvsle .cse260 (select .cse261 v_subst_2)) (= v_arrayElimCell_145 c_main_~x~0.base) (not (bvsle .cse264 .cse265)) (not (bvsle .cse265 .cse263)) (not (bvsle (_ bv0 32) |v_main_write~$Pointer$_#ptr.offset_35|))))) .cse1) (or .cse0 .cse8 (forall ((v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_215 (_ BitVec 32)) (v_prenex_214 (_ BitVec 32)) (v_prenex_213 (_ BitVec 32)) (v_prenex_212 (_ BitVec 32)) (v_prenex_211 (_ BitVec 32))) (let ((.cse266 (bvadd v_prenex_213 (_ bv12 32))) (.cse270 (bvadd v_prenex_213 (_ bv8 32))) (.cse268 (bvadd v_prenex_213 (_ bv4 32))) (.cse269 (store |c_#length| v_prenex_211 v_prenex_214)) (.cse267 (select |c_#length| v_arrayElimCell_114)) (.cse271 (bvadd v_prenex_215 v_prenex_213))) (or (not (bvsle .cse266 .cse267)) (= v_arrayElimCell_114 c_main_~x~0.base) (bvsle .cse268 (select .cse269 v_prenex_212)) (not (bvsle .cse270 .cse266)) (not (bvsle (_ bv0 32) .cse270)) (bvsle .cse268 (select .cse269 v_arrayElimCell_114)) (not (= (select |c_#valid| v_prenex_211) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_213)) (not (bvsle .cse271 .cse267)) (not (bvsle v_prenex_213 .cse271)))))) (or .cse0 .cse1 (forall ((v_prenex_131 (_ BitVec 32)) (v_prenex_130 (_ BitVec 32)) (v_prenex_129 (_ BitVec 32)) (v_prenex_128 (_ BitVec 32)) (v_prenex_127 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse273 (bvadd v_prenex_130 (_ bv12 32))) (.cse277 (select |c_#length| v_arrayElimCell_122)) (.cse272 (bvadd v_prenex_130 (_ bv8 32))) (.cse274 (bvadd v_prenex_130 (_ bv4 32))) (.cse275 (store |c_#length| v_prenex_127 v_prenex_131)) (.cse276 (bvadd v_prenex_128 v_prenex_130))) (or (not (bvsle .cse272 .cse273)) (bvsle .cse274 (select .cse275 v_prenex_129)) (= v_arrayElimCell_122 c_main_~x~0.base) (not (bvsle .cse276 .cse277)) (not (bvsle .cse273 .cse277)) (not (bvsle (_ bv0 32) .cse272)) (not (bvsle (_ bv0 32) v_prenex_130)) (bvsle .cse274 (select .cse275 v_arrayElimCell_122)) (not (= (select |c_#valid| v_prenex_127) (_ bv0 1))) (not (bvsle v_prenex_130 .cse276)))))) (= (bvadd .cse215 (_ bv1 1)) (_ bv0 1)) (or .cse80 .cse1 (forall ((v_prenex_31 (_ BitVec 32)) (v_prenex_304 (_ BitVec 32)) (v_prenex_303 (_ BitVec 32)) (v_prenex_302 (_ BitVec 32)) (v_prenex_301 (_ BitVec 32))) (let ((.cse278 (bvadd v_prenex_302 (_ bv8 32))) (.cse280 (bvadd v_prenex_302 (_ bv12 32))) (.cse279 (bvadd v_prenex_304 v_prenex_302)) (.cse281 (select |c_#length| v_prenex_31))) (or (not (bvsle (_ bv0 32) .cse278)) (not (bvsle v_prenex_302 .cse279)) (= v_prenex_31 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_302)) (not (bvsle .cse280 .cse281)) (not (bvsle .cse278 .cse280)) (not (= (select |c_#valid| v_prenex_301) (_ bv0 1))) (bvsle (bvadd v_prenex_302 (_ bv4 32)) (select (store |c_#length| v_prenex_301 v_prenex_303) v_prenex_31)) (not (bvsle .cse279 .cse281)))))) (or (forall ((v_prenex_384 (_ BitVec 32)) (v_prenex_383 (_ BitVec 32)) (v_prenex_382 (_ BitVec 32)) (v_prenex_381 (_ BitVec 32)) (v_prenex_380 (_ BitVec 32))) (let ((.cse282 (bvadd v_prenex_384 v_prenex_383)) (.cse285 (bvadd v_prenex_383 (_ bv12 32))) (.cse283 (select |c_#length| v_prenex_380)) (.cse284 (bvadd v_prenex_383 (_ bv8 32)))) (or (not (bvsle .cse282 .cse283)) (not (bvsle v_prenex_383 .cse282)) (not (bvsle .cse284 .cse285)) (not (bvsle .cse285 .cse283)) (not (bvsle (_ bv0 32) v_prenex_383)) (not (bvsle (_ bv0 32) .cse284)) (not (= (select |c_#valid| v_prenex_382) (_ bv0 1))) (bvsle (bvadd v_prenex_383 (_ bv4 32)) (select (store |c_#length| v_prenex_382 v_prenex_381) v_prenex_380))))) .cse286) (or .cse1 (forall ((v_prenex_40 (_ BitVec 32)) (v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32)) (v_arrayElimCell_150 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse289 (bvadd v_prenex_44 (_ bv4 32))) (.cse290 (store |c_#length| v_prenex_41 v_prenex_43)) (.cse292 (bvadd v_prenex_44 (_ bv8 32))) (.cse287 (bvadd v_prenex_44 (_ bv12 32))) (.cse291 (bvadd v_prenex_40 v_prenex_44)) (.cse288 (select |c_#length| v_arrayElimCell_150))) (or (not (bvsle .cse287 .cse288)) (bvsle .cse289 (select .cse290 v_prenex_42)) (not (= (select |c_#valid| v_prenex_41) (_ bv0 1))) (not (bvsle v_prenex_44 .cse291)) (= v_arrayElimCell_150 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse292)) (bvsle .cse289 (select .cse290 v_arrayElimCell_150)) (not (bvsle .cse292 .cse287)) (not (bvsle .cse291 .cse288)) (not (bvsle (_ bv0 32) v_prenex_44)))))) (or (forall ((v_prenex_164 (_ BitVec 32)) (v_prenex_163 (_ BitVec 32)) (v_prenex_162 (_ BitVec 32)) (v_arrayElimCell_136 (_ BitVec 32)) (v_prenex_166 (_ BitVec 32)) (v_prenex_165 (_ BitVec 32))) (let ((.cse293 (bvadd v_prenex_163 v_prenex_165)) (.cse294 (bvadd v_prenex_165 (_ bv8 32))) (.cse297 (bvadd v_prenex_165 (_ bv4 32))) (.cse298 (store |c_#length| v_prenex_162 v_prenex_166)) (.cse295 (bvadd v_prenex_165 (_ bv12 32))) (.cse296 (select |c_#length| v_arrayElimCell_136))) (or (not (bvsle v_prenex_165 .cse293)) (= v_arrayElimCell_136 c_main_~x~0.base) (not (bvsle .cse294 .cse295)) (not (bvsle .cse293 .cse296)) (bvsle .cse297 (select .cse298 v_prenex_164)) (not (bvsle (_ bv0 32) .cse294)) (bvsle .cse297 (select .cse298 v_arrayElimCell_136)) (not (bvsle .cse295 .cse296)) (not (= (select |c_#valid| v_prenex_162) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_165))))) .cse1) (or .cse0 (forall ((v_prenex_161 (_ BitVec 32)) (v_prenex_160 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32)) (v_prenex_159 (_ BitVec 32)) (v_prenex_158 (_ BitVec 32))) (let ((.cse301 (bvadd v_prenex_159 v_prenex_160)) (.cse299 (bvadd v_prenex_160 (_ bv8 32))) (.cse300 (bvadd v_prenex_160 (_ bv12 32))) (.cse302 (select |c_#length| v_arrayElimCell_118))) (or (not (= (select |c_#valid| v_prenex_158) (_ bv0 1))) (not (bvsle .cse299 .cse300)) (not (bvsle v_prenex_160 .cse301)) (not (bvsle .cse301 .cse302)) (not (bvsle (_ bv0 32) .cse299)) (not (bvsle .cse300 .cse302)) (bvsle (bvadd v_prenex_160 (_ bv4 32)) (select (store |c_#length| v_prenex_158 v_prenex_161) v_arrayElimCell_118)) (not (bvsle (_ bv0 32) v_prenex_160)))))) (or .cse0 (forall ((v_prenex_362 (_ BitVec 32)) (v_prenex_366 (_ BitVec 32)) (v_prenex_365 (_ BitVec 32)) (v_prenex_364 (_ BitVec 32)) (v_arrayElimCell_121 (_ BitVec 32)) (v_prenex_363 (_ BitVec 32))) (let ((.cse303 (bvadd v_prenex_365 (_ bv4 32))) (.cse304 (store |c_#length| v_prenex_364 v_prenex_363)) (.cse306 (select |c_#length| v_arrayElimCell_121)) (.cse307 (bvadd v_prenex_366 v_prenex_365)) (.cse305 (bvadd v_prenex_365 (_ bv12 32))) (.cse308 (bvadd v_prenex_365 (_ bv8 32)))) (or (= v_arrayElimCell_121 c_main_~x~0.base) (bvsle .cse303 (select .cse304 v_prenex_362)) (not (bvsle (_ bv0 32) v_prenex_365)) (bvsle .cse303 (select .cse304 v_arrayElimCell_121)) (not (= (select |c_#valid| v_prenex_364) (_ bv0 1))) (not (bvsle .cse305 .cse306)) (not (bvsle .cse307 .cse306)) (not (bvsle v_prenex_365 .cse307)) (not (bvsle .cse308 .cse305)) (not (bvsle (_ bv0 32) .cse308)))))) (or (forall ((v_prenex_206 (_ BitVec 32)) (v_prenex_205 (_ BitVec 32)) (v_prenex_204 (_ BitVec 32)) (v_prenex_203 (_ BitVec 32)) (v_arrayElimCell_142 (_ BitVec 32))) (let ((.cse311 (bvadd v_prenex_206 v_prenex_204)) (.cse309 (bvadd v_prenex_204 (_ bv8 32))) (.cse310 (bvadd v_prenex_204 (_ bv12 32))) (.cse312 (select |c_#length| v_arrayElimCell_142))) (or (not (bvsle .cse309 .cse310)) (not (bvsle v_prenex_204 .cse311)) (not (bvsle (_ bv0 32) v_prenex_204)) (not (bvsle .cse311 .cse312)) (not (bvsle (_ bv0 32) .cse309)) (not (= (select |c_#valid| v_prenex_203) (_ bv0 1))) (not (bvsle .cse310 .cse312)) (bvsle (bvadd v_prenex_204 (_ bv4 32)) (select (store |c_#length| v_prenex_203 v_prenex_205) v_arrayElimCell_142))))) .cse1) (or .cse80 .cse1 (forall ((v_prenex_118 (_ BitVec 32)) (v_prenex_117 (_ BitVec 32)) (v_prenex_116 (_ BitVec 32)) (v_prenex_115 (_ BitVec 32)) (v_prenex_114 (_ BitVec 32)) (v_prenex_25 (_ BitVec 32))) (let ((.cse313 (bvadd v_prenex_117 (_ bv8 32))) (.cse314 (bvadd v_prenex_117 (_ bv12 32))) (.cse317 (bvadd v_prenex_115 v_prenex_117)) (.cse318 (select |c_#length| v_prenex_25)) (.cse315 (bvadd v_prenex_117 (_ bv4 32))) (.cse316 (store |c_#length| v_prenex_114 v_prenex_118))) (or (not (bvsle (_ bv0 32) v_prenex_117)) (not (bvsle (_ bv0 32) .cse313)) (= v_prenex_25 c_main_~x~0.base) (not (bvsle .cse313 .cse314)) (bvsle .cse315 (select .cse316 v_prenex_116)) (not (bvsle v_prenex_117 .cse317)) (not (= (select |c_#valid| v_prenex_114) (_ bv0 1))) (not (bvsle .cse314 .cse318)) (not (bvsle .cse317 .cse318)) (bvsle .cse315 (select .cse316 v_prenex_25)))))) (or .cse1 (forall ((v_prenex_32 (_ BitVec 32)) (v_prenex_181 (_ BitVec 32)) (v_prenex_180 (_ BitVec 32)) (v_prenex_179 (_ BitVec 32)) (v_prenex_178 (_ BitVec 32)) (v_prenex_177 (_ BitVec 32))) (let ((.cse321 (select |c_#length| v_prenex_32)) (.cse319 (bvadd v_prenex_180 (_ bv8 32))) (.cse324 (bvadd v_prenex_180 (_ bv12 32))) (.cse320 (bvadd v_prenex_178 v_prenex_180)) (.cse322 (bvadd v_prenex_180 (_ bv4 32))) (.cse323 (store |c_#length| v_prenex_177 v_prenex_181))) (or (not (bvsle (_ bv0 32) .cse319)) (not (bvsle (_ bv0 32) v_prenex_180)) (not (bvsle .cse320 .cse321)) (bvsle .cse322 (select .cse323 v_prenex_179)) (not (bvsle .cse324 .cse321)) (not (= (select |c_#valid| v_prenex_177) (_ bv0 1))) (not (bvsle .cse319 .cse324)) (= v_prenex_32 c_main_~x~0.base) (not (bvsle v_prenex_180 .cse320)) (bvsle .cse322 (select .cse323 v_prenex_32)))))) (or .cse80 .cse0 (forall ((v_prenex_241 (_ BitVec 32)) (v_prenex_240 (_ BitVec 32)) (v_prenex_239 (_ BitVec 32)) (v_arrayElimCell_96 (_ BitVec 32)) (v_prenex_242 (_ BitVec 32))) (let ((.cse325 (bvadd v_prenex_242 v_prenex_240)) (.cse328 (bvadd v_prenex_240 (_ bv12 32))) (.cse326 (select |c_#length| v_arrayElimCell_96)) (.cse327 (bvadd v_prenex_240 (_ bv8 32)))) (or (not (bvsle .cse325 .cse326)) (not (bvsle (_ bv0 32) v_prenex_240)) (= v_arrayElimCell_96 c_main_~x~0.base) (not (bvsle v_prenex_240 .cse325)) (not (bvsle .cse327 .cse328)) (not (bvsle .cse328 .cse326)) (bvsle (bvadd v_prenex_240 (_ bv4 32)) (select (store |c_#length| v_prenex_239 v_prenex_241) v_arrayElimCell_96)) (not (bvsle (_ bv0 32) .cse327)) (not (= (select |c_#valid| v_prenex_239) (_ bv0 1)))))) .cse1) (or .cse1 (forall ((v_prenex_230 (_ BitVec 32)) (v_prenex_229 (_ BitVec 32)) (v_prenex_228 (_ BitVec 32)) (v_prenex_227 (_ BitVec 32)) (v_prenex_226 (_ BitVec 32)) (v_prenex_35 (_ BitVec 32))) (let ((.cse333 (bvadd v_prenex_230 v_prenex_228)) (.cse331 (bvadd v_prenex_228 (_ bv8 32))) (.cse329 (bvadd v_prenex_228 (_ bv4 32))) (.cse330 (store |c_#length| v_prenex_226 v_prenex_229)) (.cse332 (bvadd v_prenex_228 (_ bv12 32))) (.cse334 (select |c_#length| v_prenex_35))) (or (bvsle .cse329 (select .cse330 v_prenex_227)) (not (bvsle (_ bv0 32) v_prenex_228)) (not (= (select |c_#valid| v_prenex_226) (_ bv0 1))) (not (bvsle .cse331 .cse332)) (= v_prenex_35 c_main_~x~0.base) (not (bvsle .cse333 .cse334)) (not (bvsle v_prenex_228 .cse333)) (not (bvsle (_ bv0 32) .cse331)) (bvsle .cse329 (select .cse330 v_prenex_35)) (not (bvsle .cse332 .cse334)))))) (or .cse0 .cse1 (forall ((v_arrayElimCell_211 (_ BitVec 32)) (v_prenex_351 (_ BitVec 32)) (v_prenex_350 (_ BitVec 32)) (v_prenex_349 (_ BitVec 32)) (v_prenex_352 (_ BitVec 32))) (let ((.cse335 (bvadd v_prenex_351 (_ bv8 32))) (.cse336 (bvadd v_prenex_351 (_ bv12 32))) (.cse338 (bvadd v_prenex_352 v_prenex_351)) (.cse337 (select |c_#length| v_arrayElimCell_211))) (or (not (bvsle (_ bv0 32) .cse335)) (bvsle (bvadd v_prenex_351 (_ bv4 32)) (select (store |c_#length| v_prenex_350 v_prenex_349) v_arrayElimCell_211)) (not (bvsle .cse335 .cse336)) (not (bvsle .cse336 .cse337)) (not (bvsle v_prenex_351 .cse338)) (not (bvsle .cse338 .cse337)) (not (= (select |c_#valid| v_prenex_350) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_351)))))) (or .cse0 (forall ((v_prenex_388 (_ BitVec 32)) (v_prenex_387 (_ BitVec 32)) (v_prenex_386 (_ BitVec 32)) (v_arrayElimCell_220 (_ BitVec 32)) (v_prenex_385 (_ BitVec 32))) (let ((.cse339 (bvadd v_prenex_387 (_ bv8 32))) (.cse342 (bvadd v_prenex_387 (_ bv12 32))) (.cse341 (select |c_#length| v_arrayElimCell_220)) (.cse340 (bvadd v_prenex_388 v_prenex_387))) (or (not (bvsle (_ bv0 32) .cse339)) (not (bvsle (_ bv0 32) v_prenex_387)) (bvsle (bvadd v_prenex_387 (_ bv4 32)) (select (store |c_#length| v_prenex_386 v_prenex_385) v_arrayElimCell_220)) (not (bvsle .cse340 .cse341)) (not (bvsle .cse339 .cse342)) (not (bvsle .cse342 .cse341)) (not (bvsle v_prenex_387 .cse340)) (not (= (select |c_#valid| v_prenex_386) (_ bv0 1))))))) (or .cse1 (forall ((v_prenex_252 (_ BitVec 32)) (v_prenex_251 (_ BitVec 32)) (v_prenex_250 (_ BitVec 32)) (v_prenex_249 (_ BitVec 32)) (v_prenex_248 (_ BitVec 32)) (v_prenex_34 (_ BitVec 32))) (let ((.cse345 (bvadd v_prenex_250 (_ bv4 32))) (.cse346 (store |c_#length| v_prenex_248 v_prenex_251)) (.cse347 (bvadd v_prenex_250 (_ bv8 32))) (.cse348 (bvadd v_prenex_250 (_ bv12 32))) (.cse344 (select |c_#length| v_prenex_34)) (.cse343 (bvadd v_prenex_252 v_prenex_250))) (or (not (bvsle .cse343 .cse344)) (bvsle .cse345 (select .cse346 v_prenex_34)) (= v_prenex_34 c_main_~x~0.base) (bvsle .cse345 (select .cse346 v_prenex_249)) (not (bvsle .cse347 .cse348)) (not (bvsle (_ bv0 32) .cse347)) (not (bvsle (_ bv0 32) v_prenex_250)) (not (bvsle .cse348 .cse344)) (not (bvsle v_prenex_250 .cse343)) (not (= (select |c_#valid| v_prenex_248) (_ bv0 1))))))) (or (forall ((v_prenex_285 (_ BitVec 32)) (v_prenex_284 (_ BitVec 32)) (v_prenex_283 (_ BitVec 32)) (v_arrayElimCell_63 (_ BitVec 32)) (v_prenex_286 (_ BitVec 32))) (let ((.cse351 (select |c_#length| v_arrayElimCell_63)) (.cse349 (bvadd v_prenex_284 (_ bv8 32))) (.cse352 (bvadd v_prenex_284 (_ bv12 32))) (.cse350 (bvadd v_prenex_286 v_prenex_284))) (or (not (bvsle (_ bv0 32) .cse349)) (not (bvsle (_ bv0 32) v_prenex_284)) (not (bvsle .cse350 .cse351)) (not (bvsle .cse352 .cse351)) (= v_arrayElimCell_63 c_main_~x~0.base) (not (bvsle .cse349 .cse352)) (bvsle (bvadd v_prenex_284 (_ bv4 32)) (select (store |c_#length| v_prenex_283 v_prenex_285) v_arrayElimCell_63)) (not (bvsle v_prenex_284 .cse350)) (not (= (select |c_#valid| v_prenex_283) (_ bv0 1)))))) .cse0 .cse1) (or .cse80 .cse0 .cse1 (forall ((v_prenex_95 (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (v_prenex_93 (_ BitVec 32)) (v_prenex_94 (_ BitVec 32)) (v_arrayElimCell_29 (_ BitVec 32))) (let ((.cse353 (bvadd v_prenex_94 (_ bv4 32))) (.cse354 (store |c_#length| v_prenex_92 v_prenex_95)) (.cse355 (bvadd v_prenex_91 v_prenex_94)) (.cse356 (bvadd v_prenex_94 (_ bv8 32))) (.cse358 (bvadd v_prenex_94 (_ bv12 32))) (.cse357 (select |c_#length| v_arrayElimCell_29))) (or (bvsle .cse353 (select .cse354 v_arrayElimCell_29)) (not (bvsle v_prenex_94 .cse355)) (not (bvsle (_ bv0 32) .cse356)) (bvsle .cse353 (select .cse354 v_prenex_93)) (not (bvsle .cse355 .cse357)) (not (bvsle (_ bv0 32) v_prenex_94)) (not (= (select |c_#valid| v_prenex_92) (_ bv0 1))) (not (bvsle .cse356 .cse358)) (not (bvsle .cse358 .cse357)))))) (or .cse80 .cse0 .cse1 (forall ((v_prenex_406 (_ BitVec 32)) (v_prenex_405 (_ BitVec 32)) (v_prenex_404 (_ BitVec 32)) (v_prenex_403 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse359 (bvadd v_prenex_406 v_prenex_405)) (.cse362 (bvadd v_prenex_405 (_ bv12 32))) (.cse360 (select |c_#length| v_prenex_14)) (.cse361 (bvadd v_prenex_405 (_ bv8 32)))) (or (not (bvsle (_ bv0 32) v_prenex_405)) (not (bvsle .cse359 .cse360)) (not (= (select |c_#valid| v_prenex_404) (_ bv0 1))) (bvsle (bvadd v_prenex_405 (_ bv4 32)) (select (store |c_#length| v_prenex_404 v_prenex_403) v_prenex_14)) (= v_prenex_14 c_main_~x~0.base) (not (bvsle .cse361 .cse362)) (not (bvsle v_prenex_405 .cse359)) (not (bvsle .cse362 .cse360)) (not (bvsle (_ bv0 32) .cse361)))))) .cse286 (or .cse0 (forall ((v_prenex_62 (_ BitVec 32)) (v_prenex_60 (_ BitVec 32)) (v_prenex_61 (_ BitVec 32)) (v_prenex_59 (_ BitVec 32)) (v_prenex_58 (_ BitVec 32))) (let ((.cse364 (select |c_#length| v_prenex_61)) (.cse363 (bvadd v_prenex_58 v_prenex_62)) (.cse365 (bvadd v_prenex_62 (_ bv12 32))) (.cse366 (bvadd v_prenex_62 (_ bv8 32)))) (or (not (= (select |c_#valid| v_prenex_60) (_ bv0 1))) (not (bvsle .cse363 .cse364)) (not (bvsle (_ bv0 32) v_prenex_62)) (not (bvsle .cse365 .cse364)) (not (bvsle v_prenex_62 .cse363)) (not (bvsle .cse366 .cse365)) (bvsle (bvadd v_prenex_62 (_ bv4 32)) (select (store |c_#length| v_prenex_60 v_prenex_59) v_prenex_61)) (not (bvsle (_ bv0 32) .cse366)))))) (or .cse80 .cse0 .cse1 (forall ((v_prenex_139 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_138 (_ BitVec 32)) (v_prenex_137 (_ BitVec 32)) (v_prenex_136 (_ BitVec 32))) (let ((.cse367 (bvadd v_prenex_137 v_prenex_138)) (.cse368 (select |c_#length| v_prenex_6)) (.cse370 (bvadd v_prenex_138 (_ bv8 32))) (.cse369 (bvadd v_prenex_138 (_ bv12 32)))) (or (bvsle (bvadd v_prenex_138 (_ bv4 32)) (select (store |c_#length| v_prenex_136 v_prenex_139) v_prenex_6)) (not (bvsle .cse367 .cse368)) (not (bvsle v_prenex_138 .cse367)) (not (bvsle .cse369 .cse368)) (not (bvsle (_ bv0 32) .cse370)) (= v_prenex_6 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_138)) (not (= (select |c_#valid| v_prenex_136) (_ bv0 1))) (not (bvsle .cse370 .cse369)))))) (or (forall ((v_prenex_171 (_ BitVec 32)) (v_prenex_170 (_ BitVec 32)) (v_prenex_169 (_ BitVec 32)) (v_arrayElimCell_173 (_ BitVec 32)) (v_prenex_168 (_ BitVec 32)) (v_prenex_167 (_ BitVec 32))) (let ((.cse374 (bvadd v_prenex_170 (_ bv8 32))) (.cse371 (bvadd v_prenex_170 (_ bv4 32))) (.cse372 (store |c_#length| v_prenex_167 v_prenex_171)) (.cse373 (bvadd v_prenex_168 v_prenex_170)) (.cse375 (bvadd v_prenex_170 (_ bv12 32))) (.cse376 (select |c_#length| v_arrayElimCell_173))) (or (bvsle .cse371 (select .cse372 v_prenex_169)) (not (bvsle v_prenex_170 .cse373)) (not (bvsle (_ bv0 32) v_prenex_170)) (not (bvsle .cse374 .cse375)) (not (bvsle (_ bv0 32) .cse374)) (bvsle .cse371 (select .cse372 v_arrayElimCell_173)) (not (bvsle .cse373 .cse376)) (not (= (select |c_#valid| v_prenex_167) (_ bv0 1))) (= v_arrayElimCell_173 c_main_~x~0.base) (not (bvsle .cse375 .cse376))))) .cse0 .cse1) (or .cse0 .cse1 (forall ((v_prenex_197 (_ BitVec 32)) (v_prenex_196 (_ BitVec 32)) (v_prenex_195 (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (v_prenex_198 (_ BitVec 32))) (let ((.cse377 (bvadd v_prenex_196 (_ bv8 32))) (.cse378 (bvadd v_prenex_196 (_ bv12 32))) (.cse380 (bvadd v_prenex_198 v_prenex_196)) (.cse379 (select |c_#length| v_prenex_10))) (or (not (bvsle (_ bv0 32) .cse377)) (not (bvsle (_ bv0 32) v_prenex_196)) (not (bvsle .cse378 .cse379)) (bvsle (bvadd v_prenex_196 (_ bv4 32)) (select (store |c_#length| v_prenex_195 v_prenex_197) v_prenex_10)) (not (= (select |c_#valid| v_prenex_195) (_ bv0 1))) (not (bvsle v_prenex_196 .cse380)) (= v_prenex_10 c_main_~x~0.base) (not (bvsle .cse377 .cse378)) (not (bvsle .cse380 .cse379)))))) (or .cse0 (forall ((v_prenex_96 (_ BitVec 32)) (v_prenex_97 (_ BitVec 32)) (v_prenex_98 (_ BitVec 32)) (v_arrayElimCell_216 (_ BitVec 32)) (v_prenex_99 (_ BitVec 32))) (let ((.cse383 (bvadd v_prenex_98 (_ bv8 32))) (.cse384 (bvadd v_prenex_98 (_ bv12 32))) (.cse382 (select |c_#length| v_arrayElimCell_216)) (.cse381 (bvadd v_prenex_96 v_prenex_98))) (or (not (= (select |c_#valid| v_prenex_97) (_ bv0 1))) (bvsle (bvadd v_prenex_98 (_ bv4 32)) (select (store |c_#length| v_prenex_97 v_prenex_99) v_arrayElimCell_216)) (not (bvsle (_ bv0 32) v_prenex_98)) (not (bvsle .cse381 .cse382)) (not (bvsle (_ bv0 32) .cse383)) (= v_arrayElimCell_216 c_main_~x~0.base) (not (bvsle .cse383 .cse384)) (not (bvsle .cse384 .cse382)) (not (bvsle v_prenex_98 .cse381))))) .cse1) (or .cse0 (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_prenex_416 (_ BitVec 32)) (v_prenex_415 (_ BitVec 32)) (v_prenex_414 (_ BitVec 32)) (v_prenex_413 (_ BitVec 32)) (v_prenex_412 (_ BitVec 32))) (let ((.cse387 (bvadd v_prenex_415 (_ bv8 32))) (.cse389 (bvadd v_prenex_416 v_prenex_415)) (.cse385 (bvadd v_prenex_415 (_ bv4 32))) (.cse386 (store |c_#length| v_prenex_414 v_prenex_413)) (.cse388 (bvadd v_prenex_415 (_ bv12 32))) (.cse390 (select |c_#length| v_arrayElimCell_69))) (or (bvsle .cse385 (select .cse386 v_prenex_412)) (not (bvsle (_ bv0 32) .cse387)) (not (bvsle (_ bv0 32) v_prenex_415)) (not (bvsle .cse387 .cse388)) (not (bvsle .cse389 .cse390)) (not (bvsle v_prenex_415 .cse389)) (not (= (select |c_#valid| v_prenex_414) (_ bv0 1))) (bvsle .cse385 (select .cse386 v_arrayElimCell_69)) (not (bvsle .cse388 .cse390))))) .cse1) (= (bvadd (select |c_#length| |c_main_write~$Pointer$_#value.base|) (_ bv4294967284 32)) (_ bv0 32)) (or .cse80 .cse0 .cse1 (forall ((v_prenex_9 (_ BitVec 32)) (v_prenex_247 (_ BitVec 32)) (v_prenex_246 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32)) (v_prenex_244 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (let ((.cse391 (bvadd v_prenex_247 v_prenex_245)) (.cse393 (select |c_#length| v_prenex_9)) (.cse394 (bvadd v_prenex_245 (_ bv8 32))) (.cse392 (bvadd v_prenex_245 (_ bv12 32))) (.cse395 (bvadd v_prenex_245 (_ bv4 32))) (.cse396 (store |c_#length| v_prenex_243 v_prenex_246))) (or (not (bvsle v_prenex_245 .cse391)) (not (bvsle .cse392 .cse393)) (not (= (select |c_#valid| v_prenex_243) (_ bv0 1))) (not (bvsle .cse391 .cse393)) (not (bvsle (_ bv0 32) .cse394)) (not (bvsle .cse394 .cse392)) (not (bvsle (_ bv0 32) v_prenex_245)) (bvsle .cse395 (select .cse396 v_prenex_9)) (= v_prenex_9 c_main_~x~0.base) (bvsle .cse395 (select .cse396 v_prenex_244)))))) (or .cse1 (forall ((v_prenex_379 (_ BitVec 32)) (v_prenex_378 (_ BitVec 32)) (v_prenex_377 (_ BitVec 32)) (v_prenex_376 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse398 (bvadd v_prenex_379 v_prenex_378)) (.cse397 (bvadd v_prenex_378 (_ bv8 32))) (.cse400 (bvadd v_prenex_378 (_ bv12 32))) (.cse399 (select |c_#length| v_arrayElimCell_187))) (or (bvsle (bvadd v_prenex_378 (_ bv4 32)) (select (store |c_#length| v_prenex_377 v_prenex_376) v_arrayElimCell_187)) (not (bvsle (_ bv0 32) .cse397)) (not (bvsle v_prenex_378 .cse398)) (not (bvsle .cse398 .cse399)) (= v_arrayElimCell_187 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_377) (_ bv0 1))) (not (bvsle .cse397 .cse400)) (not (bvsle .cse400 .cse399)) (not (bvsle (_ bv0 32) v_prenex_378)))))) (= (_ bv4 32) |c_main_write~$Pointer$_#sizeOfWrittenType|) .cse1 (or .cse80 .cse0 (forall ((v_prenex_120 (_ BitVec 32)) (v_arrayElimCell_126 (_ BitVec 32)) (v_prenex_119 (_ BitVec 32)) (v_prenex_122 (_ BitVec 32)) (v_prenex_121 (_ BitVec 32))) (let ((.cse403 (bvadd v_prenex_120 v_prenex_121)) (.cse402 (select |c_#length| v_arrayElimCell_126)) (.cse404 (bvadd v_prenex_121 (_ bv8 32))) (.cse401 (bvadd v_prenex_121 (_ bv12 32)))) (or (bvsle (bvadd v_prenex_121 (_ bv4 32)) (select (store |c_#length| v_prenex_119 v_prenex_122) v_arrayElimCell_126)) (not (bvsle .cse401 .cse402)) (not (bvsle (_ bv0 32) v_prenex_121)) (not (bvsle v_prenex_121 .cse403)) (not (bvsle .cse403 .cse402)) (not (bvsle (_ bv0 32) .cse404)) (not (= (select |c_#valid| v_prenex_119) (_ bv0 1))) (= v_arrayElimCell_126 c_main_~x~0.base) (not (bvsle .cse404 .cse401)))))) (or .cse80 (forall ((v_prenex_309 (_ BitVec 32)) (v_prenex_308 (_ BitVec 32)) (v_prenex_307 (_ BitVec 32)) (v_prenex_306 (_ BitVec 32)) (v_prenex_305 (_ BitVec 32)) (v_prenex_29 (_ BitVec 32))) (let ((.cse405 (bvadd v_prenex_307 (_ bv8 32))) (.cse408 (bvadd v_prenex_307 (_ bv12 32))) (.cse410 (bvadd v_prenex_309 v_prenex_307)) (.cse409 (select |c_#length| v_prenex_29)) (.cse406 (bvadd v_prenex_307 (_ bv4 32))) (.cse407 (store |c_#length| v_prenex_305 v_prenex_308))) (or (not (bvsle (_ bv0 32) v_prenex_307)) (not (bvsle (_ bv0 32) .cse405)) (bvsle .cse406 (select .cse407 v_prenex_29)) (not (bvsle .cse405 .cse408)) (= v_prenex_29 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_305) (_ bv0 1))) (not (bvsle .cse408 .cse409)) (not (bvsle v_prenex_307 .cse410)) (not (bvsle .cse410 .cse409)) (bvsle .cse406 (select .cse407 v_prenex_306))))) .cse1) (= c_main_~x~0.offset (_ bv0 32)) (or .cse0 .cse1 (forall ((v_prenex_152 (_ BitVec 32)) (v_arrayElimCell_223 (_ BitVec 32)) (v_prenex_151 (_ BitVec 32)) (v_prenex_150 (_ BitVec 32)) (v_prenex_149 (_ BitVec 32))) (let ((.cse411 (bvadd v_prenex_150 v_prenex_151)) (.cse412 (select |c_#length| v_arrayElimCell_223)) (.cse414 (bvadd v_prenex_151 (_ bv8 32))) (.cse413 (bvadd v_prenex_151 (_ bv12 32)))) (or (not (bvsle v_prenex_151 .cse411)) (not (bvsle .cse411 .cse412)) (= v_arrayElimCell_223 c_main_~x~0.base) (bvsle (bvadd v_prenex_151 (_ bv4 32)) (select (store |c_#length| v_prenex_149 v_prenex_152) v_arrayElimCell_223)) (not (bvsle .cse413 .cse412)) (not (bvsle (_ bv0 32) .cse414)) (not (bvsle .cse414 .cse413)) (not (= (select |c_#valid| v_prenex_149) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_151)))))) (or .cse0 .cse1 (forall ((v_arrayElimCell_219 (_ BitVec 32)) (v_prenex_48 (_ BitVec 32)) (v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32)) (v_prenex_47 (_ BitVec 32))) (let ((.cse415 (bvadd v_prenex_45 v_prenex_48)) (.cse417 (select |c_#length| v_arrayElimCell_219)) (.cse416 (bvadd v_prenex_48 (_ bv8 32))) (.cse418 (bvadd v_prenex_48 (_ bv12 32)))) (or (not (bvsle v_prenex_48 .cse415)) (not (= (select |c_#valid| v_prenex_46) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse416)) (not (bvsle (_ bv0 32) v_prenex_48)) (not (bvsle .cse415 .cse417)) (not (bvsle .cse418 .cse417)) (bvsle (bvadd v_prenex_48 (_ bv4 32)) (select (store |c_#length| v_prenex_46 v_prenex_47) v_arrayElimCell_219)) (not (bvsle .cse416 .cse418)))))) (or .cse0 .cse1 (forall ((v_prenex_153 (_ BitVec 32)) (v_arrayElimCell_58 (_ BitVec 32)) (v_prenex_157 (_ BitVec 32)) (v_prenex_156 (_ BitVec 32)) (v_prenex_155 (_ BitVec 32)) (v_prenex_154 (_ BitVec 32))) (let ((.cse422 (bvadd v_prenex_156 (_ bv12 32))) (.cse420 (select |c_#length| v_arrayElimCell_58)) (.cse419 (bvadd v_prenex_154 v_prenex_156)) (.cse421 (bvadd v_prenex_156 (_ bv8 32))) (.cse423 (bvadd v_prenex_156 (_ bv4 32))) (.cse424 (store |c_#length| v_prenex_153 v_prenex_157))) (or (not (bvsle .cse419 .cse420)) (not (bvsle .cse421 .cse422)) (not (bvsle (_ bv0 32) v_prenex_156)) (= v_arrayElimCell_58 c_main_~x~0.base) (bvsle .cse423 (select .cse424 v_prenex_155)) (not (bvsle .cse422 .cse420)) (not (bvsle v_prenex_156 .cse419)) (not (= (select |c_#valid| v_prenex_153) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse421)) (bvsle .cse423 (select .cse424 v_arrayElimCell_58))))))))) is different from true [2018-11-10 10:28:15,573 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse80 (= |c_main_write~$Pointer$_#value.base| c_main_~x~0.base)) (.cse1 (= |c_main_write~$Pointer$_#ptr.base| c_main_~x~0.base)) (.cse0 (= c_main_~x~0.offset |c_main_write~$Pointer$_#ptr.offset|))) (let ((.cse69 (not .cse0)) (.cse8 (not .cse1)) (.cse285 (not .cse80))) (and (or .cse0 .cse1 (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_prenex_70 (_ BitVec 32)) (v_prenex_71 (_ BitVec 32)) (v_prenex_67 (_ BitVec 32)) (v_prenex_68 (_ BitVec 32)) (v_prenex_69 (_ BitVec 32))) (let ((.cse4 (bvadd v_prenex_71 (_ bv8 32))) (.cse6 (bvadd v_prenex_67 v_prenex_71)) (.cse2 (bvadd v_prenex_71 (_ bv4 32))) (.cse3 (store |c_#length| v_prenex_69 v_prenex_68)) (.cse5 (bvadd v_prenex_71 (_ bv12 32))) (.cse7 (select |c_#length| v_arrayElimCell_32))) (or (bvsle .cse2 (select .cse3 v_arrayElimCell_32)) (not (bvsle .cse4 .cse5)) (not (bvsle .cse6 .cse7)) (not (= (select |c_#valid| v_prenex_69) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse4)) (not (bvsle v_prenex_71 .cse6)) (bvsle .cse2 (select .cse3 v_prenex_70)) (not (bvsle .cse5 .cse7)) (= v_arrayElimCell_32 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_71)))))) (or .cse0 .cse8 (forall ((v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_317 (_ BitVec 32)) (v_prenex_316 (_ BitVec 32)) (v_prenex_315 (_ BitVec 32)) (v_prenex_314 (_ BitVec 32))) (let ((.cse11 (select |c_#length| v_arrayElimCell_112)) (.cse9 (bvadd v_prenex_315 (_ bv8 32))) (.cse10 (bvadd v_prenex_315 (_ bv12 32))) (.cse12 (bvadd v_prenex_317 v_prenex_315))) (or (not (bvsle (_ bv0 32) .cse9)) (bvsle (bvadd v_prenex_315 (_ bv4 32)) (select (store |c_#length| v_prenex_314 v_prenex_316) v_arrayElimCell_112)) (not (= (select |c_#valid| v_prenex_314) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_315)) (not (bvsle .cse10 .cse11)) (not (bvsle .cse12 .cse11)) (not (bvsle .cse9 .cse10)) (not (bvsle v_prenex_315 .cse12)))))) (or .cse0 .cse1 (forall ((v_prenex_63 (_ BitVec 32)) (v_prenex_64 (_ BitVec 32)) (v_prenex_65 (_ BitVec 32)) (v_prenex_66 (_ BitVec 32)) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse13 (bvadd v_prenex_63 v_prenex_66)) (.cse15 (select |c_#length| v_arrayElimCell_176)) (.cse14 (bvadd v_prenex_66 (_ bv8 32))) (.cse16 (bvadd v_prenex_66 (_ bv12 32)))) (or (not (= (select |c_#valid| v_prenex_65) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_66)) (not (bvsle v_prenex_66 .cse13)) (not (bvsle (_ bv0 32) .cse14)) (bvsle (bvadd v_prenex_66 (_ bv4 32)) (select (store |c_#length| v_prenex_65 v_prenex_64) v_arrayElimCell_176)) (not (bvsle .cse13 .cse15)) (not (bvsle .cse16 .cse15)) (not (bvsle .cse14 .cse16)))))) (or .cse0 .cse8 (forall ((v_arrayElimCell_205 (_ BitVec 32)) (v_prenex_113 (_ BitVec 32)) (v_prenex_112 (_ BitVec 32)) (v_prenex_111 (_ BitVec 32)) (v_prenex_110 (_ BitVec 32))) (let ((.cse19 (bvadd v_prenex_112 (_ bv8 32))) (.cse17 (bvadd v_prenex_110 v_prenex_112)) (.cse20 (bvadd v_prenex_112 (_ bv12 32))) (.cse18 (select |c_#length| v_arrayElimCell_205))) (or (not (bvsle .cse17 .cse18)) (not (bvsle .cse19 .cse20)) (not (bvsle (_ bv0 32) .cse19)) (not (bvsle (_ bv0 32) v_prenex_112)) (not (= (select |c_#valid| v_prenex_111) (_ bv0 1))) (bvsle (bvadd v_prenex_112 (_ bv4 32)) (select (store |c_#length| v_prenex_111 v_prenex_113) v_arrayElimCell_205)) (not (bvsle v_prenex_112 .cse17)) (not (bvsle .cse20 .cse18)) (= v_arrayElimCell_205 c_main_~x~0.base))))) (or .cse0 .cse1 (forall ((v_prenex_373 (_ BitVec 32)) (v_prenex_372 (_ BitVec 32)) (v_prenex_371 (_ BitVec 32)) (v_arrayElimCell_159 (_ BitVec 32)) (v_prenex_375 (_ BitVec 32)) (v_prenex_374 (_ BitVec 32))) (let ((.cse22 (select |c_#length| v_arrayElimCell_159)) (.cse25 (bvadd v_prenex_374 (_ bv8 32))) (.cse26 (bvadd v_prenex_374 (_ bv12 32))) (.cse21 (bvadd v_prenex_375 v_prenex_374)) (.cse23 (bvadd v_prenex_374 (_ bv4 32))) (.cse24 (store |c_#length| v_prenex_373 v_prenex_372))) (or (not (bvsle .cse21 .cse22)) (bvsle .cse23 (select .cse24 v_prenex_371)) (not (bvsle (_ bv0 32) .cse25)) (= v_arrayElimCell_159 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_373) (_ bv0 1))) (not (bvsle .cse26 .cse22)) (not (bvsle .cse25 .cse26)) (not (bvsle v_prenex_374 .cse21)) (not (bvsle (_ bv0 32) v_prenex_374)) (bvsle .cse23 (select .cse24 v_arrayElimCell_159)))))) (or .cse0 (forall ((v_prenex_80 (_ BitVec 32)) (v_prenex_81 (_ BitVec 32)) (v_arrayElimCell_77 (_ BitVec 32)) (v_prenex_77 (_ BitVec 32)) (v_prenex_78 (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (let ((.cse27 (bvadd v_prenex_80 (_ bv8 32))) (.cse29 (bvadd v_prenex_77 v_prenex_80)) (.cse31 (bvadd v_prenex_80 (_ bv4 32))) (.cse32 (store |c_#length| v_prenex_78 v_prenex_81)) (.cse28 (bvadd v_prenex_80 (_ bv12 32))) (.cse30 (select |c_#length| v_arrayElimCell_77))) (or (not (bvsle (_ bv0 32) v_prenex_80)) (not (= (select |c_#valid| v_prenex_78) (_ bv0 1))) (= v_arrayElimCell_77 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse27)) (not (bvsle .cse27 .cse28)) (not (bvsle .cse29 .cse30)) (bvsle .cse31 (select .cse32 v_arrayElimCell_77)) (not (bvsle v_prenex_80 .cse29)) (bvsle .cse31 (select .cse32 v_prenex_79)) (not (bvsle .cse28 .cse30))))) .cse1) (or .cse0 .cse1 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_prenex_291 (_ BitVec 32)) (v_prenex_290 (_ BitVec 32)) (v_prenex_289 (_ BitVec 32)) (v_prenex_288 (_ BitVec 32)) (v_prenex_287 (_ BitVec 32))) (let ((.cse37 (select |c_#length| v_arrayElimCell_35)) (.cse36 (bvadd v_prenex_291 v_prenex_289)) (.cse35 (bvadd v_prenex_289 (_ bv8 32))) (.cse38 (bvadd v_prenex_289 (_ bv12 32))) (.cse33 (bvadd v_prenex_289 (_ bv4 32))) (.cse34 (store |c_#length| v_prenex_287 v_prenex_290))) (or (bvsle .cse33 (select .cse34 v_arrayElimCell_35)) (not (bvsle (_ bv0 32) .cse35)) (not (bvsle .cse36 .cse37)) (not (bvsle .cse38 .cse37)) (not (bvsle v_prenex_289 .cse36)) (not (= (select |c_#valid| v_prenex_287) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_289)) (= v_arrayElimCell_35 c_main_~x~0.base) (not (bvsle .cse35 .cse38)) (bvsle .cse33 (select .cse34 v_prenex_288)))))) (or (forall ((v_prenex_319 (_ BitVec 32)) (v_prenex_318 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_prenex_322 (_ BitVec 32)) (v_prenex_321 (_ BitVec 32)) (v_prenex_320 (_ BitVec 32))) (let ((.cse39 (bvadd v_prenex_322 v_prenex_320)) (.cse42 (bvadd v_prenex_320 (_ bv12 32))) (.cse40 (select |c_#length| v_arrayElimCell_182)) (.cse41 (bvadd v_prenex_320 (_ bv8 32))) (.cse43 (bvadd v_prenex_320 (_ bv4 32))) (.cse44 (store |c_#length| v_prenex_318 v_prenex_321))) (or (not (bvsle .cse39 .cse40)) (not (bvsle .cse41 .cse42)) (not (= (select |c_#valid| v_prenex_318) (_ bv0 1))) (bvsle .cse43 (select .cse44 v_arrayElimCell_182)) (= v_arrayElimCell_182 c_main_~x~0.base) (not (bvsle v_prenex_320 .cse39)) (not (bvsle .cse42 .cse40)) (not (bvsle (_ bv0 32) v_prenex_320)) (not (bvsle (_ bv0 32) .cse41)) (bvsle .cse43 (select .cse44 v_prenex_319))))) .cse1) (or (forall ((v_arrayElimCell_66 (_ BitVec 32)) (v_prenex_339 (_ BitVec 32)) (v_prenex_338 (_ BitVec 32)) (v_prenex_337 (_ BitVec 32)) (v_prenex_336 (_ BitVec 32))) (let ((.cse45 (bvadd v_prenex_339 v_prenex_337)) (.cse46 (select |c_#length| v_arrayElimCell_66)) (.cse47 (bvadd v_prenex_337 (_ bv8 32))) (.cse48 (bvadd v_prenex_337 (_ bv12 32)))) (or (not (bvsle v_prenex_337 .cse45)) (not (bvsle .cse45 .cse46)) (not (= (select |c_#valid| v_prenex_336) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_337)) (not (bvsle (_ bv0 32) .cse47)) (bvsle (bvadd v_prenex_337 (_ bv4 32)) (select (store |c_#length| v_prenex_336 v_prenex_338) v_arrayElimCell_66)) (not (bvsle .cse48 .cse46)) (not (bvsle .cse47 .cse48))))) .cse0 .cse1) (or .cse0 .cse1 (forall ((v_arrayElimCell_167 (_ BitVec 32)) (v_prenex_142 (_ BitVec 32)) (v_prenex_141 (_ BitVec 32)) (v_prenex_140 (_ BitVec 32)) (v_prenex_144 (_ BitVec 32)) (v_prenex_143 (_ BitVec 32))) (let ((.cse52 (bvadd v_prenex_143 (_ bv12 32))) (.cse50 (select |c_#length| v_arrayElimCell_167)) (.cse49 (bvadd v_prenex_141 v_prenex_143)) (.cse51 (bvadd v_prenex_143 (_ bv8 32))) (.cse53 (bvadd v_prenex_143 (_ bv4 32))) (.cse54 (store |c_#length| v_prenex_140 v_prenex_144))) (or (not (bvsle .cse49 .cse50)) (not (bvsle .cse51 .cse52)) (bvsle .cse53 (select .cse54 v_arrayElimCell_167)) (not (bvsle .cse52 .cse50)) (not (bvsle v_prenex_143 .cse49)) (not (bvsle (_ bv0 32) .cse51)) (not (bvsle (_ bv0 32) v_prenex_143)) (not (= (select |c_#valid| v_prenex_140) (_ bv0 1))) (bvsle .cse53 (select .cse54 v_prenex_142)))))) (or .cse0 (forall ((v_prenex_186 (_ BitVec 32)) (v_prenex_189 (_ BitVec 32)) (v_prenex_13 (_ BitVec 32)) (v_prenex_188 (_ BitVec 32)) (v_prenex_187 (_ BitVec 32))) (let ((.cse55 (bvadd v_prenex_187 v_prenex_188)) (.cse57 (bvadd v_prenex_188 (_ bv12 32))) (.cse58 (select |c_#length| v_prenex_13)) (.cse56 (bvadd v_prenex_188 (_ bv8 32)))) (or (not (bvsle v_prenex_188 .cse55)) (not (bvsle .cse56 .cse57)) (not (bvsle .cse55 .cse58)) (not (bvsle (_ bv0 32) v_prenex_188)) (= v_prenex_13 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_186) (_ bv0 1))) (not (bvsle .cse57 .cse58)) (bvsle (bvadd v_prenex_188 (_ bv4 32)) (select (store |c_#length| v_prenex_186 v_prenex_189) v_prenex_13)) (not (bvsle (_ bv0 32) .cse56))))) .cse1) (or (forall ((v_prenex_104 (_ BitVec 32)) (v_prenex_103 (_ BitVec 32)) (v_prenex_102 (_ BitVec 32)) (v_prenex_101 (_ BitVec 32)) (v_prenex_100 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (let ((.cse59 (bvadd v_prenex_100 v_prenex_103)) (.cse61 (select |c_#length| v_arrayElimCell_155)) (.cse62 (bvadd v_prenex_103 (_ bv4 32))) (.cse63 (store |c_#length| v_prenex_101 v_prenex_104)) (.cse64 (bvadd v_prenex_103 (_ bv8 32))) (.cse60 (bvadd v_prenex_103 (_ bv12 32)))) (or (not (bvsle v_prenex_103 .cse59)) (not (bvsle .cse60 .cse61)) (not (bvsle .cse59 .cse61)) (bvsle .cse62 (select .cse63 v_prenex_102)) (not (bvsle (_ bv0 32) v_prenex_103)) (bvsle .cse62 (select .cse63 v_arrayElimCell_155)) (not (= (select |c_#valid| v_prenex_101) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse64)) (not (bvsle .cse64 .cse60))))) .cse1) (or .cse0 .cse8 (forall ((v_arrayElimCell_207 (_ BitVec 32)) (v_prenex_256 (_ BitVec 32)) (v_prenex_255 (_ BitVec 32)) (v_prenex_254 (_ BitVec 32)) (v_prenex_253 (_ BitVec 32))) (let ((.cse67 (bvadd v_prenex_254 (_ bv12 32))) (.cse65 (bvadd v_prenex_256 v_prenex_254)) (.cse68 (select |c_#length| v_arrayElimCell_207)) (.cse66 (bvadd v_prenex_254 (_ bv8 32)))) (or (not (bvsle v_prenex_254 .cse65)) (not (bvsle (_ bv0 32) v_prenex_254)) (not (bvsle .cse66 .cse67)) (not (= (select |c_#valid| v_prenex_253) (_ bv0 1))) (not (bvsle .cse67 .cse68)) (bvsle (bvadd v_prenex_254 (_ bv4 32)) (select (store |c_#length| v_prenex_253 v_prenex_255) v_arrayElimCell_207)) (not (bvsle .cse65 .cse68)) (not (bvsle (_ bv0 32) .cse66)))))) (or .cse8 .cse69 (forall ((v_prenex_361 (_ BitVec 32)) (v_prenex_360 (_ BitVec 32)) (v_prenex_359 (_ BitVec 32)) (v_prenex_358 (_ BitVec 32))) (let ((.cse72 (bvadd v_prenex_360 (_ bv12 32))) (.cse70 (bvadd v_prenex_361 v_prenex_360)) (.cse73 (select |c_#length| |c_main_write~$Pointer$_#value.base|)) (.cse71 (bvadd v_prenex_360 (_ bv8 32)))) (or (not (bvsle v_prenex_360 .cse70)) (not (bvsle .cse71 .cse72)) (not (bvsle .cse72 .cse73)) (not (bvsle (_ bv0 32) v_prenex_360)) (bvsle (bvadd v_prenex_360 (_ bv4 32)) (select (store |c_#length| v_prenex_359 v_prenex_358) |c_main_write~$Pointer$_#value.base|)) (not (= (select |c_#valid| v_prenex_359) (_ bv0 1))) (not (bvsle .cse70 .cse73)) (not (bvsle (_ bv0 32) .cse71)))))) (or (forall ((v_arrayElimCell_201 (_ BitVec 32)) (v_prenex_219 (_ BitVec 32)) (v_prenex_218 (_ BitVec 32)) (v_prenex_217 (_ BitVec 32)) (v_prenex_216 (_ BitVec 32)) (v_prenex_220 (_ BitVec 32))) (let ((.cse75 (bvadd v_prenex_218 (_ bv4 32))) (.cse76 (store |c_#length| v_prenex_216 v_prenex_219)) (.cse74 (bvadd v_prenex_220 v_prenex_218)) (.cse78 (select |c_#length| v_arrayElimCell_201)) (.cse79 (bvadd v_prenex_218 (_ bv8 32))) (.cse77 (bvadd v_prenex_218 (_ bv12 32)))) (or (not (bvsle v_prenex_218 .cse74)) (bvsle .cse75 (select .cse76 v_arrayElimCell_201)) (= v_arrayElimCell_201 c_main_~x~0.base) (bvsle .cse75 (select .cse76 v_prenex_217)) (not (bvsle (_ bv0 32) v_prenex_218)) (not (bvsle .cse77 .cse78)) (not (bvsle .cse74 .cse78)) (not (= (select |c_#valid| v_prenex_216) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse79)) (not (bvsle .cse79 .cse77))))) .cse1) (or .cse80 .cse0 .cse8 (forall ((v_prenex_340 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_343 (_ BitVec 32)) (v_prenex_342 (_ BitVec 32)) (v_prenex_341 (_ BitVec 32))) (let ((.cse81 (bvadd v_prenex_343 v_prenex_341)) (.cse83 (bvadd v_prenex_341 (_ bv8 32))) (.cse84 (bvadd v_prenex_341 (_ bv12 32))) (.cse82 (select |c_#length| v_arrayElimCell_109))) (or (bvsle (bvadd v_prenex_341 (_ bv4 32)) (select (store |c_#length| v_prenex_340 v_prenex_342) v_arrayElimCell_109)) (not (bvsle .cse81 .cse82)) (not (bvsle (_ bv0 32) .cse83)) (not (bvsle v_prenex_341 .cse81)) (not (bvsle (_ bv0 32) v_prenex_341)) (not (bvsle .cse83 .cse84)) (not (= (select |c_#valid| v_prenex_340) (_ bv0 1))) (= v_arrayElimCell_109 c_main_~x~0.base) (not (bvsle .cse84 .cse82)))))) (or .cse1 (forall ((v_prenex_263 (_ BitVec 32)) (v_prenex_262 (_ BitVec 32)) (v_prenex_261 (_ BitVec 32)) (v_arrayElimCell_133 (_ BitVec 32)) (v_prenex_264 (_ BitVec 32))) (let ((.cse86 (select |c_#length| v_arrayElimCell_133)) (.cse88 (bvadd v_prenex_264 v_prenex_262)) (.cse87 (bvadd v_prenex_262 (_ bv8 32))) (.cse85 (bvadd v_prenex_262 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_262)) (not (bvsle .cse85 .cse86)) (not (bvsle (_ bv0 32) .cse87)) (not (bvsle .cse88 .cse86)) (not (bvsle v_prenex_262 .cse88)) (= v_arrayElimCell_133 c_main_~x~0.base) (not (bvsle .cse87 .cse85)) (bvsle (bvadd v_prenex_262 (_ bv4 32)) (select (store |c_#length| v_prenex_261 v_prenex_263) v_arrayElimCell_133)) (not (= (select |c_#valid| v_prenex_261) (_ bv0 1))))))) (or .cse80 .cse0 .cse1 (forall ((v_arrayElimCell_125 (_ BitVec 32)) (v_prenex_234 (_ BitVec 32)) (v_prenex_233 (_ BitVec 32)) (v_prenex_232 (_ BitVec 32)) (v_prenex_231 (_ BitVec 32))) (let ((.cse90 (bvadd v_prenex_232 (_ bv12 32))) (.cse89 (bvadd v_prenex_232 (_ bv8 32))) (.cse91 (select |c_#length| v_arrayElimCell_125)) (.cse92 (bvadd v_prenex_234 v_prenex_232))) (or (not (= (select |c_#valid| v_prenex_231) (_ bv0 1))) (not (bvsle .cse89 .cse90)) (not (bvsle .cse90 .cse91)) (not (bvsle (_ bv0 32) .cse89)) (= v_arrayElimCell_125 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_232)) (not (bvsle .cse92 .cse91)) (bvsle (bvadd v_prenex_232 (_ bv4 32)) (select (store |c_#length| v_prenex_231 v_prenex_233) v_arrayElimCell_125)) (not (bvsle v_prenex_232 .cse92)))))) (or .cse0 .cse1 (forall ((v_prenex_274 (_ BitVec 32)) (v_arrayElimCell_102 (_ BitVec 32)) (v_prenex_277 (_ BitVec 32)) (v_prenex_276 (_ BitVec 32)) (v_prenex_275 (_ BitVec 32))) (let ((.cse94 (bvadd v_prenex_275 (_ bv12 32))) (.cse93 (bvadd v_prenex_275 (_ bv8 32))) (.cse95 (bvadd v_prenex_277 v_prenex_275)) (.cse96 (select |c_#length| v_arrayElimCell_102))) (or (not (bvsle .cse93 .cse94)) (not (bvsle v_prenex_275 .cse95)) (not (bvsle .cse94 .cse96)) (bvsle (bvadd v_prenex_275 (_ bv4 32)) (select (store |c_#length| v_prenex_274 v_prenex_276) v_arrayElimCell_102)) (not (bvsle (_ bv0 32) .cse93)) (not (= (select |c_#valid| v_prenex_274) (_ bv0 1))) (not (bvsle .cse95 .cse96)) (not (bvsle (_ bv0 32) v_prenex_275)))))) (or .cse80 .cse0 .cse1 (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_prenex_296 (_ BitVec 32)) (v_prenex_295 (_ BitVec 32)) (v_prenex_294 (_ BitVec 32)) (v_prenex_293 (_ BitVec 32)) (v_prenex_292 (_ BitVec 32))) (let ((.cse100 (select |c_#length| v_arrayElimCell_46)) (.cse99 (bvadd v_prenex_294 (_ bv12 32))) (.cse101 (bvadd v_prenex_296 v_prenex_294)) (.cse102 (bvadd v_prenex_294 (_ bv8 32))) (.cse97 (bvadd v_prenex_294 (_ bv4 32))) (.cse98 (store |c_#length| v_prenex_292 v_prenex_295))) (or (not (= (select |c_#valid| v_prenex_292) (_ bv0 1))) (bvsle .cse97 (select .cse98 v_arrayElimCell_46)) (not (bvsle (_ bv0 32) v_prenex_294)) (not (bvsle .cse99 .cse100)) (not (bvsle .cse101 .cse100)) (= v_arrayElimCell_46 c_main_~x~0.base) (not (bvsle .cse102 .cse99)) (not (bvsle v_prenex_294 .cse101)) (not (bvsle (_ bv0 32) .cse102)) (bvsle .cse97 (select .cse98 v_prenex_293)))))) (or .cse80 (forall ((v_prenex_370 (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_369 (_ BitVec 32)) (v_prenex_368 (_ BitVec 32)) (v_prenex_367 (_ BitVec 32))) (let ((.cse104 (bvadd v_prenex_369 (_ bv8 32))) (.cse103 (bvadd v_prenex_370 v_prenex_369)) (.cse105 (bvadd v_prenex_369 (_ bv12 32))) (.cse106 (select |c_#length| v_prenex_16))) (or (not (= (select |c_#valid| v_prenex_368) (_ bv0 1))) (= v_prenex_16 c_main_~x~0.base) (not (bvsle v_prenex_369 .cse103)) (not (bvsle .cse104 .cse105)) (bvsle (bvadd v_prenex_369 (_ bv4 32)) (select (store |c_#length| v_prenex_368 v_prenex_367) v_prenex_16)) (not (bvsle (_ bv0 32) .cse104)) (not (bvsle (_ bv0 32) v_prenex_369)) (not (bvsle .cse103 .cse106)) (not (bvsle .cse105 .cse106))))) .cse0 .cse1) (or (forall ((v_prenex_209 (_ BitVec 32)) (v_prenex_208 (_ BitVec 32)) (v_prenex_207 (_ BitVec 32)) (v_arrayElimCell_195 (_ BitVec 32)) (v_prenex_210 (_ BitVec 32))) (let ((.cse107 (bvadd v_prenex_210 v_prenex_208)) (.cse109 (select |c_#length| v_arrayElimCell_195)) (.cse108 (bvadd v_prenex_208 (_ bv8 32))) (.cse110 (bvadd v_prenex_208 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_208)) (not (bvsle v_prenex_208 .cse107)) (= v_arrayElimCell_195 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse108)) (not (bvsle .cse107 .cse109)) (bvsle (bvadd v_prenex_208 (_ bv4 32)) (select (store |c_#length| v_prenex_207 v_prenex_209) v_arrayElimCell_195)) (not (= (select |c_#valid| v_prenex_207) (_ bv0 1))) (not (bvsle .cse110 .cse109)) (not (bvsle .cse108 .cse110))))) .cse1) (or .cse0 .cse1 (forall ((v_prenex_84 (_ BitVec 32)) (v_prenex_85 (_ BitVec 32)) (v_arrayElimCell_49 (_ BitVec 32)) (v_prenex_82 (_ BitVec 32)) (v_prenex_83 (_ BitVec 32))) (let ((.cse113 (bvadd v_prenex_82 v_prenex_84)) (.cse112 (select |c_#length| v_arrayElimCell_49)) (.cse114 (bvadd v_prenex_84 (_ bv8 32))) (.cse111 (bvadd v_prenex_84 (_ bv12 32)))) (or (not (bvsle .cse111 .cse112)) (not (bvsle v_prenex_84 .cse113)) (not (bvsle .cse113 .cse112)) (= v_arrayElimCell_49 c_main_~x~0.base) (bvsle (bvadd v_prenex_84 (_ bv4 32)) (select (store |c_#length| v_prenex_83 v_prenex_85) v_arrayElimCell_49)) (not (bvsle (_ bv0 32) v_prenex_84)) (not (bvsle (_ bv0 32) .cse114)) (not (bvsle .cse114 .cse111)) (not (= (select |c_#valid| v_prenex_83) (_ bv0 1))))))) (or .cse0 .cse1 (forall ((v_prenex_348 (_ BitVec 32)) (v_prenex_347 (_ BitVec 32)) (v_prenex_346 (_ BitVec 32)) (v_prenex_345 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_344 (_ BitVec 32))) (let ((.cse117 (select |c_#length| v_prenex_4)) (.cse118 (bvadd v_prenex_346 (_ bv4 32))) (.cse119 (store |c_#length| v_prenex_344 v_prenex_347)) (.cse116 (bvadd v_prenex_348 v_prenex_346)) (.cse115 (bvadd v_prenex_346 (_ bv8 32))) (.cse120 (bvadd v_prenex_346 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_346)) (not (bvsle (_ bv0 32) .cse115)) (not (bvsle .cse116 .cse117)) (not (= (select |c_#valid| v_prenex_344) (_ bv0 1))) (bvsle .cse118 (select .cse119 v_prenex_345)) (not (bvsle .cse120 .cse117)) (bvsle .cse118 (select .cse119 v_prenex_4)) (not (bvsle v_prenex_346 .cse116)) (not (bvsle .cse115 .cse120)) (= v_prenex_4 c_main_~x~0.base))))) (or .cse80 .cse1 (forall ((v_prenex_409 (_ BitVec 32)) (v_prenex_408 (_ BitVec 32)) (v_prenex_407 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32)) (v_prenex_411 (_ BitVec 32)) (v_prenex_410 (_ BitVec 32))) (let ((.cse124 (bvadd v_prenex_411 v_prenex_410)) (.cse125 (select |c_#length| v_prenex_28)) (.cse121 (bvadd v_prenex_410 (_ bv4 32))) (.cse122 (store |c_#length| v_prenex_409 v_prenex_408)) (.cse123 (bvadd v_prenex_410 (_ bv8 32))) (.cse126 (bvadd v_prenex_410 (_ bv12 32)))) (or (bvsle .cse121 (select .cse122 v_prenex_28)) (not (bvsle (_ bv0 32) .cse123)) (not (= (select |c_#valid| v_prenex_409) (_ bv0 1))) (not (bvsle .cse124 .cse125)) (not (bvsle v_prenex_410 .cse124)) (not (bvsle .cse126 .cse125)) (bvsle .cse121 (select .cse122 v_prenex_407)) (not (bvsle .cse123 .cse126)) (not (bvsle (_ bv0 32) v_prenex_410)))))) (= (bvadd (select |c_#valid| |c_main_write~$Pointer$_#value.base|) (_ bv1 1)) (_ bv0 1)) (or .cse0 (forall ((v_arrayElimCell_170 (_ BitVec 32)) (v_prenex_202 (_ BitVec 32)) (v_prenex_201 (_ BitVec 32)) (v_prenex_200 (_ BitVec 32)) (v_prenex_199 (_ BitVec 32))) (let ((.cse127 (bvadd v_prenex_202 v_prenex_200)) (.cse129 (bvadd v_prenex_200 (_ bv12 32))) (.cse130 (select |c_#length| v_arrayElimCell_170)) (.cse128 (bvadd v_prenex_200 (_ bv8 32)))) (or (= v_arrayElimCell_170 c_main_~x~0.base) (not (bvsle v_prenex_200 .cse127)) (bvsle (bvadd v_prenex_200 (_ bv4 32)) (select (store |c_#length| v_prenex_199 v_prenex_201) v_arrayElimCell_170)) (not (bvsle .cse128 .cse129)) (not (bvsle .cse127 .cse130)) (not (= (select |c_#valid| v_prenex_199) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_200)) (not (bvsle .cse129 .cse130)) (not (bvsle (_ bv0 32) .cse128))))) .cse1) (or .cse1 (forall ((v_arrayElimCell_192 (_ BitVec 32)) (v_prenex_402 (_ BitVec 32)) (v_prenex_401 (_ BitVec 32)) (v_prenex_400 (_ BitVec 32)) (v_prenex_399 (_ BitVec 32))) (let ((.cse132 (bvadd v_prenex_401 (_ bv12 32))) (.cse134 (bvadd v_prenex_402 v_prenex_401)) (.cse133 (select |c_#length| v_arrayElimCell_192)) (.cse131 (bvadd v_prenex_401 (_ bv8 32)))) (or (not (bvsle .cse131 .cse132)) (not (bvsle (_ bv0 32) v_prenex_401)) (not (bvsle .cse132 .cse133)) (not (bvsle v_prenex_401 .cse134)) (bvsle (bvadd v_prenex_401 (_ bv4 32)) (select (store |c_#length| v_prenex_400 v_prenex_399) v_arrayElimCell_192)) (not (bvsle .cse134 .cse133)) (not (= (select |c_#valid| v_prenex_400) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse131)))))) (or .cse80 .cse1 (forall ((v_prenex_86 (_ BitVec 32)) (v_prenex_87 (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_88 (_ BitVec 32)) (v_prenex_23 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (let ((.cse135 (bvadd v_prenex_86 v_prenex_89)) (.cse137 (bvadd v_prenex_89 (_ bv4 32))) (.cse138 (store |c_#length| v_prenex_87 v_prenex_90)) (.cse139 (bvadd v_prenex_89 (_ bv8 32))) (.cse140 (bvadd v_prenex_89 (_ bv12 32))) (.cse136 (select |c_#length| v_prenex_23))) (or (not (bvsle .cse135 .cse136)) (= v_prenex_23 c_main_~x~0.base) (bvsle .cse137 (select .cse138 v_prenex_23)) (not (bvsle .cse139 .cse140)) (not (bvsle v_prenex_89 .cse135)) (bvsle .cse137 (select .cse138 v_prenex_88)) (not (bvsle (_ bv0 32) v_prenex_89)) (not (bvsle (_ bv0 32) .cse139)) (not (bvsle .cse140 .cse136)) (not (= (select |c_#valid| v_prenex_87) (_ bv0 1))))))) (or .cse80 .cse8 (forall ((v_prenex_268 (_ BitVec 32)) (v_prenex_267 (_ BitVec 32)) (v_prenex_266 (_ BitVec 32)) (v_prenex_265 (_ BitVec 32))) (let ((.cse143 (bvadd v_prenex_266 (_ bv8 32))) (.cse141 (bvadd v_prenex_266 (_ bv12 32))) (.cse144 (bvadd v_prenex_268 v_prenex_266)) (.cse142 (select |c_#length| |c_main_write~$Pointer$_#value.base|))) (or (not (bvsle .cse141 .cse142)) (not (= (select |c_#valid| v_prenex_265) (_ bv0 1))) (bvsle (bvadd v_prenex_266 (_ bv4 32)) (select (store |c_#length| v_prenex_265 v_prenex_267) |c_main_write~$Pointer$_#value.base|)) (not (bvsle (_ bv0 32) .cse143)) (not (bvsle (_ bv0 32) v_prenex_266)) (not (bvsle v_prenex_266 .cse144)) (not (bvsle .cse143 .cse141)) (not (bvsle .cse144 .cse142))))) .cse69) (or .cse0 .cse1 (forall ((v_prenex_273 (_ BitVec 32)) (v_prenex_272 (_ BitVec 32)) (v_prenex_271 (_ BitVec 32)) (v_prenex_270 (_ BitVec 32)) (v_prenex_269 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse145 (bvadd v_prenex_271 (_ bv12 32))) (.cse148 (bvadd v_prenex_271 (_ bv4 32))) (.cse149 (store |c_#length| v_prenex_269 v_prenex_272)) (.cse150 (bvadd v_prenex_271 (_ bv8 32))) (.cse147 (bvadd v_prenex_273 v_prenex_271)) (.cse146 (select |c_#length| v_prenex_11))) (or (not (bvsle .cse145 .cse146)) (not (= (select |c_#valid| v_prenex_269) (_ bv0 1))) (= v_prenex_11 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_271)) (not (bvsle v_prenex_271 .cse147)) (bvsle .cse148 (select .cse149 v_prenex_11)) (not (bvsle .cse150 .cse145)) (bvsle .cse148 (select .cse149 v_prenex_270)) (not (bvsle (_ bv0 32) .cse150)) (not (bvsle .cse147 .cse146)))))) (or .cse80 .cse0 .cse1 (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_126 (_ BitVec 32)) (v_prenex_125 (_ BitVec 32)) (v_prenex_124 (_ BitVec 32)) (v_prenex_123 (_ BitVec 32))) (let ((.cse151 (bvadd v_prenex_124 v_prenex_125)) (.cse152 (select |c_#length| v_prenex_15)) (.cse154 (bvadd v_prenex_125 (_ bv8 32))) (.cse153 (bvadd v_prenex_125 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_125)) (bvsle (bvadd v_prenex_125 (_ bv4 32)) (select (store |c_#length| v_prenex_123 v_prenex_126) v_prenex_15)) (not (bvsle v_prenex_125 .cse151)) (not (bvsle .cse151 .cse152)) (not (= (select |c_#valid| v_prenex_123) (_ bv0 1))) (not (bvsle .cse153 .cse152)) (not (bvsle (_ bv0 32) .cse154)) (not (bvsle .cse154 .cse153)))))) (or .cse0 .cse1 (forall ((v_prenex_194 (_ BitVec 32)) (v_prenex_193 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32)) (v_prenex_192 (_ BitVec 32)) (v_prenex_191 (_ BitVec 32)) (v_prenex_190 (_ BitVec 32))) (let ((.cse155 (bvadd v_prenex_192 (_ bv12 32))) (.cse159 (bvadd v_prenex_192 (_ bv8 32))) (.cse157 (bvadd v_prenex_192 (_ bv4 32))) (.cse158 (store |c_#length| v_prenex_190 v_prenex_193)) (.cse160 (bvadd v_prenex_194 v_prenex_192)) (.cse156 (select |c_#length| v_arrayElimCell_43))) (or (not (bvsle .cse155 .cse156)) (not (bvsle (_ bv0 32) v_prenex_192)) (bvsle .cse157 (select .cse158 v_arrayElimCell_43)) (= v_arrayElimCell_43 c_main_~x~0.base) (not (bvsle .cse159 .cse155)) (not (bvsle (_ bv0 32) .cse159)) (not (bvsle v_prenex_192 .cse160)) (not (= (select |c_#valid| v_prenex_190) (_ bv0 1))) (bvsle .cse157 (select .cse158 v_prenex_191)) (not (bvsle .cse160 .cse156)))))) (or (forall ((v_prenex_30 (_ BitVec 32)) (v_prenex_313 (_ BitVec 32)) (v_prenex_312 (_ BitVec 32)) (v_prenex_311 (_ BitVec 32)) (v_prenex_310 (_ BitVec 32))) (let ((.cse161 (bvadd v_prenex_313 v_prenex_311)) (.cse162 (select |c_#length| v_prenex_30)) (.cse163 (bvadd v_prenex_311 (_ bv8 32))) (.cse164 (bvadd v_prenex_311 (_ bv12 32)))) (or (= v_prenex_30 c_main_~x~0.base) (not (bvsle .cse161 .cse162)) (not (bvsle v_prenex_311 .cse161)) (not (= (select |c_#valid| v_prenex_310) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse163)) (not (bvsle (_ bv0 32) v_prenex_311)) (not (bvsle .cse164 .cse162)) (bvsle (bvadd v_prenex_311 (_ bv4 32)) (select (store |c_#length| v_prenex_310 v_prenex_312) v_prenex_30)) (not (bvsle .cse163 .cse164))))) .cse1) (or .cse0 (forall ((v_arrayElimCell_117 (_ BitVec 32)) (v_prenex_326 (_ BitVec 32)) (v_prenex_325 (_ BitVec 32)) (v_prenex_324 (_ BitVec 32)) (v_prenex_323 (_ BitVec 32))) (let ((.cse165 (bvadd v_prenex_324 (_ bv8 32))) (.cse168 (bvadd v_prenex_324 (_ bv12 32))) (.cse167 (select |c_#length| v_arrayElimCell_117)) (.cse166 (bvadd v_prenex_326 v_prenex_324))) (or (not (bvsle (_ bv0 32) .cse165)) (not (bvsle (_ bv0 32) v_prenex_324)) (not (bvsle .cse166 .cse167)) (bvsle (bvadd v_prenex_324 (_ bv4 32)) (select (store |c_#length| v_prenex_323 v_prenex_325) v_arrayElimCell_117)) (not (= (select |c_#valid| v_prenex_323) (_ bv0 1))) (not (bvsle .cse165 .cse168)) (not (bvsle .cse168 .cse167)) (not (bvsle v_prenex_324 .cse166))))) .cse1) (or .cse80 (forall ((v_prenex_27 (_ BitVec 32)) (v_prenex_300 (_ BitVec 32)) (v_prenex_299 (_ BitVec 32)) (v_prenex_298 (_ BitVec 32)) (v_prenex_297 (_ BitVec 32))) (let ((.cse169 (bvadd v_prenex_300 v_prenex_298)) (.cse172 (bvadd v_prenex_298 (_ bv12 32))) (.cse170 (select |c_#length| v_prenex_27)) (.cse171 (bvadd v_prenex_298 (_ bv8 32)))) (or (bvsle (bvadd v_prenex_298 (_ bv4 32)) (select (store |c_#length| v_prenex_297 v_prenex_299) v_prenex_27)) (not (= (select |c_#valid| v_prenex_297) (_ bv0 1))) (not (bvsle v_prenex_298 .cse169)) (not (bvsle .cse169 .cse170)) (not (bvsle (_ bv0 32) v_prenex_298)) (not (bvsle .cse171 .cse172)) (not (bvsle .cse172 .cse170)) (not (bvsle (_ bv0 32) .cse171)) (= v_prenex_27 c_main_~x~0.base)))) .cse1) .cse0 (or .cse0 .cse1 (forall ((v_prenex_7 (_ BitVec 32)) (v_prenex_357 (_ BitVec 32)) (v_prenex_356 (_ BitVec 32)) (v_prenex_355 (_ BitVec 32)) (v_prenex_354 (_ BitVec 32)) (v_prenex_353 (_ BitVec 32))) (let ((.cse173 (bvadd v_prenex_356 (_ bv8 32))) (.cse174 (bvadd v_prenex_356 (_ bv12 32))) (.cse175 (bvadd v_prenex_356 (_ bv4 32))) (.cse176 (store |c_#length| v_prenex_355 v_prenex_354)) (.cse177 (bvadd v_prenex_357 v_prenex_356)) (.cse178 (select |c_#length| v_prenex_7))) (or (not (bvsle .cse173 .cse174)) (not (= (select |c_#valid| v_prenex_355) (_ bv0 1))) (bvsle .cse175 (select .cse176 v_prenex_7)) (= v_prenex_7 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse173)) (not (bvsle v_prenex_356 .cse177)) (not (bvsle .cse174 .cse178)) (not (bvsle (_ bv0 32) v_prenex_356)) (bvsle .cse175 (select .cse176 v_prenex_353)) (not (bvsle .cse177 .cse178)))))) (or .cse80 (forall ((v_prenex_51 (_ BitVec 32)) (v_prenex_52 (_ BitVec 32)) (v_prenex_50 (_ BitVec 32)) (v_prenex_49 (_ BitVec 32)) (v_prenex_33 (_ BitVec 32))) (let ((.cse180 (select |c_#length| v_prenex_33)) (.cse181 (bvadd v_prenex_49 v_prenex_52)) (.cse182 (bvadd v_prenex_52 (_ bv8 32))) (.cse179 (bvadd v_prenex_52 (_ bv12 32)))) (or (not (bvsle .cse179 .cse180)) (= v_prenex_33 c_main_~x~0.base) (not (bvsle .cse181 .cse180)) (not (bvsle v_prenex_52 .cse181)) (not (bvsle (_ bv0 32) .cse182)) (bvsle (bvadd v_prenex_52 (_ bv4 32)) (select (store |c_#length| v_prenex_50 v_prenex_51) v_prenex_33)) (not (= (select |c_#valid| v_prenex_50) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_52)) (not (bvsle .cse182 .cse179))))) .cse1) (or .cse1 (forall ((v_prenex_53 (_ BitVec 32)) (v_prenex_54 (_ BitVec 32)) (v_prenex_55 (_ BitVec 32)) (v_prenex_56 (_ BitVec 32)) (v_prenex_57 (_ BitVec 32))) (let ((.cse183 (bvadd v_prenex_57 (_ bv8 32))) (.cse184 (bvadd v_prenex_57 (_ bv12 32))) (.cse186 (bvadd v_prenex_53 v_prenex_57)) (.cse185 (select |c_#length| v_prenex_56))) (or (not (bvsle (_ bv0 32) .cse183)) (not (bvsle (_ bv0 32) v_prenex_57)) (not (bvsle .cse184 .cse185)) (bvsle (bvadd v_prenex_57 (_ bv4 32)) (select (store |c_#length| v_prenex_55 v_prenex_54) v_prenex_56)) (not (bvsle v_prenex_57 .cse186)) (not (bvsle .cse183 .cse184)) (not (= (select |c_#valid| v_prenex_55) (_ bv0 1))) (not (bvsle .cse186 .cse185)))))) (or .cse1 (forall ((v_prenex_109 (_ BitVec 32)) (v_prenex_108 (_ BitVec 32)) (v_prenex_107 (_ BitVec 32)) (v_prenex_106 (_ BitVec 32)) (v_prenex_26 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (let ((.cse187 (bvadd v_prenex_105 v_prenex_108)) (.cse189 (bvadd v_prenex_108 (_ bv8 32))) (.cse191 (bvadd v_prenex_108 (_ bv4 32))) (.cse192 (store |c_#length| v_prenex_106 v_prenex_109)) (.cse190 (bvadd v_prenex_108 (_ bv12 32))) (.cse188 (select |c_#length| v_prenex_26))) (or (not (bvsle .cse187 .cse188)) (not (= (select |c_#valid| v_prenex_106) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse189)) (not (bvsle (_ bv0 32) v_prenex_108)) (not (bvsle v_prenex_108 .cse187)) (not (bvsle .cse189 .cse190)) (bvsle .cse191 (select .cse192 v_prenex_26)) (bvsle .cse191 (select .cse192 v_prenex_107)) (not (bvsle .cse190 .cse188)))))) (or .cse80 (forall ((v_prenex_335 (_ BitVec 32)) (v_prenex_334 (_ BitVec 32)) (v_prenex_333 (_ BitVec 32)) (v_prenex_332 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse193 (bvadd v_prenex_333 (_ bv8 32))) (.cse194 (bvadd v_prenex_333 (_ bv12 32))) (.cse195 (select |c_#length| v_prenex_24)) (.cse196 (bvadd v_prenex_335 v_prenex_333))) (or (not (bvsle (_ bv0 32) .cse193)) (bvsle (bvadd v_prenex_333 (_ bv4 32)) (select (store |c_#length| v_prenex_332 v_prenex_334) v_prenex_24)) (not (= (select |c_#valid| v_prenex_332) (_ bv0 1))) (not (bvsle .cse194 .cse195)) (not (bvsle (_ bv0 32) v_prenex_333)) (not (bvsle .cse193 .cse194)) (not (bvsle .cse196 .cse195)) (not (bvsle v_prenex_333 .cse196))))) .cse1) (or (forall ((v_prenex_393 (_ BitVec 32)) (v_prenex_392 (_ BitVec 32)) (v_prenex_391 (_ BitVec 32)) (v_prenex_390 (_ BitVec 32)) (v_prenex_389 (_ BitVec 32)) (v_arrayElimCell_130 (_ BitVec 32))) (let ((.cse201 (bvadd v_prenex_392 (_ bv4 32))) (.cse202 (store |c_#length| v_prenex_391 v_prenex_390)) (.cse198 (bvadd v_prenex_393 v_prenex_392)) (.cse200 (select |c_#length| v_arrayElimCell_130)) (.cse197 (bvadd v_prenex_392 (_ bv8 32))) (.cse199 (bvadd v_prenex_392 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) .cse197)) (not (bvsle v_prenex_392 .cse198)) (not (bvsle .cse199 .cse200)) (not (= (select |c_#valid| v_prenex_391) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_392)) (= v_arrayElimCell_130 c_main_~x~0.base) (bvsle .cse201 (select .cse202 v_arrayElimCell_130)) (bvsle .cse201 (select .cse202 v_prenex_389)) (not (bvsle .cse198 .cse200)) (not (bvsle .cse197 .cse199))))) .cse1) (or .cse0 (forall ((v_prenex_282 (_ BitVec 32)) (v_prenex_281 (_ BitVec 32)) (v_prenex_280 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_279 (_ BitVec 32)) (v_prenex_278 (_ BitVec 32))) (let ((.cse203 (bvadd v_prenex_280 (_ bv8 32))) (.cse205 (bvadd v_prenex_280 (_ bv12 32))) (.cse206 (bvadd v_prenex_280 (_ bv4 32))) (.cse207 (store |c_#length| v_prenex_278 v_prenex_281)) (.cse204 (bvadd v_prenex_282 v_prenex_280)) (.cse208 (select |c_#length| v_prenex_8))) (or (not (bvsle (_ bv0 32) .cse203)) (not (bvsle v_prenex_280 .cse204)) (not (bvsle .cse203 .cse205)) (not (bvsle (_ bv0 32) v_prenex_280)) (bvsle .cse206 (select .cse207 v_prenex_8)) (not (= (select |c_#valid| v_prenex_278) (_ bv0 1))) (not (bvsle .cse205 .cse208)) (bvsle .cse206 (select .cse207 v_prenex_279)) (not (bvsle .cse204 .cse208))))) .cse1) (or .cse1 (forall ((v_prenex_73 (_ BitVec 32)) (v_prenex_74 (_ BitVec 32)) (v_prenex_75 (_ BitVec 32)) (v_prenex_76 (_ BitVec 32)) (v_prenex_72 (_ BitVec 32)) (v_arrayElimCell_198 (_ BitVec 32))) (let ((.cse212 (select |c_#length| v_arrayElimCell_198)) (.cse211 (bvadd v_prenex_72 v_prenex_75)) (.cse213 (bvadd v_prenex_75 (_ bv12 32))) (.cse214 (bvadd v_prenex_75 (_ bv8 32))) (.cse209 (bvadd v_prenex_75 (_ bv4 32))) (.cse210 (store |c_#length| v_prenex_73 v_prenex_76))) (or (bvsle .cse209 (select .cse210 v_arrayElimCell_198)) (not (bvsle .cse211 .cse212)) (not (bvsle .cse213 .cse212)) (not (bvsle (_ bv0 32) v_prenex_75)) (not (bvsle v_prenex_75 .cse211)) (not (= (select |c_#valid| v_prenex_73) (_ bv0 1))) (not (bvsle .cse214 .cse213)) (not (bvsle (_ bv0 32) .cse214)) (bvsle .cse209 (select .cse210 v_prenex_74)))))) (= (_ bv1 1) (select |c_#valid| |c_main_write~$Pointer$_#ptr.base|)) (or .cse0 (forall ((v_prenex_238 (_ BitVec 32)) (v_prenex_237 (_ BitVec 32)) (v_prenex_236 (_ BitVec 32)) (v_prenex_235 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse215 (bvadd v_prenex_236 (_ bv8 32))) (.cse216 (bvadd v_prenex_236 (_ bv12 32))) (.cse218 (select |c_#length| v_prenex_12)) (.cse217 (bvadd v_prenex_238 v_prenex_236))) (or (bvsle (bvadd v_prenex_236 (_ bv4 32)) (select (store |c_#length| v_prenex_235 v_prenex_237) v_prenex_12)) (not (bvsle (_ bv0 32) v_prenex_236)) (not (bvsle .cse215 .cse216)) (not (bvsle .cse217 .cse218)) (not (bvsle (_ bv0 32) .cse215)) (not (bvsle .cse216 .cse218)) (not (= (select |c_#valid| v_prenex_235) (_ bv0 1))) (not (bvsle v_prenex_236 .cse217))))) .cse1) (or .cse0 .cse1 (forall ((v_prenex_135 (_ BitVec 32)) (v_arrayElimCell_164 (_ BitVec 32)) (v_prenex_134 (_ BitVec 32)) (v_prenex_133 (_ BitVec 32)) (v_prenex_132 (_ BitVec 32))) (let ((.cse219 (bvadd v_prenex_134 (_ bv12 32))) (.cse222 (bvadd v_prenex_133 v_prenex_134)) (.cse220 (select |c_#length| v_arrayElimCell_164)) (.cse221 (bvadd v_prenex_134 (_ bv8 32)))) (or (not (bvsle .cse219 .cse220)) (= v_arrayElimCell_164 c_main_~x~0.base) (bvsle (bvadd v_prenex_134 (_ bv4 32)) (select (store |c_#length| v_prenex_132 v_prenex_135) v_arrayElimCell_164)) (not (bvsle (_ bv0 32) v_prenex_134)) (not (bvsle .cse221 .cse219)) (not (= (select |c_#valid| v_prenex_132) (_ bv0 1))) (not (bvsle v_prenex_134 .cse222)) (not (bvsle .cse222 .cse220)) (not (bvsle (_ bv0 32) .cse221)))))) (or .cse0 (forall ((v_arrayElimCell_224 (_ BitVec 32)) (v_prenex_260 (_ BitVec 32)) (v_prenex_259 (_ BitVec 32)) (v_prenex_258 (_ BitVec 32)) (v_prenex_257 (_ BitVec 32))) (let ((.cse226 (bvadd v_prenex_258 (_ bv12 32))) (.cse224 (select |c_#length| v_arrayElimCell_224)) (.cse223 (bvadd v_prenex_260 v_prenex_258)) (.cse225 (bvadd v_prenex_258 (_ bv8 32)))) (or (= v_arrayElimCell_224 c_main_~x~0.base) (not (bvsle .cse223 .cse224)) (not (bvsle .cse225 .cse226)) (bvsle (bvadd v_prenex_258 (_ bv4 32)) (select (store |c_#length| v_prenex_257 v_prenex_259) v_arrayElimCell_224)) (not (bvsle .cse226 .cse224)) (not (= (select |c_#valid| v_prenex_257) (_ bv0 1))) (not (bvsle v_prenex_258 .cse223)) (not (bvsle (_ bv0 32) v_prenex_258)) (not (bvsle (_ bv0 32) .cse225)))))) (or .cse80 .cse0 .cse1 (forall ((v_prenex_5 (_ BitVec 32)) (v_prenex_225 (_ BitVec 32)) (v_prenex_224 (_ BitVec 32)) (v_prenex_223 (_ BitVec 32)) (v_prenex_222 (_ BitVec 32)) (v_prenex_221 (_ BitVec 32))) (let ((.cse227 (bvadd v_prenex_223 (_ bv12 32))) (.cse232 (bvadd v_prenex_223 (_ bv8 32))) (.cse229 (bvadd v_prenex_225 v_prenex_223)) (.cse228 (select |c_#length| v_prenex_5)) (.cse230 (bvadd v_prenex_223 (_ bv4 32))) (.cse231 (store |c_#length| v_prenex_221 v_prenex_224))) (or (not (bvsle (_ bv0 32) v_prenex_223)) (not (bvsle .cse227 .cse228)) (not (bvsle v_prenex_223 .cse229)) (bvsle .cse230 (select .cse231 v_prenex_5)) (not (bvsle .cse232 .cse227)) (not (bvsle (_ bv0 32) .cse232)) (not (= (select |c_#valid| v_prenex_221) (_ bv0 1))) (not (bvsle .cse229 .cse228)) (bvsle .cse230 (select .cse231 v_prenex_222)) (= v_prenex_5 c_main_~x~0.base))))) (or .cse0 .cse1 (forall ((v_prenex_175 (_ BitVec 32)) (v_prenex_174 (_ BitVec 32)) (v_prenex_173 (_ BitVec 32)) (v_prenex_172 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 32)) (v_prenex_176 (_ BitVec 32))) (let ((.cse234 (select |c_#length| v_arrayElimCell_52)) (.cse233 (bvadd v_prenex_173 v_prenex_175)) (.cse236 (bvadd v_prenex_175 (_ bv4 32))) (.cse237 (store |c_#length| v_prenex_172 v_prenex_176)) (.cse238 (bvadd v_prenex_175 (_ bv8 32))) (.cse235 (bvadd v_prenex_175 (_ bv12 32)))) (or (not (bvsle .cse233 .cse234)) (not (bvsle .cse235 .cse234)) (not (= (select |c_#valid| v_prenex_172) (_ bv0 1))) (bvsle .cse236 (select .cse237 v_prenex_174)) (not (bvsle v_prenex_175 .cse233)) (not (bvsle (_ bv0 32) .cse238)) (bvsle .cse236 (select .cse237 v_arrayElimCell_52)) (not (bvsle (_ bv0 32) v_prenex_175)) (not (bvsle .cse238 .cse235)) (= v_arrayElimCell_52 c_main_~x~0.base))))) (or .cse0 .cse1 (forall ((v_prenex_395 (_ BitVec 32)) (v_prenex_394 (_ BitVec 32)) (v_arrayElimCell_99 (_ BitVec 32)) (v_prenex_398 (_ BitVec 32)) (v_prenex_397 (_ BitVec 32)) (v_prenex_396 (_ BitVec 32))) (let ((.cse241 (bvadd v_prenex_397 (_ bv12 32))) (.cse240 (bvadd v_prenex_397 (_ bv8 32))) (.cse239 (bvadd v_prenex_398 v_prenex_397)) (.cse242 (select |c_#length| v_arrayElimCell_99)) (.cse243 (bvadd v_prenex_397 (_ bv4 32))) (.cse244 (store |c_#length| v_prenex_396 v_prenex_395))) (or (not (= (select |c_#valid| v_prenex_396) (_ bv0 1))) (not (bvsle v_prenex_397 .cse239)) (= v_arrayElimCell_99 c_main_~x~0.base) (not (bvsle .cse240 .cse241)) (not (bvsle .cse241 .cse242)) (bvsle .cse243 (select .cse244 v_arrayElimCell_99)) (not (bvsle (_ bv0 32) v_prenex_397)) (not (bvsle (_ bv0 32) .cse240)) (not (bvsle .cse239 .cse242)) (bvsle .cse243 (select .cse244 v_prenex_394)))))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_prenex_329 (_ BitVec 32)) (v_prenex_328 (_ BitVec 32)) (v_prenex_327 (_ BitVec 32)) (v_prenex_331 (_ BitVec 32)) (v_prenex_330 (_ BitVec 32))) (let ((.cse245 (bvadd v_prenex_329 (_ bv8 32))) (.cse246 (bvadd v_prenex_329 (_ bv12 32))) (.cse248 (bvadd v_prenex_329 (_ bv4 32))) (.cse249 (store |c_#length| v_prenex_327 v_prenex_330)) (.cse250 (bvadd v_prenex_331 v_prenex_329)) (.cse247 (select |c_#length| v_arrayElimCell_38))) (or (not (bvsle .cse245 .cse246)) (not (bvsle (_ bv0 32) .cse245)) (not (bvsle .cse246 .cse247)) (bvsle .cse248 (select .cse249 v_prenex_328)) (not (bvsle (_ bv0 32) v_prenex_329)) (bvsle .cse248 (select .cse249 v_arrayElimCell_38)) (not (bvsle v_prenex_329 .cse250)) (not (= (select |c_#valid| v_prenex_327) (_ bv0 1))) (not (bvsle .cse250 .cse247))))) .cse0 .cse1) (or .cse1 (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_prenex_148 (_ BitVec 32)) (v_prenex_147 (_ BitVec 32)) (v_prenex_146 (_ BitVec 32)) (v_prenex_145 (_ BitVec 32))) (let ((.cse251 (bvadd v_prenex_147 (_ bv12 32))) (.cse253 (bvadd v_prenex_146 v_prenex_147)) (.cse252 (select |c_#length| v_arrayElimCell_139)) (.cse254 (bvadd v_prenex_147 (_ bv8 32)))) (or (not (bvsle .cse251 .cse252)) (not (= (select |c_#valid| v_prenex_145) (_ bv0 1))) (not (bvsle v_prenex_147 .cse253)) (= v_arrayElimCell_139 c_main_~x~0.base) (not (bvsle .cse254 .cse251)) (not (bvsle (_ bv0 32) v_prenex_147)) (not (bvsle .cse253 .cse252)) (bvsle (bvadd v_prenex_147 (_ bv4 32)) (select (store |c_#length| v_prenex_145 v_prenex_148) v_arrayElimCell_139)) (not (bvsle (_ bv0 32) .cse254)))))) (or .cse0 .cse1 (forall ((v_prenex_185 (_ BitVec 32)) (v_prenex_184 (_ BitVec 32)) (v_prenex_183 (_ BitVec 32)) (v_prenex_182 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse256 (bvadd v_prenex_184 (_ bv8 32))) (.cse255 (bvadd v_prenex_183 v_prenex_184)) (.cse257 (bvadd v_prenex_184 (_ bv12 32))) (.cse258 (select |c_#length| v_arrayElimCell_74))) (or (not (bvsle v_prenex_184 .cse255)) (not (bvsle .cse256 .cse257)) (not (bvsle (_ bv0 32) .cse256)) (not (bvsle .cse255 .cse258)) (not (bvsle (_ bv0 32) v_prenex_184)) (= v_arrayElimCell_74 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_182) (_ bv0 1))) (not (bvsle .cse257 .cse258)) (bvsle (bvadd v_prenex_184 (_ bv4 32)) (select (store |c_#length| v_prenex_182 v_prenex_185) v_arrayElimCell_74)))))) (or (forall ((v_arrayElimCell_145 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (|main_write~$Pointer$_#sizeOfWrittenType| (_ BitVec 32)) (|v_main_#Ultimate.alloc_~size_4| (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (|v_main_write~$Pointer$_#ptr.offset_35| (_ BitVec 32))) (let ((.cse261 (bvadd |main_write~$Pointer$_#sizeOfWrittenType| |v_main_write~$Pointer$_#ptr.offset_35|)) (.cse259 (bvadd |v_main_write~$Pointer$_#ptr.offset_35| (_ bv4 32))) (.cse260 (store |c_#length| v_prenex_2 |v_main_#Ultimate.alloc_~size_4|)) (.cse263 (bvadd |v_main_write~$Pointer$_#ptr.offset_35| (_ bv8 32))) (.cse264 (bvadd |v_main_write~$Pointer$_#ptr.offset_35| (_ bv12 32))) (.cse262 (select |c_#length| v_arrayElimCell_145))) (or (bvsle .cse259 (select .cse260 v_arrayElimCell_145)) (not (= (select |c_#valid| v_prenex_2) (_ bv0 1))) (not (bvsle .cse261 .cse262)) (not (bvsle (_ bv0 32) .cse263)) (not (bvsle |v_main_write~$Pointer$_#ptr.offset_35| .cse261)) (bvsle .cse259 (select .cse260 v_subst_2)) (= v_arrayElimCell_145 c_main_~x~0.base) (not (bvsle .cse263 .cse264)) (not (bvsle .cse264 .cse262)) (not (bvsle (_ bv0 32) |v_main_write~$Pointer$_#ptr.offset_35|))))) .cse1) (or .cse0 .cse8 (forall ((v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_215 (_ BitVec 32)) (v_prenex_214 (_ BitVec 32)) (v_prenex_213 (_ BitVec 32)) (v_prenex_212 (_ BitVec 32)) (v_prenex_211 (_ BitVec 32))) (let ((.cse265 (bvadd v_prenex_213 (_ bv12 32))) (.cse269 (bvadd v_prenex_213 (_ bv8 32))) (.cse267 (bvadd v_prenex_213 (_ bv4 32))) (.cse268 (store |c_#length| v_prenex_211 v_prenex_214)) (.cse266 (select |c_#length| v_arrayElimCell_114)) (.cse270 (bvadd v_prenex_215 v_prenex_213))) (or (not (bvsle .cse265 .cse266)) (= v_arrayElimCell_114 c_main_~x~0.base) (bvsle .cse267 (select .cse268 v_prenex_212)) (not (bvsle .cse269 .cse265)) (not (bvsle (_ bv0 32) .cse269)) (bvsle .cse267 (select .cse268 v_arrayElimCell_114)) (not (= (select |c_#valid| v_prenex_211) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_213)) (not (bvsle .cse270 .cse266)) (not (bvsle v_prenex_213 .cse270)))))) (or .cse0 .cse1 (forall ((v_prenex_131 (_ BitVec 32)) (v_prenex_130 (_ BitVec 32)) (v_prenex_129 (_ BitVec 32)) (v_prenex_128 (_ BitVec 32)) (v_prenex_127 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse272 (bvadd v_prenex_130 (_ bv12 32))) (.cse276 (select |c_#length| v_arrayElimCell_122)) (.cse271 (bvadd v_prenex_130 (_ bv8 32))) (.cse273 (bvadd v_prenex_130 (_ bv4 32))) (.cse274 (store |c_#length| v_prenex_127 v_prenex_131)) (.cse275 (bvadd v_prenex_128 v_prenex_130))) (or (not (bvsle .cse271 .cse272)) (bvsle .cse273 (select .cse274 v_prenex_129)) (= v_arrayElimCell_122 c_main_~x~0.base) (not (bvsle .cse275 .cse276)) (not (bvsle .cse272 .cse276)) (not (bvsle (_ bv0 32) .cse271)) (not (bvsle (_ bv0 32) v_prenex_130)) (bvsle .cse273 (select .cse274 v_arrayElimCell_122)) (not (= (select |c_#valid| v_prenex_127) (_ bv0 1))) (not (bvsle v_prenex_130 .cse275)))))) (or .cse80 .cse1 (forall ((v_prenex_31 (_ BitVec 32)) (v_prenex_304 (_ BitVec 32)) (v_prenex_303 (_ BitVec 32)) (v_prenex_302 (_ BitVec 32)) (v_prenex_301 (_ BitVec 32))) (let ((.cse277 (bvadd v_prenex_302 (_ bv8 32))) (.cse279 (bvadd v_prenex_302 (_ bv12 32))) (.cse278 (bvadd v_prenex_304 v_prenex_302)) (.cse280 (select |c_#length| v_prenex_31))) (or (not (bvsle (_ bv0 32) .cse277)) (not (bvsle v_prenex_302 .cse278)) (= v_prenex_31 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_302)) (not (bvsle .cse279 .cse280)) (not (bvsle .cse277 .cse279)) (not (= (select |c_#valid| v_prenex_301) (_ bv0 1))) (bvsle (bvadd v_prenex_302 (_ bv4 32)) (select (store |c_#length| v_prenex_301 v_prenex_303) v_prenex_31)) (not (bvsle .cse278 .cse280)))))) (or (forall ((v_prenex_384 (_ BitVec 32)) (v_prenex_383 (_ BitVec 32)) (v_prenex_382 (_ BitVec 32)) (v_prenex_381 (_ BitVec 32)) (v_prenex_380 (_ BitVec 32))) (let ((.cse281 (bvadd v_prenex_384 v_prenex_383)) (.cse284 (bvadd v_prenex_383 (_ bv12 32))) (.cse282 (select |c_#length| v_prenex_380)) (.cse283 (bvadd v_prenex_383 (_ bv8 32)))) (or (not (bvsle .cse281 .cse282)) (not (bvsle v_prenex_383 .cse281)) (not (bvsle .cse283 .cse284)) (not (bvsle .cse284 .cse282)) (not (bvsle (_ bv0 32) v_prenex_383)) (not (bvsle (_ bv0 32) .cse283)) (not (= (select |c_#valid| v_prenex_382) (_ bv0 1))) (bvsle (bvadd v_prenex_383 (_ bv4 32)) (select (store |c_#length| v_prenex_382 v_prenex_381) v_prenex_380))))) .cse285) (or .cse1 (forall ((v_prenex_40 (_ BitVec 32)) (v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32)) (v_arrayElimCell_150 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse288 (bvadd v_prenex_44 (_ bv4 32))) (.cse289 (store |c_#length| v_prenex_41 v_prenex_43)) (.cse291 (bvadd v_prenex_44 (_ bv8 32))) (.cse286 (bvadd v_prenex_44 (_ bv12 32))) (.cse290 (bvadd v_prenex_40 v_prenex_44)) (.cse287 (select |c_#length| v_arrayElimCell_150))) (or (not (bvsle .cse286 .cse287)) (bvsle .cse288 (select .cse289 v_prenex_42)) (not (= (select |c_#valid| v_prenex_41) (_ bv0 1))) (not (bvsle v_prenex_44 .cse290)) (= v_arrayElimCell_150 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse291)) (bvsle .cse288 (select .cse289 v_arrayElimCell_150)) (not (bvsle .cse291 .cse286)) (not (bvsle .cse290 .cse287)) (not (bvsle (_ bv0 32) v_prenex_44)))))) (or (forall ((v_prenex_164 (_ BitVec 32)) (v_prenex_163 (_ BitVec 32)) (v_prenex_162 (_ BitVec 32)) (v_arrayElimCell_136 (_ BitVec 32)) (v_prenex_166 (_ BitVec 32)) (v_prenex_165 (_ BitVec 32))) (let ((.cse292 (bvadd v_prenex_163 v_prenex_165)) (.cse293 (bvadd v_prenex_165 (_ bv8 32))) (.cse296 (bvadd v_prenex_165 (_ bv4 32))) (.cse297 (store |c_#length| v_prenex_162 v_prenex_166)) (.cse294 (bvadd v_prenex_165 (_ bv12 32))) (.cse295 (select |c_#length| v_arrayElimCell_136))) (or (not (bvsle v_prenex_165 .cse292)) (= v_arrayElimCell_136 c_main_~x~0.base) (not (bvsle .cse293 .cse294)) (not (bvsle .cse292 .cse295)) (bvsle .cse296 (select .cse297 v_prenex_164)) (not (bvsle (_ bv0 32) .cse293)) (bvsle .cse296 (select .cse297 v_arrayElimCell_136)) (not (bvsle .cse294 .cse295)) (not (= (select |c_#valid| v_prenex_162) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_165))))) .cse1) (or .cse0 (forall ((v_prenex_161 (_ BitVec 32)) (v_prenex_160 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32)) (v_prenex_159 (_ BitVec 32)) (v_prenex_158 (_ BitVec 32))) (let ((.cse300 (bvadd v_prenex_159 v_prenex_160)) (.cse298 (bvadd v_prenex_160 (_ bv8 32))) (.cse299 (bvadd v_prenex_160 (_ bv12 32))) (.cse301 (select |c_#length| v_arrayElimCell_118))) (or (not (= (select |c_#valid| v_prenex_158) (_ bv0 1))) (not (bvsle .cse298 .cse299)) (not (bvsle v_prenex_160 .cse300)) (not (bvsle .cse300 .cse301)) (not (bvsle (_ bv0 32) .cse298)) (not (bvsle .cse299 .cse301)) (bvsle (bvadd v_prenex_160 (_ bv4 32)) (select (store |c_#length| v_prenex_158 v_prenex_161) v_arrayElimCell_118)) (not (bvsle (_ bv0 32) v_prenex_160)))))) (or .cse0 (forall ((v_prenex_362 (_ BitVec 32)) (v_prenex_366 (_ BitVec 32)) (v_prenex_365 (_ BitVec 32)) (v_prenex_364 (_ BitVec 32)) (v_arrayElimCell_121 (_ BitVec 32)) (v_prenex_363 (_ BitVec 32))) (let ((.cse302 (bvadd v_prenex_365 (_ bv4 32))) (.cse303 (store |c_#length| v_prenex_364 v_prenex_363)) (.cse305 (select |c_#length| v_arrayElimCell_121)) (.cse306 (bvadd v_prenex_366 v_prenex_365)) (.cse304 (bvadd v_prenex_365 (_ bv12 32))) (.cse307 (bvadd v_prenex_365 (_ bv8 32)))) (or (= v_arrayElimCell_121 c_main_~x~0.base) (bvsle .cse302 (select .cse303 v_prenex_362)) (not (bvsle (_ bv0 32) v_prenex_365)) (bvsle .cse302 (select .cse303 v_arrayElimCell_121)) (not (= (select |c_#valid| v_prenex_364) (_ bv0 1))) (not (bvsle .cse304 .cse305)) (not (bvsle .cse306 .cse305)) (not (bvsle v_prenex_365 .cse306)) (not (bvsle .cse307 .cse304)) (not (bvsle (_ bv0 32) .cse307)))))) (or (forall ((v_prenex_206 (_ BitVec 32)) (v_prenex_205 (_ BitVec 32)) (v_prenex_204 (_ BitVec 32)) (v_prenex_203 (_ BitVec 32)) (v_arrayElimCell_142 (_ BitVec 32))) (let ((.cse310 (bvadd v_prenex_206 v_prenex_204)) (.cse308 (bvadd v_prenex_204 (_ bv8 32))) (.cse309 (bvadd v_prenex_204 (_ bv12 32))) (.cse311 (select |c_#length| v_arrayElimCell_142))) (or (not (bvsle .cse308 .cse309)) (not (bvsle v_prenex_204 .cse310)) (not (bvsle (_ bv0 32) v_prenex_204)) (not (bvsle .cse310 .cse311)) (not (bvsle (_ bv0 32) .cse308)) (not (= (select |c_#valid| v_prenex_203) (_ bv0 1))) (not (bvsle .cse309 .cse311)) (bvsle (bvadd v_prenex_204 (_ bv4 32)) (select (store |c_#length| v_prenex_203 v_prenex_205) v_arrayElimCell_142))))) .cse1) (or .cse80 .cse1 (forall ((v_prenex_118 (_ BitVec 32)) (v_prenex_117 (_ BitVec 32)) (v_prenex_116 (_ BitVec 32)) (v_prenex_115 (_ BitVec 32)) (v_prenex_114 (_ BitVec 32)) (v_prenex_25 (_ BitVec 32))) (let ((.cse312 (bvadd v_prenex_117 (_ bv8 32))) (.cse313 (bvadd v_prenex_117 (_ bv12 32))) (.cse316 (bvadd v_prenex_115 v_prenex_117)) (.cse317 (select |c_#length| v_prenex_25)) (.cse314 (bvadd v_prenex_117 (_ bv4 32))) (.cse315 (store |c_#length| v_prenex_114 v_prenex_118))) (or (not (bvsle (_ bv0 32) v_prenex_117)) (not (bvsle (_ bv0 32) .cse312)) (= v_prenex_25 c_main_~x~0.base) (not (bvsle .cse312 .cse313)) (bvsle .cse314 (select .cse315 v_prenex_116)) (not (bvsle v_prenex_117 .cse316)) (not (= (select |c_#valid| v_prenex_114) (_ bv0 1))) (not (bvsle .cse313 .cse317)) (not (bvsle .cse316 .cse317)) (bvsle .cse314 (select .cse315 v_prenex_25)))))) (or .cse1 (forall ((v_prenex_32 (_ BitVec 32)) (v_prenex_181 (_ BitVec 32)) (v_prenex_180 (_ BitVec 32)) (v_prenex_179 (_ BitVec 32)) (v_prenex_178 (_ BitVec 32)) (v_prenex_177 (_ BitVec 32))) (let ((.cse320 (select |c_#length| v_prenex_32)) (.cse318 (bvadd v_prenex_180 (_ bv8 32))) (.cse323 (bvadd v_prenex_180 (_ bv12 32))) (.cse319 (bvadd v_prenex_178 v_prenex_180)) (.cse321 (bvadd v_prenex_180 (_ bv4 32))) (.cse322 (store |c_#length| v_prenex_177 v_prenex_181))) (or (not (bvsle (_ bv0 32) .cse318)) (not (bvsle (_ bv0 32) v_prenex_180)) (not (bvsle .cse319 .cse320)) (bvsle .cse321 (select .cse322 v_prenex_179)) (not (bvsle .cse323 .cse320)) (not (= (select |c_#valid| v_prenex_177) (_ bv0 1))) (not (bvsle .cse318 .cse323)) (= v_prenex_32 c_main_~x~0.base) (not (bvsle v_prenex_180 .cse319)) (bvsle .cse321 (select .cse322 v_prenex_32)))))) (or .cse80 .cse0 (forall ((v_prenex_241 (_ BitVec 32)) (v_prenex_240 (_ BitVec 32)) (v_prenex_239 (_ BitVec 32)) (v_arrayElimCell_96 (_ BitVec 32)) (v_prenex_242 (_ BitVec 32))) (let ((.cse324 (bvadd v_prenex_242 v_prenex_240)) (.cse327 (bvadd v_prenex_240 (_ bv12 32))) (.cse325 (select |c_#length| v_arrayElimCell_96)) (.cse326 (bvadd v_prenex_240 (_ bv8 32)))) (or (not (bvsle .cse324 .cse325)) (not (bvsle (_ bv0 32) v_prenex_240)) (= v_arrayElimCell_96 c_main_~x~0.base) (not (bvsle v_prenex_240 .cse324)) (not (bvsle .cse326 .cse327)) (not (bvsle .cse327 .cse325)) (bvsle (bvadd v_prenex_240 (_ bv4 32)) (select (store |c_#length| v_prenex_239 v_prenex_241) v_arrayElimCell_96)) (not (bvsle (_ bv0 32) .cse326)) (not (= (select |c_#valid| v_prenex_239) (_ bv0 1)))))) .cse1) (or .cse1 (forall ((v_prenex_230 (_ BitVec 32)) (v_prenex_229 (_ BitVec 32)) (v_prenex_228 (_ BitVec 32)) (v_prenex_227 (_ BitVec 32)) (v_prenex_226 (_ BitVec 32)) (v_prenex_35 (_ BitVec 32))) (let ((.cse332 (bvadd v_prenex_230 v_prenex_228)) (.cse330 (bvadd v_prenex_228 (_ bv8 32))) (.cse328 (bvadd v_prenex_228 (_ bv4 32))) (.cse329 (store |c_#length| v_prenex_226 v_prenex_229)) (.cse331 (bvadd v_prenex_228 (_ bv12 32))) (.cse333 (select |c_#length| v_prenex_35))) (or (bvsle .cse328 (select .cse329 v_prenex_227)) (not (bvsle (_ bv0 32) v_prenex_228)) (not (= (select |c_#valid| v_prenex_226) (_ bv0 1))) (not (bvsle .cse330 .cse331)) (= v_prenex_35 c_main_~x~0.base) (not (bvsle .cse332 .cse333)) (not (bvsle v_prenex_228 .cse332)) (not (bvsle (_ bv0 32) .cse330)) (bvsle .cse328 (select .cse329 v_prenex_35)) (not (bvsle .cse331 .cse333)))))) (or .cse0 .cse1 (forall ((v_arrayElimCell_211 (_ BitVec 32)) (v_prenex_351 (_ BitVec 32)) (v_prenex_350 (_ BitVec 32)) (v_prenex_349 (_ BitVec 32)) (v_prenex_352 (_ BitVec 32))) (let ((.cse334 (bvadd v_prenex_351 (_ bv8 32))) (.cse335 (bvadd v_prenex_351 (_ bv12 32))) (.cse337 (bvadd v_prenex_352 v_prenex_351)) (.cse336 (select |c_#length| v_arrayElimCell_211))) (or (not (bvsle (_ bv0 32) .cse334)) (bvsle (bvadd v_prenex_351 (_ bv4 32)) (select (store |c_#length| v_prenex_350 v_prenex_349) v_arrayElimCell_211)) (not (bvsle .cse334 .cse335)) (not (bvsle .cse335 .cse336)) (not (bvsle v_prenex_351 .cse337)) (not (bvsle .cse337 .cse336)) (not (= (select |c_#valid| v_prenex_350) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_351)))))) (or .cse0 (forall ((v_prenex_388 (_ BitVec 32)) (v_prenex_387 (_ BitVec 32)) (v_prenex_386 (_ BitVec 32)) (v_arrayElimCell_220 (_ BitVec 32)) (v_prenex_385 (_ BitVec 32))) (let ((.cse338 (bvadd v_prenex_387 (_ bv8 32))) (.cse341 (bvadd v_prenex_387 (_ bv12 32))) (.cse340 (select |c_#length| v_arrayElimCell_220)) (.cse339 (bvadd v_prenex_388 v_prenex_387))) (or (not (bvsle (_ bv0 32) .cse338)) (not (bvsle (_ bv0 32) v_prenex_387)) (bvsle (bvadd v_prenex_387 (_ bv4 32)) (select (store |c_#length| v_prenex_386 v_prenex_385) v_arrayElimCell_220)) (not (bvsle .cse339 .cse340)) (not (bvsle .cse338 .cse341)) (not (bvsle .cse341 .cse340)) (not (bvsle v_prenex_387 .cse339)) (not (= (select |c_#valid| v_prenex_386) (_ bv0 1))))))) (or .cse1 (forall ((v_prenex_252 (_ BitVec 32)) (v_prenex_251 (_ BitVec 32)) (v_prenex_250 (_ BitVec 32)) (v_prenex_249 (_ BitVec 32)) (v_prenex_248 (_ BitVec 32)) (v_prenex_34 (_ BitVec 32))) (let ((.cse344 (bvadd v_prenex_250 (_ bv4 32))) (.cse345 (store |c_#length| v_prenex_248 v_prenex_251)) (.cse346 (bvadd v_prenex_250 (_ bv8 32))) (.cse347 (bvadd v_prenex_250 (_ bv12 32))) (.cse343 (select |c_#length| v_prenex_34)) (.cse342 (bvadd v_prenex_252 v_prenex_250))) (or (not (bvsle .cse342 .cse343)) (bvsle .cse344 (select .cse345 v_prenex_34)) (= v_prenex_34 c_main_~x~0.base) (bvsle .cse344 (select .cse345 v_prenex_249)) (not (bvsle .cse346 .cse347)) (not (bvsle (_ bv0 32) .cse346)) (not (bvsle (_ bv0 32) v_prenex_250)) (not (bvsle .cse347 .cse343)) (not (bvsle v_prenex_250 .cse342)) (not (= (select |c_#valid| v_prenex_248) (_ bv0 1))))))) (or (forall ((v_prenex_285 (_ BitVec 32)) (v_prenex_284 (_ BitVec 32)) (v_prenex_283 (_ BitVec 32)) (v_arrayElimCell_63 (_ BitVec 32)) (v_prenex_286 (_ BitVec 32))) (let ((.cse350 (select |c_#length| v_arrayElimCell_63)) (.cse348 (bvadd v_prenex_284 (_ bv8 32))) (.cse351 (bvadd v_prenex_284 (_ bv12 32))) (.cse349 (bvadd v_prenex_286 v_prenex_284))) (or (not (bvsle (_ bv0 32) .cse348)) (not (bvsle (_ bv0 32) v_prenex_284)) (not (bvsle .cse349 .cse350)) (not (bvsle .cse351 .cse350)) (= v_arrayElimCell_63 c_main_~x~0.base) (not (bvsle .cse348 .cse351)) (bvsle (bvadd v_prenex_284 (_ bv4 32)) (select (store |c_#length| v_prenex_283 v_prenex_285) v_arrayElimCell_63)) (not (bvsle v_prenex_284 .cse349)) (not (= (select |c_#valid| v_prenex_283) (_ bv0 1)))))) .cse0 .cse1) (or .cse80 .cse0 .cse1 (forall ((v_prenex_95 (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (v_prenex_93 (_ BitVec 32)) (v_prenex_94 (_ BitVec 32)) (v_arrayElimCell_29 (_ BitVec 32))) (let ((.cse352 (bvadd v_prenex_94 (_ bv4 32))) (.cse353 (store |c_#length| v_prenex_92 v_prenex_95)) (.cse354 (bvadd v_prenex_91 v_prenex_94)) (.cse355 (bvadd v_prenex_94 (_ bv8 32))) (.cse357 (bvadd v_prenex_94 (_ bv12 32))) (.cse356 (select |c_#length| v_arrayElimCell_29))) (or (bvsle .cse352 (select .cse353 v_arrayElimCell_29)) (not (bvsle v_prenex_94 .cse354)) (not (bvsle (_ bv0 32) .cse355)) (bvsle .cse352 (select .cse353 v_prenex_93)) (not (bvsle .cse354 .cse356)) (not (bvsle (_ bv0 32) v_prenex_94)) (not (= (select |c_#valid| v_prenex_92) (_ bv0 1))) (not (bvsle .cse355 .cse357)) (not (bvsle .cse357 .cse356)))))) (or .cse80 .cse0 .cse1 (forall ((v_prenex_406 (_ BitVec 32)) (v_prenex_405 (_ BitVec 32)) (v_prenex_404 (_ BitVec 32)) (v_prenex_403 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse358 (bvadd v_prenex_406 v_prenex_405)) (.cse361 (bvadd v_prenex_405 (_ bv12 32))) (.cse359 (select |c_#length| v_prenex_14)) (.cse360 (bvadd v_prenex_405 (_ bv8 32)))) (or (not (bvsle (_ bv0 32) v_prenex_405)) (not (bvsle .cse358 .cse359)) (not (= (select |c_#valid| v_prenex_404) (_ bv0 1))) (bvsle (bvadd v_prenex_405 (_ bv4 32)) (select (store |c_#length| v_prenex_404 v_prenex_403) v_prenex_14)) (= v_prenex_14 c_main_~x~0.base) (not (bvsle .cse360 .cse361)) (not (bvsle v_prenex_405 .cse358)) (not (bvsle .cse361 .cse359)) (not (bvsle (_ bv0 32) .cse360)))))) .cse285 (or .cse0 (forall ((v_prenex_62 (_ BitVec 32)) (v_prenex_60 (_ BitVec 32)) (v_prenex_61 (_ BitVec 32)) (v_prenex_59 (_ BitVec 32)) (v_prenex_58 (_ BitVec 32))) (let ((.cse363 (select |c_#length| v_prenex_61)) (.cse362 (bvadd v_prenex_58 v_prenex_62)) (.cse364 (bvadd v_prenex_62 (_ bv12 32))) (.cse365 (bvadd v_prenex_62 (_ bv8 32)))) (or (not (= (select |c_#valid| v_prenex_60) (_ bv0 1))) (not (bvsle .cse362 .cse363)) (not (bvsle (_ bv0 32) v_prenex_62)) (not (bvsle .cse364 .cse363)) (not (bvsle v_prenex_62 .cse362)) (not (bvsle .cse365 .cse364)) (bvsle (bvadd v_prenex_62 (_ bv4 32)) (select (store |c_#length| v_prenex_60 v_prenex_59) v_prenex_61)) (not (bvsle (_ bv0 32) .cse365)))))) (or .cse80 .cse0 .cse1 (forall ((v_prenex_139 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_138 (_ BitVec 32)) (v_prenex_137 (_ BitVec 32)) (v_prenex_136 (_ BitVec 32))) (let ((.cse366 (bvadd v_prenex_137 v_prenex_138)) (.cse367 (select |c_#length| v_prenex_6)) (.cse369 (bvadd v_prenex_138 (_ bv8 32))) (.cse368 (bvadd v_prenex_138 (_ bv12 32)))) (or (bvsle (bvadd v_prenex_138 (_ bv4 32)) (select (store |c_#length| v_prenex_136 v_prenex_139) v_prenex_6)) (not (bvsle .cse366 .cse367)) (not (bvsle v_prenex_138 .cse366)) (not (bvsle .cse368 .cse367)) (not (bvsle (_ bv0 32) .cse369)) (= v_prenex_6 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_138)) (not (= (select |c_#valid| v_prenex_136) (_ bv0 1))) (not (bvsle .cse369 .cse368)))))) (or (forall ((v_prenex_171 (_ BitVec 32)) (v_prenex_170 (_ BitVec 32)) (v_prenex_169 (_ BitVec 32)) (v_arrayElimCell_173 (_ BitVec 32)) (v_prenex_168 (_ BitVec 32)) (v_prenex_167 (_ BitVec 32))) (let ((.cse373 (bvadd v_prenex_170 (_ bv8 32))) (.cse370 (bvadd v_prenex_170 (_ bv4 32))) (.cse371 (store |c_#length| v_prenex_167 v_prenex_171)) (.cse372 (bvadd v_prenex_168 v_prenex_170)) (.cse374 (bvadd v_prenex_170 (_ bv12 32))) (.cse375 (select |c_#length| v_arrayElimCell_173))) (or (bvsle .cse370 (select .cse371 v_prenex_169)) (not (bvsle v_prenex_170 .cse372)) (not (bvsle (_ bv0 32) v_prenex_170)) (not (bvsle .cse373 .cse374)) (not (bvsle (_ bv0 32) .cse373)) (bvsle .cse370 (select .cse371 v_arrayElimCell_173)) (not (bvsle .cse372 .cse375)) (not (= (select |c_#valid| v_prenex_167) (_ bv0 1))) (= v_arrayElimCell_173 c_main_~x~0.base) (not (bvsle .cse374 .cse375))))) .cse0 .cse1) (or .cse0 .cse1 (forall ((v_prenex_197 (_ BitVec 32)) (v_prenex_196 (_ BitVec 32)) (v_prenex_195 (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (v_prenex_198 (_ BitVec 32))) (let ((.cse376 (bvadd v_prenex_196 (_ bv8 32))) (.cse377 (bvadd v_prenex_196 (_ bv12 32))) (.cse379 (bvadd v_prenex_198 v_prenex_196)) (.cse378 (select |c_#length| v_prenex_10))) (or (not (bvsle (_ bv0 32) .cse376)) (not (bvsle (_ bv0 32) v_prenex_196)) (not (bvsle .cse377 .cse378)) (bvsle (bvadd v_prenex_196 (_ bv4 32)) (select (store |c_#length| v_prenex_195 v_prenex_197) v_prenex_10)) (not (= (select |c_#valid| v_prenex_195) (_ bv0 1))) (not (bvsle v_prenex_196 .cse379)) (= v_prenex_10 c_main_~x~0.base) (not (bvsle .cse376 .cse377)) (not (bvsle .cse379 .cse378)))))) (or .cse0 (forall ((v_prenex_96 (_ BitVec 32)) (v_prenex_97 (_ BitVec 32)) (v_prenex_98 (_ BitVec 32)) (v_arrayElimCell_216 (_ BitVec 32)) (v_prenex_99 (_ BitVec 32))) (let ((.cse382 (bvadd v_prenex_98 (_ bv8 32))) (.cse383 (bvadd v_prenex_98 (_ bv12 32))) (.cse381 (select |c_#length| v_arrayElimCell_216)) (.cse380 (bvadd v_prenex_96 v_prenex_98))) (or (not (= (select |c_#valid| v_prenex_97) (_ bv0 1))) (bvsle (bvadd v_prenex_98 (_ bv4 32)) (select (store |c_#length| v_prenex_97 v_prenex_99) v_arrayElimCell_216)) (not (bvsle (_ bv0 32) v_prenex_98)) (not (bvsle .cse380 .cse381)) (not (bvsle (_ bv0 32) .cse382)) (= v_arrayElimCell_216 c_main_~x~0.base) (not (bvsle .cse382 .cse383)) (not (bvsle .cse383 .cse381)) (not (bvsle v_prenex_98 .cse380))))) .cse1) (or .cse0 (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_prenex_416 (_ BitVec 32)) (v_prenex_415 (_ BitVec 32)) (v_prenex_414 (_ BitVec 32)) (v_prenex_413 (_ BitVec 32)) (v_prenex_412 (_ BitVec 32))) (let ((.cse386 (bvadd v_prenex_415 (_ bv8 32))) (.cse388 (bvadd v_prenex_416 v_prenex_415)) (.cse384 (bvadd v_prenex_415 (_ bv4 32))) (.cse385 (store |c_#length| v_prenex_414 v_prenex_413)) (.cse387 (bvadd v_prenex_415 (_ bv12 32))) (.cse389 (select |c_#length| v_arrayElimCell_69))) (or (bvsle .cse384 (select .cse385 v_prenex_412)) (not (bvsle (_ bv0 32) .cse386)) (not (bvsle (_ bv0 32) v_prenex_415)) (not (bvsle .cse386 .cse387)) (not (bvsle .cse388 .cse389)) (not (bvsle v_prenex_415 .cse388)) (not (= (select |c_#valid| v_prenex_414) (_ bv0 1))) (bvsle .cse384 (select .cse385 v_arrayElimCell_69)) (not (bvsle .cse387 .cse389))))) .cse1) (= (bvadd (select |c_#length| |c_main_write~$Pointer$_#value.base|) (_ bv4294967284 32)) (_ bv0 32)) (or .cse80 .cse0 .cse1 (forall ((v_prenex_9 (_ BitVec 32)) (v_prenex_247 (_ BitVec 32)) (v_prenex_246 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32)) (v_prenex_244 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (let ((.cse390 (bvadd v_prenex_247 v_prenex_245)) (.cse392 (select |c_#length| v_prenex_9)) (.cse393 (bvadd v_prenex_245 (_ bv8 32))) (.cse391 (bvadd v_prenex_245 (_ bv12 32))) (.cse394 (bvadd v_prenex_245 (_ bv4 32))) (.cse395 (store |c_#length| v_prenex_243 v_prenex_246))) (or (not (bvsle v_prenex_245 .cse390)) (not (bvsle .cse391 .cse392)) (not (= (select |c_#valid| v_prenex_243) (_ bv0 1))) (not (bvsle .cse390 .cse392)) (not (bvsle (_ bv0 32) .cse393)) (not (bvsle .cse393 .cse391)) (not (bvsle (_ bv0 32) v_prenex_245)) (bvsle .cse394 (select .cse395 v_prenex_9)) (= v_prenex_9 c_main_~x~0.base) (bvsle .cse394 (select .cse395 v_prenex_244)))))) (or .cse1 (forall ((v_prenex_379 (_ BitVec 32)) (v_prenex_378 (_ BitVec 32)) (v_prenex_377 (_ BitVec 32)) (v_prenex_376 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse397 (bvadd v_prenex_379 v_prenex_378)) (.cse396 (bvadd v_prenex_378 (_ bv8 32))) (.cse399 (bvadd v_prenex_378 (_ bv12 32))) (.cse398 (select |c_#length| v_arrayElimCell_187))) (or (bvsle (bvadd v_prenex_378 (_ bv4 32)) (select (store |c_#length| v_prenex_377 v_prenex_376) v_arrayElimCell_187)) (not (bvsle (_ bv0 32) .cse396)) (not (bvsle v_prenex_378 .cse397)) (not (bvsle .cse397 .cse398)) (= v_arrayElimCell_187 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_377) (_ bv0 1))) (not (bvsle .cse396 .cse399)) (not (bvsle .cse399 .cse398)) (not (bvsle (_ bv0 32) v_prenex_378)))))) .cse1 (or .cse80 .cse0 (forall ((v_prenex_120 (_ BitVec 32)) (v_arrayElimCell_126 (_ BitVec 32)) (v_prenex_119 (_ BitVec 32)) (v_prenex_122 (_ BitVec 32)) (v_prenex_121 (_ BitVec 32))) (let ((.cse402 (bvadd v_prenex_120 v_prenex_121)) (.cse401 (select |c_#length| v_arrayElimCell_126)) (.cse403 (bvadd v_prenex_121 (_ bv8 32))) (.cse400 (bvadd v_prenex_121 (_ bv12 32)))) (or (bvsle (bvadd v_prenex_121 (_ bv4 32)) (select (store |c_#length| v_prenex_119 v_prenex_122) v_arrayElimCell_126)) (not (bvsle .cse400 .cse401)) (not (bvsle (_ bv0 32) v_prenex_121)) (not (bvsle v_prenex_121 .cse402)) (not (bvsle .cse402 .cse401)) (not (bvsle (_ bv0 32) .cse403)) (not (= (select |c_#valid| v_prenex_119) (_ bv0 1))) (= v_arrayElimCell_126 c_main_~x~0.base) (not (bvsle .cse403 .cse400)))))) (or .cse80 (forall ((v_prenex_309 (_ BitVec 32)) (v_prenex_308 (_ BitVec 32)) (v_prenex_307 (_ BitVec 32)) (v_prenex_306 (_ BitVec 32)) (v_prenex_305 (_ BitVec 32)) (v_prenex_29 (_ BitVec 32))) (let ((.cse404 (bvadd v_prenex_307 (_ bv8 32))) (.cse407 (bvadd v_prenex_307 (_ bv12 32))) (.cse409 (bvadd v_prenex_309 v_prenex_307)) (.cse408 (select |c_#length| v_prenex_29)) (.cse405 (bvadd v_prenex_307 (_ bv4 32))) (.cse406 (store |c_#length| v_prenex_305 v_prenex_308))) (or (not (bvsle (_ bv0 32) v_prenex_307)) (not (bvsle (_ bv0 32) .cse404)) (bvsle .cse405 (select .cse406 v_prenex_29)) (not (bvsle .cse404 .cse407)) (= v_prenex_29 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_305) (_ bv0 1))) (not (bvsle .cse407 .cse408)) (not (bvsle v_prenex_307 .cse409)) (not (bvsle .cse409 .cse408)) (bvsle .cse405 (select .cse406 v_prenex_306))))) .cse1) (= c_main_~x~0.offset (_ bv0 32)) (or .cse0 .cse1 (forall ((v_prenex_152 (_ BitVec 32)) (v_arrayElimCell_223 (_ BitVec 32)) (v_prenex_151 (_ BitVec 32)) (v_prenex_150 (_ BitVec 32)) (v_prenex_149 (_ BitVec 32))) (let ((.cse410 (bvadd v_prenex_150 v_prenex_151)) (.cse411 (select |c_#length| v_arrayElimCell_223)) (.cse413 (bvadd v_prenex_151 (_ bv8 32))) (.cse412 (bvadd v_prenex_151 (_ bv12 32)))) (or (not (bvsle v_prenex_151 .cse410)) (not (bvsle .cse410 .cse411)) (= v_arrayElimCell_223 c_main_~x~0.base) (bvsle (bvadd v_prenex_151 (_ bv4 32)) (select (store |c_#length| v_prenex_149 v_prenex_152) v_arrayElimCell_223)) (not (bvsle .cse412 .cse411)) (not (bvsle (_ bv0 32) .cse413)) (not (bvsle .cse413 .cse412)) (not (= (select |c_#valid| v_prenex_149) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_151)))))) (or .cse0 .cse1 (forall ((v_arrayElimCell_219 (_ BitVec 32)) (v_prenex_48 (_ BitVec 32)) (v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32)) (v_prenex_47 (_ BitVec 32))) (let ((.cse414 (bvadd v_prenex_45 v_prenex_48)) (.cse416 (select |c_#length| v_arrayElimCell_219)) (.cse415 (bvadd v_prenex_48 (_ bv8 32))) (.cse417 (bvadd v_prenex_48 (_ bv12 32)))) (or (not (bvsle v_prenex_48 .cse414)) (not (= (select |c_#valid| v_prenex_46) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse415)) (not (bvsle (_ bv0 32) v_prenex_48)) (not (bvsle .cse414 .cse416)) (not (bvsle .cse417 .cse416)) (bvsle (bvadd v_prenex_48 (_ bv4 32)) (select (store |c_#length| v_prenex_46 v_prenex_47) v_arrayElimCell_219)) (not (bvsle .cse415 .cse417)))))) (or .cse0 .cse1 (forall ((v_prenex_153 (_ BitVec 32)) (v_arrayElimCell_58 (_ BitVec 32)) (v_prenex_157 (_ BitVec 32)) (v_prenex_156 (_ BitVec 32)) (v_prenex_155 (_ BitVec 32)) (v_prenex_154 (_ BitVec 32))) (let ((.cse421 (bvadd v_prenex_156 (_ bv12 32))) (.cse419 (select |c_#length| v_arrayElimCell_58)) (.cse418 (bvadd v_prenex_154 v_prenex_156)) (.cse420 (bvadd v_prenex_156 (_ bv8 32))) (.cse422 (bvadd v_prenex_156 (_ bv4 32))) (.cse423 (store |c_#length| v_prenex_153 v_prenex_157))) (or (not (bvsle .cse418 .cse419)) (not (bvsle .cse420 .cse421)) (not (bvsle (_ bv0 32) v_prenex_156)) (= v_arrayElimCell_58 c_main_~x~0.base) (bvsle .cse422 (select .cse423 v_prenex_155)) (not (bvsle .cse421 .cse419)) (not (bvsle v_prenex_156 .cse418)) (not (= (select |c_#valid| v_prenex_153) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse420)) (bvsle .cse422 (select .cse423 v_arrayElimCell_58))))))))) is different from true [2018-11-10 10:28:16,953 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2018-11-10 10:28:19,228 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse47 (= |c_main_write~$Pointer$_#value.base| c_main_~x~0.base)) (.cse1 (= |c_main_write~$Pointer$_#ptr.base| c_main_~x~0.base)) (.cse0 (= c_main_~x~0.offset |c_main_write~$Pointer$_#ptr.offset|))) (let ((.cse106 (bvadd c_main_~x~0.offset (_ bv4 32))) (.cse80 (not .cse0)) (.cse125 (select |c_#length| c_main_~x~0.base)) (.cse88 (bvadd |c_main_write~$Pointer$_#ptr.offset| (_ bv8 32))) (.cse81 (bvadd c_main_~x~0.offset (_ bv8 32))) (.cse293 (bvadd c_main_~x~0.offset (_ bv12 32))) (.cse12 (not .cse1)) (.cse126 (select |c_#valid| |c_main_write~$Pointer$_#ptr.base|)) (.cse179 (select |c_#valid| c_main_~x~0.base)) (.cse363 (not .cse47)) (.cse89 (bvadd |c_main_write~$Pointer$_#ptr.offset| (_ bv12 32))) (.cse244 (select |c_#length| |c_main_write~$Pointer$_#ptr.base|))) (and (or .cse0 .cse1 (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_prenex_70 (_ BitVec 32)) (v_prenex_71 (_ BitVec 32)) (v_prenex_67 (_ BitVec 32)) (v_prenex_68 (_ BitVec 32)) (v_prenex_69 (_ BitVec 32))) (let ((.cse4 (bvadd v_prenex_71 (_ bv8 32))) (.cse6 (bvadd v_prenex_67 v_prenex_71)) (.cse2 (bvadd v_prenex_71 (_ bv4 32))) (.cse3 (store |c_#length| v_prenex_69 v_prenex_68)) (.cse5 (bvadd v_prenex_71 (_ bv12 32))) (.cse7 (select |c_#length| v_arrayElimCell_32))) (or (bvsle .cse2 (select .cse3 v_arrayElimCell_32)) (not (bvsle .cse4 .cse5)) (not (bvsle .cse6 .cse7)) (not (= (select |c_#valid| v_prenex_69) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse4)) (not (bvsle v_prenex_71 .cse6)) (bvsle .cse2 (select .cse3 v_prenex_70)) (not (bvsle .cse5 .cse7)) (= v_arrayElimCell_32 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_71)))))) (or .cse0 .cse1 (forall ((v_prenex_63 (_ BitVec 32)) (v_prenex_64 (_ BitVec 32)) (v_prenex_65 (_ BitVec 32)) (v_prenex_66 (_ BitVec 32)) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse8 (bvadd v_prenex_63 v_prenex_66)) (.cse10 (select |c_#length| v_arrayElimCell_176)) (.cse9 (bvadd v_prenex_66 (_ bv8 32))) (.cse11 (bvadd v_prenex_66 (_ bv12 32)))) (or (not (= (select |c_#valid| v_prenex_65) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_66)) (not (bvsle v_prenex_66 .cse8)) (not (bvsle (_ bv0 32) .cse9)) (bvsle (bvadd v_prenex_66 (_ bv4 32)) (select (store |c_#length| v_prenex_65 v_prenex_64) v_arrayElimCell_176)) (not (bvsle .cse8 .cse10)) (not (bvsle .cse11 .cse10)) (not (bvsle .cse9 .cse11)))))) (or .cse0 .cse12 (forall ((v_arrayElimCell_205 (_ BitVec 32)) (v_prenex_113 (_ BitVec 32)) (v_prenex_112 (_ BitVec 32)) (v_prenex_111 (_ BitVec 32)) (v_prenex_110 (_ BitVec 32))) (let ((.cse15 (bvadd v_prenex_112 (_ bv8 32))) (.cse13 (bvadd v_prenex_110 v_prenex_112)) (.cse16 (bvadd v_prenex_112 (_ bv12 32))) (.cse14 (select |c_#length| v_arrayElimCell_205))) (or (not (bvsle .cse13 .cse14)) (not (bvsle .cse15 .cse16)) (not (bvsle (_ bv0 32) .cse15)) (not (bvsle (_ bv0 32) v_prenex_112)) (not (= (select |c_#valid| v_prenex_111) (_ bv0 1))) (bvsle (bvadd v_prenex_112 (_ bv4 32)) (select (store |c_#length| v_prenex_111 v_prenex_113) v_arrayElimCell_205)) (not (bvsle v_prenex_112 .cse13)) (not (bvsle .cse16 .cse14)) (= v_arrayElimCell_205 c_main_~x~0.base))))) (or (forall ((v_prenex_319 (_ BitVec 32)) (v_prenex_318 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_prenex_322 (_ BitVec 32)) (v_prenex_321 (_ BitVec 32)) (v_prenex_320 (_ BitVec 32))) (let ((.cse17 (bvadd v_prenex_322 v_prenex_320)) (.cse20 (bvadd v_prenex_320 (_ bv12 32))) (.cse18 (select |c_#length| v_arrayElimCell_182)) (.cse19 (bvadd v_prenex_320 (_ bv8 32))) (.cse21 (bvadd v_prenex_320 (_ bv4 32))) (.cse22 (store |c_#length| v_prenex_318 v_prenex_321))) (or (not (bvsle .cse17 .cse18)) (not (bvsle .cse19 .cse20)) (not (= (select |c_#valid| v_prenex_318) (_ bv0 1))) (bvsle .cse21 (select .cse22 v_arrayElimCell_182)) (= v_arrayElimCell_182 c_main_~x~0.base) (not (bvsle v_prenex_320 .cse17)) (not (bvsle .cse20 .cse18)) (not (bvsle (_ bv0 32) v_prenex_320)) (not (bvsle (_ bv0 32) .cse19)) (bvsle .cse21 (select .cse22 v_prenex_319))))) .cse1) (or (forall ((v_arrayElimCell_66 (_ BitVec 32)) (v_prenex_339 (_ BitVec 32)) (v_prenex_338 (_ BitVec 32)) (v_prenex_337 (_ BitVec 32)) (v_prenex_336 (_ BitVec 32))) (let ((.cse23 (bvadd v_prenex_339 v_prenex_337)) (.cse24 (select |c_#length| v_arrayElimCell_66)) (.cse25 (bvadd v_prenex_337 (_ bv8 32))) (.cse26 (bvadd v_prenex_337 (_ bv12 32)))) (or (not (bvsle v_prenex_337 .cse23)) (not (bvsle .cse23 .cse24)) (not (= (select |c_#valid| v_prenex_336) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_337)) (not (bvsle (_ bv0 32) .cse25)) (bvsle (bvadd v_prenex_337 (_ bv4 32)) (select (store |c_#length| v_prenex_336 v_prenex_338) v_arrayElimCell_66)) (not (bvsle .cse26 .cse24)) (not (bvsle .cse25 .cse26))))) .cse0 .cse1) (or .cse0 .cse1 (forall ((v_arrayElimCell_167 (_ BitVec 32)) (v_prenex_142 (_ BitVec 32)) (v_prenex_141 (_ BitVec 32)) (v_prenex_140 (_ BitVec 32)) (v_prenex_144 (_ BitVec 32)) (v_prenex_143 (_ BitVec 32))) (let ((.cse30 (bvadd v_prenex_143 (_ bv12 32))) (.cse28 (select |c_#length| v_arrayElimCell_167)) (.cse27 (bvadd v_prenex_141 v_prenex_143)) (.cse29 (bvadd v_prenex_143 (_ bv8 32))) (.cse31 (bvadd v_prenex_143 (_ bv4 32))) (.cse32 (store |c_#length| v_prenex_140 v_prenex_144))) (or (not (bvsle .cse27 .cse28)) (not (bvsle .cse29 .cse30)) (bvsle .cse31 (select .cse32 v_arrayElimCell_167)) (not (bvsle .cse30 .cse28)) (not (bvsle v_prenex_143 .cse27)) (not (bvsle (_ bv0 32) .cse29)) (not (bvsle (_ bv0 32) v_prenex_143)) (not (= (select |c_#valid| v_prenex_140) (_ bv0 1))) (bvsle .cse31 (select .cse32 v_prenex_142)))))) (or .cse0 .cse12 (forall ((v_arrayElimCell_207 (_ BitVec 32)) (v_prenex_256 (_ BitVec 32)) (v_prenex_255 (_ BitVec 32)) (v_prenex_254 (_ BitVec 32)) (v_prenex_253 (_ BitVec 32))) (let ((.cse35 (bvadd v_prenex_254 (_ bv12 32))) (.cse33 (bvadd v_prenex_256 v_prenex_254)) (.cse36 (select |c_#length| v_arrayElimCell_207)) (.cse34 (bvadd v_prenex_254 (_ bv8 32)))) (or (not (bvsle v_prenex_254 .cse33)) (not (bvsle (_ bv0 32) v_prenex_254)) (not (bvsle .cse34 .cse35)) (not (= (select |c_#valid| v_prenex_253) (_ bv0 1))) (not (bvsle .cse35 .cse36)) (bvsle (bvadd v_prenex_254 (_ bv4 32)) (select (store |c_#length| v_prenex_253 v_prenex_255) v_arrayElimCell_207)) (not (bvsle .cse33 .cse36)) (not (bvsle (_ bv0 32) .cse34)))))) (or (forall ((v_arrayElimCell_201 (_ BitVec 32)) (v_prenex_219 (_ BitVec 32)) (v_prenex_218 (_ BitVec 32)) (v_prenex_217 (_ BitVec 32)) (v_prenex_216 (_ BitVec 32)) (v_prenex_220 (_ BitVec 32))) (let ((.cse38 (bvadd v_prenex_218 (_ bv4 32))) (.cse39 (store |c_#length| v_prenex_216 v_prenex_219)) (.cse37 (bvadd v_prenex_220 v_prenex_218)) (.cse41 (select |c_#length| v_arrayElimCell_201)) (.cse42 (bvadd v_prenex_218 (_ bv8 32))) (.cse40 (bvadd v_prenex_218 (_ bv12 32)))) (or (not (bvsle v_prenex_218 .cse37)) (bvsle .cse38 (select .cse39 v_arrayElimCell_201)) (= v_arrayElimCell_201 c_main_~x~0.base) (bvsle .cse38 (select .cse39 v_prenex_217)) (not (bvsle (_ bv0 32) v_prenex_218)) (not (bvsle .cse40 .cse41)) (not (bvsle .cse37 .cse41)) (not (= (select |c_#valid| v_prenex_216) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse42)) (not (bvsle .cse42 .cse40))))) .cse1) (or .cse0 .cse1 (forall ((v_prenex_274 (_ BitVec 32)) (v_arrayElimCell_102 (_ BitVec 32)) (v_prenex_277 (_ BitVec 32)) (v_prenex_276 (_ BitVec 32)) (v_prenex_275 (_ BitVec 32))) (let ((.cse44 (bvadd v_prenex_275 (_ bv12 32))) (.cse43 (bvadd v_prenex_275 (_ bv8 32))) (.cse45 (bvadd v_prenex_277 v_prenex_275)) (.cse46 (select |c_#length| v_arrayElimCell_102))) (or (not (bvsle .cse43 .cse44)) (not (bvsle v_prenex_275 .cse45)) (not (bvsle .cse44 .cse46)) (bvsle (bvadd v_prenex_275 (_ bv4 32)) (select (store |c_#length| v_prenex_274 v_prenex_276) v_arrayElimCell_102)) (not (bvsle (_ bv0 32) .cse43)) (not (= (select |c_#valid| v_prenex_274) (_ bv0 1))) (not (bvsle .cse45 .cse46)) (not (bvsle (_ bv0 32) v_prenex_275)))))) (or .cse47 .cse0 .cse1 (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_prenex_296 (_ BitVec 32)) (v_prenex_295 (_ BitVec 32)) (v_prenex_294 (_ BitVec 32)) (v_prenex_293 (_ BitVec 32)) (v_prenex_292 (_ BitVec 32))) (let ((.cse51 (select |c_#length| v_arrayElimCell_46)) (.cse50 (bvadd v_prenex_294 (_ bv12 32))) (.cse52 (bvadd v_prenex_296 v_prenex_294)) (.cse53 (bvadd v_prenex_294 (_ bv8 32))) (.cse48 (bvadd v_prenex_294 (_ bv4 32))) (.cse49 (store |c_#length| v_prenex_292 v_prenex_295))) (or (not (= (select |c_#valid| v_prenex_292) (_ bv0 1))) (bvsle .cse48 (select .cse49 v_arrayElimCell_46)) (not (bvsle (_ bv0 32) v_prenex_294)) (not (bvsle .cse50 .cse51)) (not (bvsle .cse52 .cse51)) (= v_arrayElimCell_46 c_main_~x~0.base) (not (bvsle .cse53 .cse50)) (not (bvsle v_prenex_294 .cse52)) (not (bvsle (_ bv0 32) .cse53)) (bvsle .cse48 (select .cse49 v_prenex_293)))))) (or .cse47 (forall ((v_prenex_370 (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_369 (_ BitVec 32)) (v_prenex_368 (_ BitVec 32)) (v_prenex_367 (_ BitVec 32))) (let ((.cse55 (bvadd v_prenex_369 (_ bv8 32))) (.cse54 (bvadd v_prenex_370 v_prenex_369)) (.cse56 (bvadd v_prenex_369 (_ bv12 32))) (.cse57 (select |c_#length| v_prenex_16))) (or (not (= (select |c_#valid| v_prenex_368) (_ bv0 1))) (= v_prenex_16 c_main_~x~0.base) (not (bvsle v_prenex_369 .cse54)) (not (bvsle .cse55 .cse56)) (bvsle (bvadd v_prenex_369 (_ bv4 32)) (select (store |c_#length| v_prenex_368 v_prenex_367) v_prenex_16)) (not (bvsle (_ bv0 32) .cse55)) (not (bvsle (_ bv0 32) v_prenex_369)) (not (bvsle .cse54 .cse57)) (not (bvsle .cse56 .cse57))))) .cse0 .cse1) (or (forall ((v_prenex_209 (_ BitVec 32)) (v_prenex_208 (_ BitVec 32)) (v_prenex_207 (_ BitVec 32)) (v_arrayElimCell_195 (_ BitVec 32)) (v_prenex_210 (_ BitVec 32))) (let ((.cse58 (bvadd v_prenex_210 v_prenex_208)) (.cse60 (select |c_#length| v_arrayElimCell_195)) (.cse59 (bvadd v_prenex_208 (_ bv8 32))) (.cse61 (bvadd v_prenex_208 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_208)) (not (bvsle v_prenex_208 .cse58)) (= v_arrayElimCell_195 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse59)) (not (bvsle .cse58 .cse60)) (bvsle (bvadd v_prenex_208 (_ bv4 32)) (select (store |c_#length| v_prenex_207 v_prenex_209) v_arrayElimCell_195)) (not (= (select |c_#valid| v_prenex_207) (_ bv0 1))) (not (bvsle .cse61 .cse60)) (not (bvsle .cse59 .cse61))))) .cse1) (or .cse0 .cse1 (forall ((v_prenex_84 (_ BitVec 32)) (v_prenex_85 (_ BitVec 32)) (v_arrayElimCell_49 (_ BitVec 32)) (v_prenex_82 (_ BitVec 32)) (v_prenex_83 (_ BitVec 32))) (let ((.cse64 (bvadd v_prenex_82 v_prenex_84)) (.cse63 (select |c_#length| v_arrayElimCell_49)) (.cse65 (bvadd v_prenex_84 (_ bv8 32))) (.cse62 (bvadd v_prenex_84 (_ bv12 32)))) (or (not (bvsle .cse62 .cse63)) (not (bvsle v_prenex_84 .cse64)) (not (bvsle .cse64 .cse63)) (= v_arrayElimCell_49 c_main_~x~0.base) (bvsle (bvadd v_prenex_84 (_ bv4 32)) (select (store |c_#length| v_prenex_83 v_prenex_85) v_arrayElimCell_49)) (not (bvsle (_ bv0 32) v_prenex_84)) (not (bvsle (_ bv0 32) .cse65)) (not (bvsle .cse65 .cse62)) (not (= (select |c_#valid| v_prenex_83) (_ bv0 1))))))) (= (bvadd (select |c_#valid| |c_main_write~$Pointer$_#value.base|) (_ bv1 1)) (_ bv0 1)) (or .cse1 (forall ((v_arrayElimCell_192 (_ BitVec 32)) (v_prenex_402 (_ BitVec 32)) (v_prenex_401 (_ BitVec 32)) (v_prenex_400 (_ BitVec 32)) (v_prenex_399 (_ BitVec 32))) (let ((.cse67 (bvadd v_prenex_401 (_ bv12 32))) (.cse69 (bvadd v_prenex_402 v_prenex_401)) (.cse68 (select |c_#length| v_arrayElimCell_192)) (.cse66 (bvadd v_prenex_401 (_ bv8 32)))) (or (not (bvsle .cse66 .cse67)) (not (bvsle (_ bv0 32) v_prenex_401)) (not (bvsle .cse67 .cse68)) (not (bvsle v_prenex_401 .cse69)) (bvsle (bvadd v_prenex_401 (_ bv4 32)) (select (store |c_#length| v_prenex_400 v_prenex_399) v_arrayElimCell_192)) (not (bvsle .cse69 .cse68)) (not (= (select |c_#valid| v_prenex_400) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse66)))))) (or .cse47 .cse1 (forall ((v_prenex_86 (_ BitVec 32)) (v_prenex_87 (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_88 (_ BitVec 32)) (v_prenex_23 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (let ((.cse70 (bvadd v_prenex_86 v_prenex_89)) (.cse72 (bvadd v_prenex_89 (_ bv4 32))) (.cse73 (store |c_#length| v_prenex_87 v_prenex_90)) (.cse74 (bvadd v_prenex_89 (_ bv8 32))) (.cse75 (bvadd v_prenex_89 (_ bv12 32))) (.cse71 (select |c_#length| v_prenex_23))) (or (not (bvsle .cse70 .cse71)) (= v_prenex_23 c_main_~x~0.base) (bvsle .cse72 (select .cse73 v_prenex_23)) (not (bvsle .cse74 .cse75)) (not (bvsle v_prenex_89 .cse70)) (bvsle .cse72 (select .cse73 v_prenex_88)) (not (bvsle (_ bv0 32) v_prenex_89)) (not (bvsle (_ bv0 32) .cse74)) (not (bvsle .cse75 .cse71)) (not (= (select |c_#valid| v_prenex_87) (_ bv0 1))))))) (or .cse47 .cse12 (forall ((v_prenex_268 (_ BitVec 32)) (v_prenex_267 (_ BitVec 32)) (v_prenex_266 (_ BitVec 32)) (v_prenex_265 (_ BitVec 32))) (let ((.cse78 (bvadd v_prenex_266 (_ bv8 32))) (.cse76 (bvadd v_prenex_266 (_ bv12 32))) (.cse79 (bvadd v_prenex_268 v_prenex_266)) (.cse77 (select |c_#length| |c_main_write~$Pointer$_#value.base|))) (or (not (bvsle .cse76 .cse77)) (not (= (select |c_#valid| v_prenex_265) (_ bv0 1))) (bvsle (bvadd v_prenex_266 (_ bv4 32)) (select (store |c_#length| v_prenex_265 v_prenex_267) |c_main_write~$Pointer$_#value.base|)) (not (bvsle (_ bv0 32) .cse78)) (not (bvsle (_ bv0 32) v_prenex_266)) (not (bvsle v_prenex_266 .cse79)) (not (bvsle .cse78 .cse76)) (not (bvsle .cse79 .cse77))))) .cse80) (bvsle (_ bv0 32) .cse81) (or .cse0 .cse1 (forall ((v_prenex_273 (_ BitVec 32)) (v_prenex_272 (_ BitVec 32)) (v_prenex_271 (_ BitVec 32)) (v_prenex_270 (_ BitVec 32)) (v_prenex_269 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse82 (bvadd v_prenex_271 (_ bv12 32))) (.cse85 (bvadd v_prenex_271 (_ bv4 32))) (.cse86 (store |c_#length| v_prenex_269 v_prenex_272)) (.cse87 (bvadd v_prenex_271 (_ bv8 32))) (.cse84 (bvadd v_prenex_273 v_prenex_271)) (.cse83 (select |c_#length| v_prenex_11))) (or (not (bvsle .cse82 .cse83)) (not (= (select |c_#valid| v_prenex_269) (_ bv0 1))) (= v_prenex_11 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_271)) (not (bvsle v_prenex_271 .cse84)) (bvsle .cse85 (select .cse86 v_prenex_11)) (not (bvsle .cse87 .cse82)) (bvsle .cse85 (select .cse86 v_prenex_270)) (not (bvsle (_ bv0 32) .cse87)) (not (bvsle .cse84 .cse83)))))) (bvsle .cse88 .cse89) (or .cse47 .cse0 .cse1 (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_126 (_ BitVec 32)) (v_prenex_125 (_ BitVec 32)) (v_prenex_124 (_ BitVec 32)) (v_prenex_123 (_ BitVec 32))) (let ((.cse90 (bvadd v_prenex_124 v_prenex_125)) (.cse91 (select |c_#length| v_prenex_15)) (.cse93 (bvadd v_prenex_125 (_ bv8 32))) (.cse92 (bvadd v_prenex_125 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_125)) (bvsle (bvadd v_prenex_125 (_ bv4 32)) (select (store |c_#length| v_prenex_123 v_prenex_126) v_prenex_15)) (not (bvsle v_prenex_125 .cse90)) (not (bvsle .cse90 .cse91)) (not (= (select |c_#valid| v_prenex_123) (_ bv0 1))) (not (bvsle .cse92 .cse91)) (not (bvsle (_ bv0 32) .cse93)) (not (bvsle .cse93 .cse92)))))) (or (forall ((v_prenex_30 (_ BitVec 32)) (v_prenex_313 (_ BitVec 32)) (v_prenex_312 (_ BitVec 32)) (v_prenex_311 (_ BitVec 32)) (v_prenex_310 (_ BitVec 32))) (let ((.cse94 (bvadd v_prenex_313 v_prenex_311)) (.cse95 (select |c_#length| v_prenex_30)) (.cse96 (bvadd v_prenex_311 (_ bv8 32))) (.cse97 (bvadd v_prenex_311 (_ bv12 32)))) (or (= v_prenex_30 c_main_~x~0.base) (not (bvsle .cse94 .cse95)) (not (bvsle v_prenex_311 .cse94)) (not (= (select |c_#valid| v_prenex_310) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse96)) (not (bvsle (_ bv0 32) v_prenex_311)) (not (bvsle .cse97 .cse95)) (bvsle (bvadd v_prenex_311 (_ bv4 32)) (select (store |c_#length| v_prenex_310 v_prenex_312) v_prenex_30)) (not (bvsle .cse96 .cse97))))) .cse1) (or .cse0 (forall ((v_arrayElimCell_117 (_ BitVec 32)) (v_prenex_326 (_ BitVec 32)) (v_prenex_325 (_ BitVec 32)) (v_prenex_324 (_ BitVec 32)) (v_prenex_323 (_ BitVec 32))) (let ((.cse98 (bvadd v_prenex_324 (_ bv8 32))) (.cse101 (bvadd v_prenex_324 (_ bv12 32))) (.cse100 (select |c_#length| v_arrayElimCell_117)) (.cse99 (bvadd v_prenex_326 v_prenex_324))) (or (not (bvsle (_ bv0 32) .cse98)) (not (bvsle (_ bv0 32) v_prenex_324)) (not (bvsle .cse99 .cse100)) (bvsle (bvadd v_prenex_324 (_ bv4 32)) (select (store |c_#length| v_prenex_323 v_prenex_325) v_arrayElimCell_117)) (not (= (select |c_#valid| v_prenex_323) (_ bv0 1))) (not (bvsle .cse98 .cse101)) (not (bvsle .cse101 .cse100)) (not (bvsle v_prenex_324 .cse99))))) .cse1) (bvsle (_ bv0 32) |c_main_write~$Pointer$_#ptr.offset|) (or .cse47 (forall ((v_prenex_51 (_ BitVec 32)) (v_prenex_52 (_ BitVec 32)) (v_prenex_50 (_ BitVec 32)) (v_prenex_49 (_ BitVec 32)) (v_prenex_33 (_ BitVec 32))) (let ((.cse103 (select |c_#length| v_prenex_33)) (.cse104 (bvadd v_prenex_49 v_prenex_52)) (.cse105 (bvadd v_prenex_52 (_ bv8 32))) (.cse102 (bvadd v_prenex_52 (_ bv12 32)))) (or (not (bvsle .cse102 .cse103)) (= v_prenex_33 c_main_~x~0.base) (not (bvsle .cse104 .cse103)) (not (bvsle v_prenex_52 .cse104)) (not (bvsle (_ bv0 32) .cse105)) (bvsle (bvadd v_prenex_52 (_ bv4 32)) (select (store |c_#length| v_prenex_50 v_prenex_51) v_prenex_33)) (not (= (select |c_#valid| v_prenex_50) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_52)) (not (bvsle .cse105 .cse102))))) .cse1) (bvsle (_ bv0 32) c_main_~x~0.offset) (bvsle c_main_~x~0.offset .cse106) (or (forall ((v_prenex_393 (_ BitVec 32)) (v_prenex_392 (_ BitVec 32)) (v_prenex_391 (_ BitVec 32)) (v_prenex_390 (_ BitVec 32)) (v_prenex_389 (_ BitVec 32)) (v_arrayElimCell_130 (_ BitVec 32))) (let ((.cse111 (bvadd v_prenex_392 (_ bv4 32))) (.cse112 (store |c_#length| v_prenex_391 v_prenex_390)) (.cse108 (bvadd v_prenex_393 v_prenex_392)) (.cse110 (select |c_#length| v_arrayElimCell_130)) (.cse107 (bvadd v_prenex_392 (_ bv8 32))) (.cse109 (bvadd v_prenex_392 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) .cse107)) (not (bvsle v_prenex_392 .cse108)) (not (bvsle .cse109 .cse110)) (not (= (select |c_#valid| v_prenex_391) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_392)) (= v_arrayElimCell_130 c_main_~x~0.base) (bvsle .cse111 (select .cse112 v_arrayElimCell_130)) (bvsle .cse111 (select .cse112 v_prenex_389)) (not (bvsle .cse108 .cse110)) (not (bvsle .cse107 .cse109))))) .cse1) (or .cse0 (forall ((v_prenex_282 (_ BitVec 32)) (v_prenex_281 (_ BitVec 32)) (v_prenex_280 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_279 (_ BitVec 32)) (v_prenex_278 (_ BitVec 32))) (let ((.cse113 (bvadd v_prenex_280 (_ bv8 32))) (.cse115 (bvadd v_prenex_280 (_ bv12 32))) (.cse116 (bvadd v_prenex_280 (_ bv4 32))) (.cse117 (store |c_#length| v_prenex_278 v_prenex_281)) (.cse114 (bvadd v_prenex_282 v_prenex_280)) (.cse118 (select |c_#length| v_prenex_8))) (or (not (bvsle (_ bv0 32) .cse113)) (not (bvsle v_prenex_280 .cse114)) (not (bvsle .cse113 .cse115)) (not (bvsle (_ bv0 32) v_prenex_280)) (bvsle .cse116 (select .cse117 v_prenex_8)) (not (= (select |c_#valid| v_prenex_278) (_ bv0 1))) (not (bvsle .cse115 .cse118)) (bvsle .cse116 (select .cse117 v_prenex_279)) (not (bvsle .cse114 .cse118))))) .cse1) (or .cse1 (forall ((v_prenex_73 (_ BitVec 32)) (v_prenex_74 (_ BitVec 32)) (v_prenex_75 (_ BitVec 32)) (v_prenex_76 (_ BitVec 32)) (v_prenex_72 (_ BitVec 32)) (v_arrayElimCell_198 (_ BitVec 32))) (let ((.cse122 (select |c_#length| v_arrayElimCell_198)) (.cse121 (bvadd v_prenex_72 v_prenex_75)) (.cse123 (bvadd v_prenex_75 (_ bv12 32))) (.cse124 (bvadd v_prenex_75 (_ bv8 32))) (.cse119 (bvadd v_prenex_75 (_ bv4 32))) (.cse120 (store |c_#length| v_prenex_73 v_prenex_76))) (or (bvsle .cse119 (select .cse120 v_arrayElimCell_198)) (not (bvsle .cse121 .cse122)) (not (bvsle .cse123 .cse122)) (not (bvsle (_ bv0 32) v_prenex_75)) (not (bvsle v_prenex_75 .cse121)) (not (= (select |c_#valid| v_prenex_73) (_ bv0 1))) (not (bvsle .cse124 .cse123)) (not (bvsle (_ bv0 32) .cse124)) (bvsle .cse119 (select .cse120 v_prenex_74)))))) (= (bvadd .cse125 (_ bv4294967284 32)) (_ bv0 32)) (= (_ bv1 1) .cse126) (or .cse0 .cse1 (forall ((v_prenex_135 (_ BitVec 32)) (v_arrayElimCell_164 (_ BitVec 32)) (v_prenex_134 (_ BitVec 32)) (v_prenex_133 (_ BitVec 32)) (v_prenex_132 (_ BitVec 32))) (let ((.cse127 (bvadd v_prenex_134 (_ bv12 32))) (.cse130 (bvadd v_prenex_133 v_prenex_134)) (.cse128 (select |c_#length| v_arrayElimCell_164)) (.cse129 (bvadd v_prenex_134 (_ bv8 32)))) (or (not (bvsle .cse127 .cse128)) (= v_arrayElimCell_164 c_main_~x~0.base) (bvsle (bvadd v_prenex_134 (_ bv4 32)) (select (store |c_#length| v_prenex_132 v_prenex_135) v_arrayElimCell_164)) (not (bvsle (_ bv0 32) v_prenex_134)) (not (bvsle .cse129 .cse127)) (not (= (select |c_#valid| v_prenex_132) (_ bv0 1))) (not (bvsle v_prenex_134 .cse130)) (not (bvsle .cse130 .cse128)) (not (bvsle (_ bv0 32) .cse129)))))) (or .cse0 .cse1 (forall ((v_prenex_395 (_ BitVec 32)) (v_prenex_394 (_ BitVec 32)) (v_arrayElimCell_99 (_ BitVec 32)) (v_prenex_398 (_ BitVec 32)) (v_prenex_397 (_ BitVec 32)) (v_prenex_396 (_ BitVec 32))) (let ((.cse133 (bvadd v_prenex_397 (_ bv12 32))) (.cse132 (bvadd v_prenex_397 (_ bv8 32))) (.cse131 (bvadd v_prenex_398 v_prenex_397)) (.cse134 (select |c_#length| v_arrayElimCell_99)) (.cse135 (bvadd v_prenex_397 (_ bv4 32))) (.cse136 (store |c_#length| v_prenex_396 v_prenex_395))) (or (not (= (select |c_#valid| v_prenex_396) (_ bv0 1))) (not (bvsle v_prenex_397 .cse131)) (= v_arrayElimCell_99 c_main_~x~0.base) (not (bvsle .cse132 .cse133)) (not (bvsle .cse133 .cse134)) (bvsle .cse135 (select .cse136 v_arrayElimCell_99)) (not (bvsle (_ bv0 32) v_prenex_397)) (not (bvsle (_ bv0 32) .cse132)) (not (bvsle .cse131 .cse134)) (bvsle .cse135 (select .cse136 v_prenex_394)))))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_prenex_329 (_ BitVec 32)) (v_prenex_328 (_ BitVec 32)) (v_prenex_327 (_ BitVec 32)) (v_prenex_331 (_ BitVec 32)) (v_prenex_330 (_ BitVec 32))) (let ((.cse137 (bvadd v_prenex_329 (_ bv8 32))) (.cse138 (bvadd v_prenex_329 (_ bv12 32))) (.cse140 (bvadd v_prenex_329 (_ bv4 32))) (.cse141 (store |c_#length| v_prenex_327 v_prenex_330)) (.cse142 (bvadd v_prenex_331 v_prenex_329)) (.cse139 (select |c_#length| v_arrayElimCell_38))) (or (not (bvsle .cse137 .cse138)) (not (bvsle (_ bv0 32) .cse137)) (not (bvsle .cse138 .cse139)) (bvsle .cse140 (select .cse141 v_prenex_328)) (not (bvsle (_ bv0 32) v_prenex_329)) (bvsle .cse140 (select .cse141 v_arrayElimCell_38)) (not (bvsle v_prenex_329 .cse142)) (not (= (select |c_#valid| v_prenex_327) (_ bv0 1))) (not (bvsle .cse142 .cse139))))) .cse0 .cse1) (or .cse1 (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_prenex_148 (_ BitVec 32)) (v_prenex_147 (_ BitVec 32)) (v_prenex_146 (_ BitVec 32)) (v_prenex_145 (_ BitVec 32))) (let ((.cse143 (bvadd v_prenex_147 (_ bv12 32))) (.cse145 (bvadd v_prenex_146 v_prenex_147)) (.cse144 (select |c_#length| v_arrayElimCell_139)) (.cse146 (bvadd v_prenex_147 (_ bv8 32)))) (or (not (bvsle .cse143 .cse144)) (not (= (select |c_#valid| v_prenex_145) (_ bv0 1))) (not (bvsle v_prenex_147 .cse145)) (= v_arrayElimCell_139 c_main_~x~0.base) (not (bvsle .cse146 .cse143)) (not (bvsle (_ bv0 32) v_prenex_147)) (not (bvsle .cse145 .cse144)) (bvsle (bvadd v_prenex_147 (_ bv4 32)) (select (store |c_#length| v_prenex_145 v_prenex_148) v_arrayElimCell_139)) (not (bvsle (_ bv0 32) .cse146)))))) (or (forall ((v_arrayElimCell_145 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (|main_write~$Pointer$_#sizeOfWrittenType| (_ BitVec 32)) (|v_main_#Ultimate.alloc_~size_4| (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (|v_main_write~$Pointer$_#ptr.offset_35| (_ BitVec 32))) (let ((.cse149 (bvadd |main_write~$Pointer$_#sizeOfWrittenType| |v_main_write~$Pointer$_#ptr.offset_35|)) (.cse147 (bvadd |v_main_write~$Pointer$_#ptr.offset_35| (_ bv4 32))) (.cse148 (store |c_#length| v_prenex_2 |v_main_#Ultimate.alloc_~size_4|)) (.cse151 (bvadd |v_main_write~$Pointer$_#ptr.offset_35| (_ bv8 32))) (.cse152 (bvadd |v_main_write~$Pointer$_#ptr.offset_35| (_ bv12 32))) (.cse150 (select |c_#length| v_arrayElimCell_145))) (or (bvsle .cse147 (select .cse148 v_arrayElimCell_145)) (not (= (select |c_#valid| v_prenex_2) (_ bv0 1))) (not (bvsle .cse149 .cse150)) (not (bvsle (_ bv0 32) .cse151)) (not (bvsle |v_main_write~$Pointer$_#ptr.offset_35| .cse149)) (bvsle .cse147 (select .cse148 v_subst_2)) (= v_arrayElimCell_145 c_main_~x~0.base) (not (bvsle .cse151 .cse152)) (not (bvsle .cse152 .cse150)) (not (bvsle (_ bv0 32) |v_main_write~$Pointer$_#ptr.offset_35|))))) .cse1) (bvsle .cse106 .cse125) (or .cse0 .cse1 (forall ((v_prenex_131 (_ BitVec 32)) (v_prenex_130 (_ BitVec 32)) (v_prenex_129 (_ BitVec 32)) (v_prenex_128 (_ BitVec 32)) (v_prenex_127 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse154 (bvadd v_prenex_130 (_ bv12 32))) (.cse158 (select |c_#length| v_arrayElimCell_122)) (.cse153 (bvadd v_prenex_130 (_ bv8 32))) (.cse155 (bvadd v_prenex_130 (_ bv4 32))) (.cse156 (store |c_#length| v_prenex_127 v_prenex_131)) (.cse157 (bvadd v_prenex_128 v_prenex_130))) (or (not (bvsle .cse153 .cse154)) (bvsle .cse155 (select .cse156 v_prenex_129)) (= v_arrayElimCell_122 c_main_~x~0.base) (not (bvsle .cse157 .cse158)) (not (bvsle .cse154 .cse158)) (not (bvsle (_ bv0 32) .cse153)) (not (bvsle (_ bv0 32) v_prenex_130)) (bvsle .cse155 (select .cse156 v_arrayElimCell_122)) (not (= (select |c_#valid| v_prenex_127) (_ bv0 1))) (not (bvsle v_prenex_130 .cse157)))))) (or .cse1 (forall ((v_prenex_40 (_ BitVec 32)) (v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32)) (v_arrayElimCell_150 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse161 (bvadd v_prenex_44 (_ bv4 32))) (.cse162 (store |c_#length| v_prenex_41 v_prenex_43)) (.cse164 (bvadd v_prenex_44 (_ bv8 32))) (.cse159 (bvadd v_prenex_44 (_ bv12 32))) (.cse163 (bvadd v_prenex_40 v_prenex_44)) (.cse160 (select |c_#length| v_arrayElimCell_150))) (or (not (bvsle .cse159 .cse160)) (bvsle .cse161 (select .cse162 v_prenex_42)) (not (= (select |c_#valid| v_prenex_41) (_ bv0 1))) (not (bvsle v_prenex_44 .cse163)) (= v_arrayElimCell_150 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse164)) (bvsle .cse161 (select .cse162 v_arrayElimCell_150)) (not (bvsle .cse164 .cse159)) (not (bvsle .cse163 .cse160)) (not (bvsle (_ bv0 32) v_prenex_44)))))) (or .cse0 (forall ((v_prenex_161 (_ BitVec 32)) (v_prenex_160 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32)) (v_prenex_159 (_ BitVec 32)) (v_prenex_158 (_ BitVec 32))) (let ((.cse167 (bvadd v_prenex_159 v_prenex_160)) (.cse165 (bvadd v_prenex_160 (_ bv8 32))) (.cse166 (bvadd v_prenex_160 (_ bv12 32))) (.cse168 (select |c_#length| v_arrayElimCell_118))) (or (not (= (select |c_#valid| v_prenex_158) (_ bv0 1))) (not (bvsle .cse165 .cse166)) (not (bvsle v_prenex_160 .cse167)) (not (bvsle .cse167 .cse168)) (not (bvsle (_ bv0 32) .cse165)) (not (bvsle .cse166 .cse168)) (bvsle (bvadd v_prenex_160 (_ bv4 32)) (select (store |c_#length| v_prenex_158 v_prenex_161) v_arrayElimCell_118)) (not (bvsle (_ bv0 32) v_prenex_160)))))) (or .cse0 (forall ((v_prenex_362 (_ BitVec 32)) (v_prenex_366 (_ BitVec 32)) (v_prenex_365 (_ BitVec 32)) (v_prenex_364 (_ BitVec 32)) (v_arrayElimCell_121 (_ BitVec 32)) (v_prenex_363 (_ BitVec 32))) (let ((.cse169 (bvadd v_prenex_365 (_ bv4 32))) (.cse170 (store |c_#length| v_prenex_364 v_prenex_363)) (.cse172 (select |c_#length| v_arrayElimCell_121)) (.cse173 (bvadd v_prenex_366 v_prenex_365)) (.cse171 (bvadd v_prenex_365 (_ bv12 32))) (.cse174 (bvadd v_prenex_365 (_ bv8 32)))) (or (= v_arrayElimCell_121 c_main_~x~0.base) (bvsle .cse169 (select .cse170 v_prenex_362)) (not (bvsle (_ bv0 32) v_prenex_365)) (bvsle .cse169 (select .cse170 v_arrayElimCell_121)) (not (= (select |c_#valid| v_prenex_364) (_ bv0 1))) (not (bvsle .cse171 .cse172)) (not (bvsle .cse173 .cse172)) (not (bvsle v_prenex_365 .cse173)) (not (bvsle .cse174 .cse171)) (not (bvsle (_ bv0 32) .cse174)))))) (or (forall ((v_prenex_206 (_ BitVec 32)) (v_prenex_205 (_ BitVec 32)) (v_prenex_204 (_ BitVec 32)) (v_prenex_203 (_ BitVec 32)) (v_arrayElimCell_142 (_ BitVec 32))) (let ((.cse177 (bvadd v_prenex_206 v_prenex_204)) (.cse175 (bvadd v_prenex_204 (_ bv8 32))) (.cse176 (bvadd v_prenex_204 (_ bv12 32))) (.cse178 (select |c_#length| v_arrayElimCell_142))) (or (not (bvsle .cse175 .cse176)) (not (bvsle v_prenex_204 .cse177)) (not (bvsle (_ bv0 32) v_prenex_204)) (not (bvsle .cse177 .cse178)) (not (bvsle (_ bv0 32) .cse175)) (not (= (select |c_#valid| v_prenex_203) (_ bv0 1))) (not (bvsle .cse176 .cse178)) (bvsle (bvadd v_prenex_204 (_ bv4 32)) (select (store |c_#length| v_prenex_203 v_prenex_205) v_arrayElimCell_142))))) .cse1) (= (bvadd .cse179 (_ bv1 1)) (_ bv0 1)) (or .cse47 .cse0 (forall ((v_prenex_241 (_ BitVec 32)) (v_prenex_240 (_ BitVec 32)) (v_prenex_239 (_ BitVec 32)) (v_arrayElimCell_96 (_ BitVec 32)) (v_prenex_242 (_ BitVec 32))) (let ((.cse180 (bvadd v_prenex_242 v_prenex_240)) (.cse183 (bvadd v_prenex_240 (_ bv12 32))) (.cse181 (select |c_#length| v_arrayElimCell_96)) (.cse182 (bvadd v_prenex_240 (_ bv8 32)))) (or (not (bvsle .cse180 .cse181)) (not (bvsle (_ bv0 32) v_prenex_240)) (= v_arrayElimCell_96 c_main_~x~0.base) (not (bvsle v_prenex_240 .cse180)) (not (bvsle .cse182 .cse183)) (not (bvsle .cse183 .cse181)) (bvsle (bvadd v_prenex_240 (_ bv4 32)) (select (store |c_#length| v_prenex_239 v_prenex_241) v_arrayElimCell_96)) (not (bvsle (_ bv0 32) .cse182)) (not (= (select |c_#valid| v_prenex_239) (_ bv0 1)))))) .cse1) (or .cse0 .cse1 (forall ((v_arrayElimCell_211 (_ BitVec 32)) (v_prenex_351 (_ BitVec 32)) (v_prenex_350 (_ BitVec 32)) (v_prenex_349 (_ BitVec 32)) (v_prenex_352 (_ BitVec 32))) (let ((.cse184 (bvadd v_prenex_351 (_ bv8 32))) (.cse185 (bvadd v_prenex_351 (_ bv12 32))) (.cse187 (bvadd v_prenex_352 v_prenex_351)) (.cse186 (select |c_#length| v_arrayElimCell_211))) (or (not (bvsle (_ bv0 32) .cse184)) (bvsle (bvadd v_prenex_351 (_ bv4 32)) (select (store |c_#length| v_prenex_350 v_prenex_349) v_arrayElimCell_211)) (not (bvsle .cse184 .cse185)) (not (bvsle .cse185 .cse186)) (not (bvsle v_prenex_351 .cse187)) (not (bvsle .cse187 .cse186)) (not (= (select |c_#valid| v_prenex_350) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_351)))))) (or .cse1 (forall ((v_prenex_252 (_ BitVec 32)) (v_prenex_251 (_ BitVec 32)) (v_prenex_250 (_ BitVec 32)) (v_prenex_249 (_ BitVec 32)) (v_prenex_248 (_ BitVec 32)) (v_prenex_34 (_ BitVec 32))) (let ((.cse190 (bvadd v_prenex_250 (_ bv4 32))) (.cse191 (store |c_#length| v_prenex_248 v_prenex_251)) (.cse192 (bvadd v_prenex_250 (_ bv8 32))) (.cse193 (bvadd v_prenex_250 (_ bv12 32))) (.cse189 (select |c_#length| v_prenex_34)) (.cse188 (bvadd v_prenex_252 v_prenex_250))) (or (not (bvsle .cse188 .cse189)) (bvsle .cse190 (select .cse191 v_prenex_34)) (= v_prenex_34 c_main_~x~0.base) (bvsle .cse190 (select .cse191 v_prenex_249)) (not (bvsle .cse192 .cse193)) (not (bvsle (_ bv0 32) .cse192)) (not (bvsle (_ bv0 32) v_prenex_250)) (not (bvsle .cse193 .cse189)) (not (bvsle v_prenex_250 .cse188)) (not (= (select |c_#valid| v_prenex_248) (_ bv0 1))))))) (= (_ bv4 32) |c_main_write~intINTTYPE4_#sizeOfWrittenType|) (or (forall ((v_prenex_171 (_ BitVec 32)) (v_prenex_170 (_ BitVec 32)) (v_prenex_169 (_ BitVec 32)) (v_arrayElimCell_173 (_ BitVec 32)) (v_prenex_168 (_ BitVec 32)) (v_prenex_167 (_ BitVec 32))) (let ((.cse197 (bvadd v_prenex_170 (_ bv8 32))) (.cse194 (bvadd v_prenex_170 (_ bv4 32))) (.cse195 (store |c_#length| v_prenex_167 v_prenex_171)) (.cse196 (bvadd v_prenex_168 v_prenex_170)) (.cse198 (bvadd v_prenex_170 (_ bv12 32))) (.cse199 (select |c_#length| v_arrayElimCell_173))) (or (bvsle .cse194 (select .cse195 v_prenex_169)) (not (bvsle v_prenex_170 .cse196)) (not (bvsle (_ bv0 32) v_prenex_170)) (not (bvsle .cse197 .cse198)) (not (bvsle (_ bv0 32) .cse197)) (bvsle .cse194 (select .cse195 v_arrayElimCell_173)) (not (bvsle .cse196 .cse199)) (not (= (select |c_#valid| v_prenex_167) (_ bv0 1))) (= v_arrayElimCell_173 c_main_~x~0.base) (not (bvsle .cse198 .cse199))))) .cse0 .cse1) (or .cse0 .cse1 (forall ((v_prenex_197 (_ BitVec 32)) (v_prenex_196 (_ BitVec 32)) (v_prenex_195 (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (v_prenex_198 (_ BitVec 32))) (let ((.cse200 (bvadd v_prenex_196 (_ bv8 32))) (.cse201 (bvadd v_prenex_196 (_ bv12 32))) (.cse203 (bvadd v_prenex_198 v_prenex_196)) (.cse202 (select |c_#length| v_prenex_10))) (or (not (bvsle (_ bv0 32) .cse200)) (not (bvsle (_ bv0 32) v_prenex_196)) (not (bvsle .cse201 .cse202)) (bvsle (bvadd v_prenex_196 (_ bv4 32)) (select (store |c_#length| v_prenex_195 v_prenex_197) v_prenex_10)) (not (= (select |c_#valid| v_prenex_195) (_ bv0 1))) (not (bvsle v_prenex_196 .cse203)) (= v_prenex_10 c_main_~x~0.base) (not (bvsle .cse200 .cse201)) (not (bvsle .cse203 .cse202)))))) (or .cse0 (forall ((v_prenex_96 (_ BitVec 32)) (v_prenex_97 (_ BitVec 32)) (v_prenex_98 (_ BitVec 32)) (v_arrayElimCell_216 (_ BitVec 32)) (v_prenex_99 (_ BitVec 32))) (let ((.cse206 (bvadd v_prenex_98 (_ bv8 32))) (.cse207 (bvadd v_prenex_98 (_ bv12 32))) (.cse205 (select |c_#length| v_arrayElimCell_216)) (.cse204 (bvadd v_prenex_96 v_prenex_98))) (or (not (= (select |c_#valid| v_prenex_97) (_ bv0 1))) (bvsle (bvadd v_prenex_98 (_ bv4 32)) (select (store |c_#length| v_prenex_97 v_prenex_99) v_arrayElimCell_216)) (not (bvsle (_ bv0 32) v_prenex_98)) (not (bvsle .cse204 .cse205)) (not (bvsle (_ bv0 32) .cse206)) (= v_arrayElimCell_216 c_main_~x~0.base) (not (bvsle .cse206 .cse207)) (not (bvsle .cse207 .cse205)) (not (bvsle v_prenex_98 .cse204))))) .cse1) (= (bvadd (select |c_#length| |c_main_write~$Pointer$_#value.base|) (_ bv4294967284 32)) (_ bv0 32)) (or .cse47 .cse0 .cse1 (forall ((v_prenex_9 (_ BitVec 32)) (v_prenex_247 (_ BitVec 32)) (v_prenex_246 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32)) (v_prenex_244 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (let ((.cse208 (bvadd v_prenex_247 v_prenex_245)) (.cse210 (select |c_#length| v_prenex_9)) (.cse211 (bvadd v_prenex_245 (_ bv8 32))) (.cse209 (bvadd v_prenex_245 (_ bv12 32))) (.cse212 (bvadd v_prenex_245 (_ bv4 32))) (.cse213 (store |c_#length| v_prenex_243 v_prenex_246))) (or (not (bvsle v_prenex_245 .cse208)) (not (bvsle .cse209 .cse210)) (not (= (select |c_#valid| v_prenex_243) (_ bv0 1))) (not (bvsle .cse208 .cse210)) (not (bvsle (_ bv0 32) .cse211)) (not (bvsle .cse211 .cse209)) (not (bvsle (_ bv0 32) v_prenex_245)) (bvsle .cse212 (select .cse213 v_prenex_9)) (= v_prenex_9 c_main_~x~0.base) (bvsle .cse212 (select .cse213 v_prenex_244)))))) (= (_ bv4 32) |c_main_write~$Pointer$_#sizeOfWrittenType|) (or .cse47 .cse0 (forall ((v_prenex_120 (_ BitVec 32)) (v_arrayElimCell_126 (_ BitVec 32)) (v_prenex_119 (_ BitVec 32)) (v_prenex_122 (_ BitVec 32)) (v_prenex_121 (_ BitVec 32))) (let ((.cse216 (bvadd v_prenex_120 v_prenex_121)) (.cse215 (select |c_#length| v_arrayElimCell_126)) (.cse217 (bvadd v_prenex_121 (_ bv8 32))) (.cse214 (bvadd v_prenex_121 (_ bv12 32)))) (or (bvsle (bvadd v_prenex_121 (_ bv4 32)) (select (store |c_#length| v_prenex_119 v_prenex_122) v_arrayElimCell_126)) (not (bvsle .cse214 .cse215)) (not (bvsle (_ bv0 32) v_prenex_121)) (not (bvsle v_prenex_121 .cse216)) (not (bvsle .cse216 .cse215)) (not (bvsle (_ bv0 32) .cse217)) (not (= (select |c_#valid| v_prenex_119) (_ bv0 1))) (= v_arrayElimCell_126 c_main_~x~0.base) (not (bvsle .cse217 .cse214)))))) (or .cse47 (forall ((v_prenex_309 (_ BitVec 32)) (v_prenex_308 (_ BitVec 32)) (v_prenex_307 (_ BitVec 32)) (v_prenex_306 (_ BitVec 32)) (v_prenex_305 (_ BitVec 32)) (v_prenex_29 (_ BitVec 32))) (let ((.cse218 (bvadd v_prenex_307 (_ bv8 32))) (.cse221 (bvadd v_prenex_307 (_ bv12 32))) (.cse223 (bvadd v_prenex_309 v_prenex_307)) (.cse222 (select |c_#length| v_prenex_29)) (.cse219 (bvadd v_prenex_307 (_ bv4 32))) (.cse220 (store |c_#length| v_prenex_305 v_prenex_308))) (or (not (bvsle (_ bv0 32) v_prenex_307)) (not (bvsle (_ bv0 32) .cse218)) (bvsle .cse219 (select .cse220 v_prenex_29)) (not (bvsle .cse218 .cse221)) (= v_prenex_29 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_305) (_ bv0 1))) (not (bvsle .cse221 .cse222)) (not (bvsle v_prenex_307 .cse223)) (not (bvsle .cse223 .cse222)) (bvsle .cse219 (select .cse220 v_prenex_306))))) .cse1) (or .cse0 .cse1 (forall ((v_arrayElimCell_219 (_ BitVec 32)) (v_prenex_48 (_ BitVec 32)) (v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32)) (v_prenex_47 (_ BitVec 32))) (let ((.cse224 (bvadd v_prenex_45 v_prenex_48)) (.cse226 (select |c_#length| v_arrayElimCell_219)) (.cse225 (bvadd v_prenex_48 (_ bv8 32))) (.cse227 (bvadd v_prenex_48 (_ bv12 32)))) (or (not (bvsle v_prenex_48 .cse224)) (not (= (select |c_#valid| v_prenex_46) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse225)) (not (bvsle (_ bv0 32) v_prenex_48)) (not (bvsle .cse224 .cse226)) (not (bvsle .cse227 .cse226)) (bvsle (bvadd v_prenex_48 (_ bv4 32)) (select (store |c_#length| v_prenex_46 v_prenex_47) v_arrayElimCell_219)) (not (bvsle .cse225 .cse227)))))) (or .cse0 .cse12 (forall ((v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_317 (_ BitVec 32)) (v_prenex_316 (_ BitVec 32)) (v_prenex_315 (_ BitVec 32)) (v_prenex_314 (_ BitVec 32))) (let ((.cse230 (select |c_#length| v_arrayElimCell_112)) (.cse228 (bvadd v_prenex_315 (_ bv8 32))) (.cse229 (bvadd v_prenex_315 (_ bv12 32))) (.cse231 (bvadd v_prenex_317 v_prenex_315))) (or (not (bvsle (_ bv0 32) .cse228)) (bvsle (bvadd v_prenex_315 (_ bv4 32)) (select (store |c_#length| v_prenex_314 v_prenex_316) v_arrayElimCell_112)) (not (= (select |c_#valid| v_prenex_314) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_315)) (not (bvsle .cse229 .cse230)) (not (bvsle .cse231 .cse230)) (not (bvsle .cse228 .cse229)) (not (bvsle v_prenex_315 .cse231)))))) (or .cse0 .cse1 (forall ((v_prenex_373 (_ BitVec 32)) (v_prenex_372 (_ BitVec 32)) (v_prenex_371 (_ BitVec 32)) (v_arrayElimCell_159 (_ BitVec 32)) (v_prenex_375 (_ BitVec 32)) (v_prenex_374 (_ BitVec 32))) (let ((.cse233 (select |c_#length| v_arrayElimCell_159)) (.cse236 (bvadd v_prenex_374 (_ bv8 32))) (.cse237 (bvadd v_prenex_374 (_ bv12 32))) (.cse232 (bvadd v_prenex_375 v_prenex_374)) (.cse234 (bvadd v_prenex_374 (_ bv4 32))) (.cse235 (store |c_#length| v_prenex_373 v_prenex_372))) (or (not (bvsle .cse232 .cse233)) (bvsle .cse234 (select .cse235 v_prenex_371)) (not (bvsle (_ bv0 32) .cse236)) (= v_arrayElimCell_159 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_373) (_ bv0 1))) (not (bvsle .cse237 .cse233)) (not (bvsle .cse236 .cse237)) (not (bvsle v_prenex_374 .cse232)) (not (bvsle (_ bv0 32) v_prenex_374)) (bvsle .cse234 (select .cse235 v_arrayElimCell_159)))))) (or .cse0 (forall ((v_prenex_80 (_ BitVec 32)) (v_prenex_81 (_ BitVec 32)) (v_arrayElimCell_77 (_ BitVec 32)) (v_prenex_77 (_ BitVec 32)) (v_prenex_78 (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (let ((.cse238 (bvadd v_prenex_80 (_ bv8 32))) (.cse240 (bvadd v_prenex_77 v_prenex_80)) (.cse242 (bvadd v_prenex_80 (_ bv4 32))) (.cse243 (store |c_#length| v_prenex_78 v_prenex_81)) (.cse239 (bvadd v_prenex_80 (_ bv12 32))) (.cse241 (select |c_#length| v_arrayElimCell_77))) (or (not (bvsle (_ bv0 32) v_prenex_80)) (not (= (select |c_#valid| v_prenex_78) (_ bv0 1))) (= v_arrayElimCell_77 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse238)) (not (bvsle .cse238 .cse239)) (not (bvsle .cse240 .cse241)) (bvsle .cse242 (select .cse243 v_arrayElimCell_77)) (not (bvsle v_prenex_80 .cse240)) (bvsle .cse242 (select .cse243 v_prenex_79)) (not (bvsle .cse239 .cse241))))) .cse1) (= (bvadd .cse244 (_ bv4294967284 32)) (_ bv0 32)) (= (bvadd |c_main_write~intINTTYPE4_#ptr.offset| (_ bv4294967288 32)) c_main_~x~0.offset) (or .cse0 .cse1 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_prenex_291 (_ BitVec 32)) (v_prenex_290 (_ BitVec 32)) (v_prenex_289 (_ BitVec 32)) (v_prenex_288 (_ BitVec 32)) (v_prenex_287 (_ BitVec 32))) (let ((.cse249 (select |c_#length| v_arrayElimCell_35)) (.cse248 (bvadd v_prenex_291 v_prenex_289)) (.cse247 (bvadd v_prenex_289 (_ bv8 32))) (.cse250 (bvadd v_prenex_289 (_ bv12 32))) (.cse245 (bvadd v_prenex_289 (_ bv4 32))) (.cse246 (store |c_#length| v_prenex_287 v_prenex_290))) (or (bvsle .cse245 (select .cse246 v_arrayElimCell_35)) (not (bvsle (_ bv0 32) .cse247)) (not (bvsle .cse248 .cse249)) (not (bvsle .cse250 .cse249)) (not (bvsle v_prenex_289 .cse248)) (not (= (select |c_#valid| v_prenex_287) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_289)) (= v_arrayElimCell_35 c_main_~x~0.base) (not (bvsle .cse247 .cse250)) (bvsle .cse245 (select .cse246 v_prenex_288)))))) (or .cse0 (forall ((v_prenex_186 (_ BitVec 32)) (v_prenex_189 (_ BitVec 32)) (v_prenex_13 (_ BitVec 32)) (v_prenex_188 (_ BitVec 32)) (v_prenex_187 (_ BitVec 32))) (let ((.cse251 (bvadd v_prenex_187 v_prenex_188)) (.cse253 (bvadd v_prenex_188 (_ bv12 32))) (.cse254 (select |c_#length| v_prenex_13)) (.cse252 (bvadd v_prenex_188 (_ bv8 32)))) (or (not (bvsle v_prenex_188 .cse251)) (not (bvsle .cse252 .cse253)) (not (bvsle .cse251 .cse254)) (not (bvsle (_ bv0 32) v_prenex_188)) (= v_prenex_13 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_186) (_ bv0 1))) (not (bvsle .cse253 .cse254)) (bvsle (bvadd v_prenex_188 (_ bv4 32)) (select (store |c_#length| v_prenex_186 v_prenex_189) v_prenex_13)) (not (bvsle (_ bv0 32) .cse252))))) .cse1) (or (forall ((v_prenex_104 (_ BitVec 32)) (v_prenex_103 (_ BitVec 32)) (v_prenex_102 (_ BitVec 32)) (v_prenex_101 (_ BitVec 32)) (v_prenex_100 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (let ((.cse255 (bvadd v_prenex_100 v_prenex_103)) (.cse257 (select |c_#length| v_arrayElimCell_155)) (.cse258 (bvadd v_prenex_103 (_ bv4 32))) (.cse259 (store |c_#length| v_prenex_101 v_prenex_104)) (.cse260 (bvadd v_prenex_103 (_ bv8 32))) (.cse256 (bvadd v_prenex_103 (_ bv12 32)))) (or (not (bvsle v_prenex_103 .cse255)) (not (bvsle .cse256 .cse257)) (not (bvsle .cse255 .cse257)) (bvsle .cse258 (select .cse259 v_prenex_102)) (not (bvsle (_ bv0 32) v_prenex_103)) (bvsle .cse258 (select .cse259 v_arrayElimCell_155)) (not (= (select |c_#valid| v_prenex_101) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse260)) (not (bvsle .cse260 .cse256))))) .cse1) (or .cse12 .cse80 (forall ((v_prenex_361 (_ BitVec 32)) (v_prenex_360 (_ BitVec 32)) (v_prenex_359 (_ BitVec 32)) (v_prenex_358 (_ BitVec 32))) (let ((.cse263 (bvadd v_prenex_360 (_ bv12 32))) (.cse261 (bvadd v_prenex_361 v_prenex_360)) (.cse264 (select |c_#length| |c_main_write~$Pointer$_#value.base|)) (.cse262 (bvadd v_prenex_360 (_ bv8 32)))) (or (not (bvsle v_prenex_360 .cse261)) (not (bvsle .cse262 .cse263)) (not (bvsle .cse263 .cse264)) (not (bvsle (_ bv0 32) v_prenex_360)) (bvsle (bvadd v_prenex_360 (_ bv4 32)) (select (store |c_#length| v_prenex_359 v_prenex_358) |c_main_write~$Pointer$_#value.base|)) (not (= (select |c_#valid| v_prenex_359) (_ bv0 1))) (not (bvsle .cse261 .cse264)) (not (bvsle (_ bv0 32) .cse262)))))) (or .cse47 .cse0 .cse12 (forall ((v_prenex_340 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_343 (_ BitVec 32)) (v_prenex_342 (_ BitVec 32)) (v_prenex_341 (_ BitVec 32))) (let ((.cse265 (bvadd v_prenex_343 v_prenex_341)) (.cse267 (bvadd v_prenex_341 (_ bv8 32))) (.cse268 (bvadd v_prenex_341 (_ bv12 32))) (.cse266 (select |c_#length| v_arrayElimCell_109))) (or (bvsle (bvadd v_prenex_341 (_ bv4 32)) (select (store |c_#length| v_prenex_340 v_prenex_342) v_arrayElimCell_109)) (not (bvsle .cse265 .cse266)) (not (bvsle (_ bv0 32) .cse267)) (not (bvsle v_prenex_341 .cse265)) (not (bvsle (_ bv0 32) v_prenex_341)) (not (bvsle .cse267 .cse268)) (not (= (select |c_#valid| v_prenex_340) (_ bv0 1))) (= v_arrayElimCell_109 c_main_~x~0.base) (not (bvsle .cse268 .cse266)))))) (or .cse1 (forall ((v_prenex_263 (_ BitVec 32)) (v_prenex_262 (_ BitVec 32)) (v_prenex_261 (_ BitVec 32)) (v_arrayElimCell_133 (_ BitVec 32)) (v_prenex_264 (_ BitVec 32))) (let ((.cse270 (select |c_#length| v_arrayElimCell_133)) (.cse272 (bvadd v_prenex_264 v_prenex_262)) (.cse271 (bvadd v_prenex_262 (_ bv8 32))) (.cse269 (bvadd v_prenex_262 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_262)) (not (bvsle .cse269 .cse270)) (not (bvsle (_ bv0 32) .cse271)) (not (bvsle .cse272 .cse270)) (not (bvsle v_prenex_262 .cse272)) (= v_arrayElimCell_133 c_main_~x~0.base) (not (bvsle .cse271 .cse269)) (bvsle (bvadd v_prenex_262 (_ bv4 32)) (select (store |c_#length| v_prenex_261 v_prenex_263) v_arrayElimCell_133)) (not (= (select |c_#valid| v_prenex_261) (_ bv0 1))))))) (or .cse47 .cse0 .cse1 (forall ((v_arrayElimCell_125 (_ BitVec 32)) (v_prenex_234 (_ BitVec 32)) (v_prenex_233 (_ BitVec 32)) (v_prenex_232 (_ BitVec 32)) (v_prenex_231 (_ BitVec 32))) (let ((.cse274 (bvadd v_prenex_232 (_ bv12 32))) (.cse273 (bvadd v_prenex_232 (_ bv8 32))) (.cse275 (select |c_#length| v_arrayElimCell_125)) (.cse276 (bvadd v_prenex_234 v_prenex_232))) (or (not (= (select |c_#valid| v_prenex_231) (_ bv0 1))) (not (bvsle .cse273 .cse274)) (not (bvsle .cse274 .cse275)) (not (bvsle (_ bv0 32) .cse273)) (= v_arrayElimCell_125 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_232)) (not (bvsle .cse276 .cse275)) (bvsle (bvadd v_prenex_232 (_ bv4 32)) (select (store |c_#length| v_prenex_231 v_prenex_233) v_arrayElimCell_125)) (not (bvsle v_prenex_232 .cse276)))))) (or .cse0 .cse1 (forall ((v_prenex_348 (_ BitVec 32)) (v_prenex_347 (_ BitVec 32)) (v_prenex_346 (_ BitVec 32)) (v_prenex_345 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_344 (_ BitVec 32))) (let ((.cse279 (select |c_#length| v_prenex_4)) (.cse280 (bvadd v_prenex_346 (_ bv4 32))) (.cse281 (store |c_#length| v_prenex_344 v_prenex_347)) (.cse278 (bvadd v_prenex_348 v_prenex_346)) (.cse277 (bvadd v_prenex_346 (_ bv8 32))) (.cse282 (bvadd v_prenex_346 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_346)) (not (bvsle (_ bv0 32) .cse277)) (not (bvsle .cse278 .cse279)) (not (= (select |c_#valid| v_prenex_344) (_ bv0 1))) (bvsle .cse280 (select .cse281 v_prenex_345)) (not (bvsle .cse282 .cse279)) (bvsle .cse280 (select .cse281 v_prenex_4)) (not (bvsle v_prenex_346 .cse278)) (not (bvsle .cse277 .cse282)) (= v_prenex_4 c_main_~x~0.base))))) (or .cse47 .cse1 (forall ((v_prenex_409 (_ BitVec 32)) (v_prenex_408 (_ BitVec 32)) (v_prenex_407 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32)) (v_prenex_411 (_ BitVec 32)) (v_prenex_410 (_ BitVec 32))) (let ((.cse286 (bvadd v_prenex_411 v_prenex_410)) (.cse287 (select |c_#length| v_prenex_28)) (.cse283 (bvadd v_prenex_410 (_ bv4 32))) (.cse284 (store |c_#length| v_prenex_409 v_prenex_408)) (.cse285 (bvadd v_prenex_410 (_ bv8 32))) (.cse288 (bvadd v_prenex_410 (_ bv12 32)))) (or (bvsle .cse283 (select .cse284 v_prenex_28)) (not (bvsle (_ bv0 32) .cse285)) (not (= (select |c_#valid| v_prenex_409) (_ bv0 1))) (not (bvsle .cse286 .cse287)) (not (bvsle v_prenex_410 .cse286)) (not (bvsle .cse288 .cse287)) (bvsle .cse283 (select .cse284 v_prenex_407)) (not (bvsle .cse285 .cse288)) (not (bvsle (_ bv0 32) v_prenex_410)))))) (or .cse0 (forall ((v_arrayElimCell_170 (_ BitVec 32)) (v_prenex_202 (_ BitVec 32)) (v_prenex_201 (_ BitVec 32)) (v_prenex_200 (_ BitVec 32)) (v_prenex_199 (_ BitVec 32))) (let ((.cse289 (bvadd v_prenex_202 v_prenex_200)) (.cse291 (bvadd v_prenex_200 (_ bv12 32))) (.cse292 (select |c_#length| v_arrayElimCell_170)) (.cse290 (bvadd v_prenex_200 (_ bv8 32)))) (or (= v_arrayElimCell_170 c_main_~x~0.base) (not (bvsle v_prenex_200 .cse289)) (bvsle (bvadd v_prenex_200 (_ bv4 32)) (select (store |c_#length| v_prenex_199 v_prenex_201) v_arrayElimCell_170)) (not (bvsle .cse290 .cse291)) (not (bvsle .cse289 .cse292)) (not (= (select |c_#valid| v_prenex_199) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_200)) (not (bvsle .cse291 .cse292)) (not (bvsle (_ bv0 32) .cse290))))) .cse1) (bvsle .cse293 .cse125) (or .cse0 .cse1 (forall ((v_prenex_194 (_ BitVec 32)) (v_prenex_193 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32)) (v_prenex_192 (_ BitVec 32)) (v_prenex_191 (_ BitVec 32)) (v_prenex_190 (_ BitVec 32))) (let ((.cse294 (bvadd v_prenex_192 (_ bv12 32))) (.cse298 (bvadd v_prenex_192 (_ bv8 32))) (.cse296 (bvadd v_prenex_192 (_ bv4 32))) (.cse297 (store |c_#length| v_prenex_190 v_prenex_193)) (.cse299 (bvadd v_prenex_194 v_prenex_192)) (.cse295 (select |c_#length| v_arrayElimCell_43))) (or (not (bvsle .cse294 .cse295)) (not (bvsle (_ bv0 32) v_prenex_192)) (bvsle .cse296 (select .cse297 v_arrayElimCell_43)) (= v_arrayElimCell_43 c_main_~x~0.base) (not (bvsle .cse298 .cse294)) (not (bvsle (_ bv0 32) .cse298)) (not (bvsle v_prenex_192 .cse299)) (not (= (select |c_#valid| v_prenex_190) (_ bv0 1))) (bvsle .cse296 (select .cse297 v_prenex_191)) (not (bvsle .cse299 .cse295)))))) (or .cse47 (forall ((v_prenex_27 (_ BitVec 32)) (v_prenex_300 (_ BitVec 32)) (v_prenex_299 (_ BitVec 32)) (v_prenex_298 (_ BitVec 32)) (v_prenex_297 (_ BitVec 32))) (let ((.cse300 (bvadd v_prenex_300 v_prenex_298)) (.cse303 (bvadd v_prenex_298 (_ bv12 32))) (.cse301 (select |c_#length| v_prenex_27)) (.cse302 (bvadd v_prenex_298 (_ bv8 32)))) (or (bvsle (bvadd v_prenex_298 (_ bv4 32)) (select (store |c_#length| v_prenex_297 v_prenex_299) v_prenex_27)) (not (= (select |c_#valid| v_prenex_297) (_ bv0 1))) (not (bvsle v_prenex_298 .cse300)) (not (bvsle .cse300 .cse301)) (not (bvsle (_ bv0 32) v_prenex_298)) (not (bvsle .cse302 .cse303)) (not (bvsle .cse303 .cse301)) (not (bvsle (_ bv0 32) .cse302)) (= v_prenex_27 c_main_~x~0.base)))) .cse1) .cse0 (bvsle (_ bv0 32) .cse88) (or .cse0 .cse1 (forall ((v_prenex_7 (_ BitVec 32)) (v_prenex_357 (_ BitVec 32)) (v_prenex_356 (_ BitVec 32)) (v_prenex_355 (_ BitVec 32)) (v_prenex_354 (_ BitVec 32)) (v_prenex_353 (_ BitVec 32))) (let ((.cse304 (bvadd v_prenex_356 (_ bv8 32))) (.cse305 (bvadd v_prenex_356 (_ bv12 32))) (.cse306 (bvadd v_prenex_356 (_ bv4 32))) (.cse307 (store |c_#length| v_prenex_355 v_prenex_354)) (.cse308 (bvadd v_prenex_357 v_prenex_356)) (.cse309 (select |c_#length| v_prenex_7))) (or (not (bvsle .cse304 .cse305)) (not (= (select |c_#valid| v_prenex_355) (_ bv0 1))) (bvsle .cse306 (select .cse307 v_prenex_7)) (= v_prenex_7 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse304)) (not (bvsle v_prenex_356 .cse308)) (not (bvsle .cse305 .cse309)) (not (bvsle (_ bv0 32) v_prenex_356)) (bvsle .cse306 (select .cse307 v_prenex_353)) (not (bvsle .cse308 .cse309)))))) (or .cse1 (forall ((v_prenex_53 (_ BitVec 32)) (v_prenex_54 (_ BitVec 32)) (v_prenex_55 (_ BitVec 32)) (v_prenex_56 (_ BitVec 32)) (v_prenex_57 (_ BitVec 32))) (let ((.cse310 (bvadd v_prenex_57 (_ bv8 32))) (.cse311 (bvadd v_prenex_57 (_ bv12 32))) (.cse313 (bvadd v_prenex_53 v_prenex_57)) (.cse312 (select |c_#length| v_prenex_56))) (or (not (bvsle (_ bv0 32) .cse310)) (not (bvsle (_ bv0 32) v_prenex_57)) (not (bvsle .cse311 .cse312)) (bvsle (bvadd v_prenex_57 (_ bv4 32)) (select (store |c_#length| v_prenex_55 v_prenex_54) v_prenex_56)) (not (bvsle v_prenex_57 .cse313)) (not (bvsle .cse310 .cse311)) (not (= (select |c_#valid| v_prenex_55) (_ bv0 1))) (not (bvsle .cse313 .cse312)))))) (bvsle .cse81 .cse293) (or .cse1 (forall ((v_prenex_109 (_ BitVec 32)) (v_prenex_108 (_ BitVec 32)) (v_prenex_107 (_ BitVec 32)) (v_prenex_106 (_ BitVec 32)) (v_prenex_26 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (let ((.cse314 (bvadd v_prenex_105 v_prenex_108)) (.cse316 (bvadd v_prenex_108 (_ bv8 32))) (.cse318 (bvadd v_prenex_108 (_ bv4 32))) (.cse319 (store |c_#length| v_prenex_106 v_prenex_109)) (.cse317 (bvadd v_prenex_108 (_ bv12 32))) (.cse315 (select |c_#length| v_prenex_26))) (or (not (bvsle .cse314 .cse315)) (not (= (select |c_#valid| v_prenex_106) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse316)) (not (bvsle (_ bv0 32) v_prenex_108)) (not (bvsle v_prenex_108 .cse314)) (not (bvsle .cse316 .cse317)) (bvsle .cse318 (select .cse319 v_prenex_26)) (bvsle .cse318 (select .cse319 v_prenex_107)) (not (bvsle .cse317 .cse315)))))) (or .cse47 (forall ((v_prenex_335 (_ BitVec 32)) (v_prenex_334 (_ BitVec 32)) (v_prenex_333 (_ BitVec 32)) (v_prenex_332 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse320 (bvadd v_prenex_333 (_ bv8 32))) (.cse321 (bvadd v_prenex_333 (_ bv12 32))) (.cse322 (select |c_#length| v_prenex_24)) (.cse323 (bvadd v_prenex_335 v_prenex_333))) (or (not (bvsle (_ bv0 32) .cse320)) (bvsle (bvadd v_prenex_333 (_ bv4 32)) (select (store |c_#length| v_prenex_332 v_prenex_334) v_prenex_24)) (not (= (select |c_#valid| v_prenex_332) (_ bv0 1))) (not (bvsle .cse321 .cse322)) (not (bvsle (_ bv0 32) v_prenex_333)) (not (bvsle .cse320 .cse321)) (not (bvsle .cse323 .cse322)) (not (bvsle v_prenex_333 .cse323))))) .cse1) (= |c_main_write~intINTTYPE4_#ptr.base| c_main_~x~0.base) (or .cse0 (forall ((v_prenex_238 (_ BitVec 32)) (v_prenex_237 (_ BitVec 32)) (v_prenex_236 (_ BitVec 32)) (v_prenex_235 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse324 (bvadd v_prenex_236 (_ bv8 32))) (.cse325 (bvadd v_prenex_236 (_ bv12 32))) (.cse327 (select |c_#length| v_prenex_12)) (.cse326 (bvadd v_prenex_238 v_prenex_236))) (or (bvsle (bvadd v_prenex_236 (_ bv4 32)) (select (store |c_#length| v_prenex_235 v_prenex_237) v_prenex_12)) (not (bvsle (_ bv0 32) v_prenex_236)) (not (bvsle .cse324 .cse325)) (not (bvsle .cse326 .cse327)) (not (bvsle (_ bv0 32) .cse324)) (not (bvsle .cse325 .cse327)) (not (= (select |c_#valid| v_prenex_235) (_ bv0 1))) (not (bvsle v_prenex_236 .cse326))))) .cse1) (or .cse0 (forall ((v_arrayElimCell_224 (_ BitVec 32)) (v_prenex_260 (_ BitVec 32)) (v_prenex_259 (_ BitVec 32)) (v_prenex_258 (_ BitVec 32)) (v_prenex_257 (_ BitVec 32))) (let ((.cse331 (bvadd v_prenex_258 (_ bv12 32))) (.cse329 (select |c_#length| v_arrayElimCell_224)) (.cse328 (bvadd v_prenex_260 v_prenex_258)) (.cse330 (bvadd v_prenex_258 (_ bv8 32)))) (or (= v_arrayElimCell_224 c_main_~x~0.base) (not (bvsle .cse328 .cse329)) (not (bvsle .cse330 .cse331)) (bvsle (bvadd v_prenex_258 (_ bv4 32)) (select (store |c_#length| v_prenex_257 v_prenex_259) v_arrayElimCell_224)) (not (bvsle .cse331 .cse329)) (not (= (select |c_#valid| v_prenex_257) (_ bv0 1))) (not (bvsle v_prenex_258 .cse328)) (not (bvsle (_ bv0 32) v_prenex_258)) (not (bvsle (_ bv0 32) .cse330)))))) (or .cse47 .cse0 .cse1 (forall ((v_prenex_5 (_ BitVec 32)) (v_prenex_225 (_ BitVec 32)) (v_prenex_224 (_ BitVec 32)) (v_prenex_223 (_ BitVec 32)) (v_prenex_222 (_ BitVec 32)) (v_prenex_221 (_ BitVec 32))) (let ((.cse332 (bvadd v_prenex_223 (_ bv12 32))) (.cse337 (bvadd v_prenex_223 (_ bv8 32))) (.cse334 (bvadd v_prenex_225 v_prenex_223)) (.cse333 (select |c_#length| v_prenex_5)) (.cse335 (bvadd v_prenex_223 (_ bv4 32))) (.cse336 (store |c_#length| v_prenex_221 v_prenex_224))) (or (not (bvsle (_ bv0 32) v_prenex_223)) (not (bvsle .cse332 .cse333)) (not (bvsle v_prenex_223 .cse334)) (bvsle .cse335 (select .cse336 v_prenex_5)) (not (bvsle .cse337 .cse332)) (not (bvsle (_ bv0 32) .cse337)) (not (= (select |c_#valid| v_prenex_221) (_ bv0 1))) (not (bvsle .cse334 .cse333)) (bvsle .cse335 (select .cse336 v_prenex_222)) (= v_prenex_5 c_main_~x~0.base))))) (or .cse0 .cse1 (forall ((v_prenex_175 (_ BitVec 32)) (v_prenex_174 (_ BitVec 32)) (v_prenex_173 (_ BitVec 32)) (v_prenex_172 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 32)) (v_prenex_176 (_ BitVec 32))) (let ((.cse339 (select |c_#length| v_arrayElimCell_52)) (.cse338 (bvadd v_prenex_173 v_prenex_175)) (.cse341 (bvadd v_prenex_175 (_ bv4 32))) (.cse342 (store |c_#length| v_prenex_172 v_prenex_176)) (.cse343 (bvadd v_prenex_175 (_ bv8 32))) (.cse340 (bvadd v_prenex_175 (_ bv12 32)))) (or (not (bvsle .cse338 .cse339)) (not (bvsle .cse340 .cse339)) (not (= (select |c_#valid| v_prenex_172) (_ bv0 1))) (bvsle .cse341 (select .cse342 v_prenex_174)) (not (bvsle v_prenex_175 .cse338)) (not (bvsle (_ bv0 32) .cse343)) (bvsle .cse341 (select .cse342 v_arrayElimCell_52)) (not (bvsle (_ bv0 32) v_prenex_175)) (not (bvsle .cse343 .cse340)) (= v_arrayElimCell_52 c_main_~x~0.base))))) (exists ((|main_write~$Pointer$_#sizeOfWrittenType| (_ BitVec 32))) (let ((.cse344 (bvadd c_main_~x~0.offset |main_write~$Pointer$_#sizeOfWrittenType|))) (and (bvsle .cse344 (select |c_#length| c_main_~x~0.base)) (bvsle c_main_~x~0.offset .cse344)))) (or .cse0 .cse1 (forall ((v_prenex_185 (_ BitVec 32)) (v_prenex_184 (_ BitVec 32)) (v_prenex_183 (_ BitVec 32)) (v_prenex_182 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse346 (bvadd v_prenex_184 (_ bv8 32))) (.cse345 (bvadd v_prenex_183 v_prenex_184)) (.cse347 (bvadd v_prenex_184 (_ bv12 32))) (.cse348 (select |c_#length| v_arrayElimCell_74))) (or (not (bvsle v_prenex_184 .cse345)) (not (bvsle .cse346 .cse347)) (not (bvsle (_ bv0 32) .cse346)) (not (bvsle .cse345 .cse348)) (not (bvsle (_ bv0 32) v_prenex_184)) (= v_arrayElimCell_74 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_182) (_ bv0 1))) (not (bvsle .cse347 .cse348)) (bvsle (bvadd v_prenex_184 (_ bv4 32)) (select (store |c_#length| v_prenex_182 v_prenex_185) v_arrayElimCell_74)))))) (or .cse0 .cse12 (forall ((v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_215 (_ BitVec 32)) (v_prenex_214 (_ BitVec 32)) (v_prenex_213 (_ BitVec 32)) (v_prenex_212 (_ BitVec 32)) (v_prenex_211 (_ BitVec 32))) (let ((.cse349 (bvadd v_prenex_213 (_ bv12 32))) (.cse353 (bvadd v_prenex_213 (_ bv8 32))) (.cse351 (bvadd v_prenex_213 (_ bv4 32))) (.cse352 (store |c_#length| v_prenex_211 v_prenex_214)) (.cse350 (select |c_#length| v_arrayElimCell_114)) (.cse354 (bvadd v_prenex_215 v_prenex_213))) (or (not (bvsle .cse349 .cse350)) (= v_arrayElimCell_114 c_main_~x~0.base) (bvsle .cse351 (select .cse352 v_prenex_212)) (not (bvsle .cse353 .cse349)) (not (bvsle (_ bv0 32) .cse353)) (bvsle .cse351 (select .cse352 v_arrayElimCell_114)) (not (= (select |c_#valid| v_prenex_211) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_213)) (not (bvsle .cse354 .cse350)) (not (bvsle v_prenex_213 .cse354)))))) (= (bvadd .cse126 (_ bv1 1)) (_ bv0 1)) (or .cse47 .cse1 (forall ((v_prenex_31 (_ BitVec 32)) (v_prenex_304 (_ BitVec 32)) (v_prenex_303 (_ BitVec 32)) (v_prenex_302 (_ BitVec 32)) (v_prenex_301 (_ BitVec 32))) (let ((.cse355 (bvadd v_prenex_302 (_ bv8 32))) (.cse357 (bvadd v_prenex_302 (_ bv12 32))) (.cse356 (bvadd v_prenex_304 v_prenex_302)) (.cse358 (select |c_#length| v_prenex_31))) (or (not (bvsle (_ bv0 32) .cse355)) (not (bvsle v_prenex_302 .cse356)) (= v_prenex_31 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_302)) (not (bvsle .cse357 .cse358)) (not (bvsle .cse355 .cse357)) (not (= (select |c_#valid| v_prenex_301) (_ bv0 1))) (bvsle (bvadd v_prenex_302 (_ bv4 32)) (select (store |c_#length| v_prenex_301 v_prenex_303) v_prenex_31)) (not (bvsle .cse356 .cse358)))))) (or (forall ((v_prenex_384 (_ BitVec 32)) (v_prenex_383 (_ BitVec 32)) (v_prenex_382 (_ BitVec 32)) (v_prenex_381 (_ BitVec 32)) (v_prenex_380 (_ BitVec 32))) (let ((.cse359 (bvadd v_prenex_384 v_prenex_383)) (.cse362 (bvadd v_prenex_383 (_ bv12 32))) (.cse360 (select |c_#length| v_prenex_380)) (.cse361 (bvadd v_prenex_383 (_ bv8 32)))) (or (not (bvsle .cse359 .cse360)) (not (bvsle v_prenex_383 .cse359)) (not (bvsle .cse361 .cse362)) (not (bvsle .cse362 .cse360)) (not (bvsle (_ bv0 32) v_prenex_383)) (not (bvsle (_ bv0 32) .cse361)) (not (= (select |c_#valid| v_prenex_382) (_ bv0 1))) (bvsle (bvadd v_prenex_383 (_ bv4 32)) (select (store |c_#length| v_prenex_382 v_prenex_381) v_prenex_380))))) .cse363) (or (forall ((v_prenex_164 (_ BitVec 32)) (v_prenex_163 (_ BitVec 32)) (v_prenex_162 (_ BitVec 32)) (v_arrayElimCell_136 (_ BitVec 32)) (v_prenex_166 (_ BitVec 32)) (v_prenex_165 (_ BitVec 32))) (let ((.cse364 (bvadd v_prenex_163 v_prenex_165)) (.cse365 (bvadd v_prenex_165 (_ bv8 32))) (.cse368 (bvadd v_prenex_165 (_ bv4 32))) (.cse369 (store |c_#length| v_prenex_162 v_prenex_166)) (.cse366 (bvadd v_prenex_165 (_ bv12 32))) (.cse367 (select |c_#length| v_arrayElimCell_136))) (or (not (bvsle v_prenex_165 .cse364)) (= v_arrayElimCell_136 c_main_~x~0.base) (not (bvsle .cse365 .cse366)) (not (bvsle .cse364 .cse367)) (bvsle .cse368 (select .cse369 v_prenex_164)) (not (bvsle (_ bv0 32) .cse365)) (bvsle .cse368 (select .cse369 v_arrayElimCell_136)) (not (bvsle .cse366 .cse367)) (not (= (select |c_#valid| v_prenex_162) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_165))))) .cse1) (or .cse47 .cse1 (forall ((v_prenex_118 (_ BitVec 32)) (v_prenex_117 (_ BitVec 32)) (v_prenex_116 (_ BitVec 32)) (v_prenex_115 (_ BitVec 32)) (v_prenex_114 (_ BitVec 32)) (v_prenex_25 (_ BitVec 32))) (let ((.cse370 (bvadd v_prenex_117 (_ bv8 32))) (.cse371 (bvadd v_prenex_117 (_ bv12 32))) (.cse374 (bvadd v_prenex_115 v_prenex_117)) (.cse375 (select |c_#length| v_prenex_25)) (.cse372 (bvadd v_prenex_117 (_ bv4 32))) (.cse373 (store |c_#length| v_prenex_114 v_prenex_118))) (or (not (bvsle (_ bv0 32) v_prenex_117)) (not (bvsle (_ bv0 32) .cse370)) (= v_prenex_25 c_main_~x~0.base) (not (bvsle .cse370 .cse371)) (bvsle .cse372 (select .cse373 v_prenex_116)) (not (bvsle v_prenex_117 .cse374)) (not (= (select |c_#valid| v_prenex_114) (_ bv0 1))) (not (bvsle .cse371 .cse375)) (not (bvsle .cse374 .cse375)) (bvsle .cse372 (select .cse373 v_prenex_25)))))) (= (_ bv1 1) .cse179) (or .cse1 (forall ((v_prenex_32 (_ BitVec 32)) (v_prenex_181 (_ BitVec 32)) (v_prenex_180 (_ BitVec 32)) (v_prenex_179 (_ BitVec 32)) (v_prenex_178 (_ BitVec 32)) (v_prenex_177 (_ BitVec 32))) (let ((.cse378 (select |c_#length| v_prenex_32)) (.cse376 (bvadd v_prenex_180 (_ bv8 32))) (.cse381 (bvadd v_prenex_180 (_ bv12 32))) (.cse377 (bvadd v_prenex_178 v_prenex_180)) (.cse379 (bvadd v_prenex_180 (_ bv4 32))) (.cse380 (store |c_#length| v_prenex_177 v_prenex_181))) (or (not (bvsle (_ bv0 32) .cse376)) (not (bvsle (_ bv0 32) v_prenex_180)) (not (bvsle .cse377 .cse378)) (bvsle .cse379 (select .cse380 v_prenex_179)) (not (bvsle .cse381 .cse378)) (not (= (select |c_#valid| v_prenex_177) (_ bv0 1))) (not (bvsle .cse376 .cse381)) (= v_prenex_32 c_main_~x~0.base) (not (bvsle v_prenex_180 .cse377)) (bvsle .cse379 (select .cse380 v_prenex_32)))))) (or .cse1 (forall ((v_prenex_230 (_ BitVec 32)) (v_prenex_229 (_ BitVec 32)) (v_prenex_228 (_ BitVec 32)) (v_prenex_227 (_ BitVec 32)) (v_prenex_226 (_ BitVec 32)) (v_prenex_35 (_ BitVec 32))) (let ((.cse386 (bvadd v_prenex_230 v_prenex_228)) (.cse384 (bvadd v_prenex_228 (_ bv8 32))) (.cse382 (bvadd v_prenex_228 (_ bv4 32))) (.cse383 (store |c_#length| v_prenex_226 v_prenex_229)) (.cse385 (bvadd v_prenex_228 (_ bv12 32))) (.cse387 (select |c_#length| v_prenex_35))) (or (bvsle .cse382 (select .cse383 v_prenex_227)) (not (bvsle (_ bv0 32) v_prenex_228)) (not (= (select |c_#valid| v_prenex_226) (_ bv0 1))) (not (bvsle .cse384 .cse385)) (= v_prenex_35 c_main_~x~0.base) (not (bvsle .cse386 .cse387)) (not (bvsle v_prenex_228 .cse386)) (not (bvsle (_ bv0 32) .cse384)) (bvsle .cse382 (select .cse383 v_prenex_35)) (not (bvsle .cse385 .cse387)))))) (or .cse0 (forall ((v_prenex_388 (_ BitVec 32)) (v_prenex_387 (_ BitVec 32)) (v_prenex_386 (_ BitVec 32)) (v_arrayElimCell_220 (_ BitVec 32)) (v_prenex_385 (_ BitVec 32))) (let ((.cse388 (bvadd v_prenex_387 (_ bv8 32))) (.cse391 (bvadd v_prenex_387 (_ bv12 32))) (.cse390 (select |c_#length| v_arrayElimCell_220)) (.cse389 (bvadd v_prenex_388 v_prenex_387))) (or (not (bvsle (_ bv0 32) .cse388)) (not (bvsle (_ bv0 32) v_prenex_387)) (bvsle (bvadd v_prenex_387 (_ bv4 32)) (select (store |c_#length| v_prenex_386 v_prenex_385) v_arrayElimCell_220)) (not (bvsle .cse389 .cse390)) (not (bvsle .cse388 .cse391)) (not (bvsle .cse391 .cse390)) (not (bvsle v_prenex_387 .cse389)) (not (= (select |c_#valid| v_prenex_386) (_ bv0 1))))))) (or (forall ((v_prenex_285 (_ BitVec 32)) (v_prenex_284 (_ BitVec 32)) (v_prenex_283 (_ BitVec 32)) (v_arrayElimCell_63 (_ BitVec 32)) (v_prenex_286 (_ BitVec 32))) (let ((.cse394 (select |c_#length| v_arrayElimCell_63)) (.cse392 (bvadd v_prenex_284 (_ bv8 32))) (.cse395 (bvadd v_prenex_284 (_ bv12 32))) (.cse393 (bvadd v_prenex_286 v_prenex_284))) (or (not (bvsle (_ bv0 32) .cse392)) (not (bvsle (_ bv0 32) v_prenex_284)) (not (bvsle .cse393 .cse394)) (not (bvsle .cse395 .cse394)) (= v_arrayElimCell_63 c_main_~x~0.base) (not (bvsle .cse392 .cse395)) (bvsle (bvadd v_prenex_284 (_ bv4 32)) (select (store |c_#length| v_prenex_283 v_prenex_285) v_arrayElimCell_63)) (not (bvsle v_prenex_284 .cse393)) (not (= (select |c_#valid| v_prenex_283) (_ bv0 1)))))) .cse0 .cse1) (or .cse47 .cse0 .cse1 (forall ((v_prenex_95 (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (v_prenex_93 (_ BitVec 32)) (v_prenex_94 (_ BitVec 32)) (v_arrayElimCell_29 (_ BitVec 32))) (let ((.cse396 (bvadd v_prenex_94 (_ bv4 32))) (.cse397 (store |c_#length| v_prenex_92 v_prenex_95)) (.cse398 (bvadd v_prenex_91 v_prenex_94)) (.cse399 (bvadd v_prenex_94 (_ bv8 32))) (.cse401 (bvadd v_prenex_94 (_ bv12 32))) (.cse400 (select |c_#length| v_arrayElimCell_29))) (or (bvsle .cse396 (select .cse397 v_arrayElimCell_29)) (not (bvsle v_prenex_94 .cse398)) (not (bvsle (_ bv0 32) .cse399)) (bvsle .cse396 (select .cse397 v_prenex_93)) (not (bvsle .cse398 .cse400)) (not (bvsle (_ bv0 32) v_prenex_94)) (not (= (select |c_#valid| v_prenex_92) (_ bv0 1))) (not (bvsle .cse399 .cse401)) (not (bvsle .cse401 .cse400)))))) (or .cse47 .cse0 .cse1 (forall ((v_prenex_406 (_ BitVec 32)) (v_prenex_405 (_ BitVec 32)) (v_prenex_404 (_ BitVec 32)) (v_prenex_403 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse402 (bvadd v_prenex_406 v_prenex_405)) (.cse405 (bvadd v_prenex_405 (_ bv12 32))) (.cse403 (select |c_#length| v_prenex_14)) (.cse404 (bvadd v_prenex_405 (_ bv8 32)))) (or (not (bvsle (_ bv0 32) v_prenex_405)) (not (bvsle .cse402 .cse403)) (not (= (select |c_#valid| v_prenex_404) (_ bv0 1))) (bvsle (bvadd v_prenex_405 (_ bv4 32)) (select (store |c_#length| v_prenex_404 v_prenex_403) v_prenex_14)) (= v_prenex_14 c_main_~x~0.base) (not (bvsle .cse404 .cse405)) (not (bvsle v_prenex_405 .cse402)) (not (bvsle .cse405 .cse403)) (not (bvsle (_ bv0 32) .cse404)))))) .cse363 (or .cse0 (forall ((v_prenex_62 (_ BitVec 32)) (v_prenex_60 (_ BitVec 32)) (v_prenex_61 (_ BitVec 32)) (v_prenex_59 (_ BitVec 32)) (v_prenex_58 (_ BitVec 32))) (let ((.cse407 (select |c_#length| v_prenex_61)) (.cse406 (bvadd v_prenex_58 v_prenex_62)) (.cse408 (bvadd v_prenex_62 (_ bv12 32))) (.cse409 (bvadd v_prenex_62 (_ bv8 32)))) (or (not (= (select |c_#valid| v_prenex_60) (_ bv0 1))) (not (bvsle .cse406 .cse407)) (not (bvsle (_ bv0 32) v_prenex_62)) (not (bvsle .cse408 .cse407)) (not (bvsle v_prenex_62 .cse406)) (not (bvsle .cse409 .cse408)) (bvsle (bvadd v_prenex_62 (_ bv4 32)) (select (store |c_#length| v_prenex_60 v_prenex_59) v_prenex_61)) (not (bvsle (_ bv0 32) .cse409)))))) (or .cse47 .cse0 .cse1 (forall ((v_prenex_139 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_138 (_ BitVec 32)) (v_prenex_137 (_ BitVec 32)) (v_prenex_136 (_ BitVec 32))) (let ((.cse410 (bvadd v_prenex_137 v_prenex_138)) (.cse411 (select |c_#length| v_prenex_6)) (.cse413 (bvadd v_prenex_138 (_ bv8 32))) (.cse412 (bvadd v_prenex_138 (_ bv12 32)))) (or (bvsle (bvadd v_prenex_138 (_ bv4 32)) (select (store |c_#length| v_prenex_136 v_prenex_139) v_prenex_6)) (not (bvsle .cse410 .cse411)) (not (bvsle v_prenex_138 .cse410)) (not (bvsle .cse412 .cse411)) (not (bvsle (_ bv0 32) .cse413)) (= v_prenex_6 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_138)) (not (= (select |c_#valid| v_prenex_136) (_ bv0 1))) (not (bvsle .cse413 .cse412)))))) (or .cse0 (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_prenex_416 (_ BitVec 32)) (v_prenex_415 (_ BitVec 32)) (v_prenex_414 (_ BitVec 32)) (v_prenex_413 (_ BitVec 32)) (v_prenex_412 (_ BitVec 32))) (let ((.cse416 (bvadd v_prenex_415 (_ bv8 32))) (.cse418 (bvadd v_prenex_416 v_prenex_415)) (.cse414 (bvadd v_prenex_415 (_ bv4 32))) (.cse415 (store |c_#length| v_prenex_414 v_prenex_413)) (.cse417 (bvadd v_prenex_415 (_ bv12 32))) (.cse419 (select |c_#length| v_arrayElimCell_69))) (or (bvsle .cse414 (select .cse415 v_prenex_412)) (not (bvsle (_ bv0 32) .cse416)) (not (bvsle (_ bv0 32) v_prenex_415)) (not (bvsle .cse416 .cse417)) (not (bvsle .cse418 .cse419)) (not (bvsle v_prenex_415 .cse418)) (not (= (select |c_#valid| v_prenex_414) (_ bv0 1))) (bvsle .cse414 (select .cse415 v_arrayElimCell_69)) (not (bvsle .cse417 .cse419))))) .cse1) (or .cse1 (forall ((v_prenex_379 (_ BitVec 32)) (v_prenex_378 (_ BitVec 32)) (v_prenex_377 (_ BitVec 32)) (v_prenex_376 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse421 (bvadd v_prenex_379 v_prenex_378)) (.cse420 (bvadd v_prenex_378 (_ bv8 32))) (.cse423 (bvadd v_prenex_378 (_ bv12 32))) (.cse422 (select |c_#length| v_arrayElimCell_187))) (or (bvsle (bvadd v_prenex_378 (_ bv4 32)) (select (store |c_#length| v_prenex_377 v_prenex_376) v_arrayElimCell_187)) (not (bvsle (_ bv0 32) .cse420)) (not (bvsle v_prenex_378 .cse421)) (not (bvsle .cse421 .cse422)) (= v_arrayElimCell_187 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_377) (_ bv0 1))) (not (bvsle .cse420 .cse423)) (not (bvsle .cse423 .cse422)) (not (bvsle (_ bv0 32) v_prenex_378)))))) .cse1 (= c_main_~x~0.offset (_ bv0 32)) (or .cse0 .cse1 (forall ((v_prenex_152 (_ BitVec 32)) (v_arrayElimCell_223 (_ BitVec 32)) (v_prenex_151 (_ BitVec 32)) (v_prenex_150 (_ BitVec 32)) (v_prenex_149 (_ BitVec 32))) (let ((.cse424 (bvadd v_prenex_150 v_prenex_151)) (.cse425 (select |c_#length| v_arrayElimCell_223)) (.cse427 (bvadd v_prenex_151 (_ bv8 32))) (.cse426 (bvadd v_prenex_151 (_ bv12 32)))) (or (not (bvsle v_prenex_151 .cse424)) (not (bvsle .cse424 .cse425)) (= v_arrayElimCell_223 c_main_~x~0.base) (bvsle (bvadd v_prenex_151 (_ bv4 32)) (select (store |c_#length| v_prenex_149 v_prenex_152) v_arrayElimCell_223)) (not (bvsle .cse426 .cse425)) (not (bvsle (_ bv0 32) .cse427)) (not (bvsle .cse427 .cse426)) (not (= (select |c_#valid| v_prenex_149) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_151)))))) (bvsle .cse89 .cse244) (exists ((|main_read~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |main_read~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (not (= |main_read~$Pointer$_#ptr.base| c_main_~x~0.base)))) (or .cse0 .cse1 (forall ((v_prenex_153 (_ BitVec 32)) (v_arrayElimCell_58 (_ BitVec 32)) (v_prenex_157 (_ BitVec 32)) (v_prenex_156 (_ BitVec 32)) (v_prenex_155 (_ BitVec 32)) (v_prenex_154 (_ BitVec 32))) (let ((.cse431 (bvadd v_prenex_156 (_ bv12 32))) (.cse429 (select |c_#length| v_arrayElimCell_58)) (.cse428 (bvadd v_prenex_154 v_prenex_156)) (.cse430 (bvadd v_prenex_156 (_ bv8 32))) (.cse432 (bvadd v_prenex_156 (_ bv4 32))) (.cse433 (store |c_#length| v_prenex_153 v_prenex_157))) (or (not (bvsle .cse428 .cse429)) (not (bvsle .cse430 .cse431)) (not (bvsle (_ bv0 32) v_prenex_156)) (= v_arrayElimCell_58 c_main_~x~0.base) (bvsle .cse432 (select .cse433 v_prenex_155)) (not (bvsle .cse431 .cse429)) (not (bvsle v_prenex_156 .cse428)) (not (= (select |c_#valid| v_prenex_153) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse430)) (bvsle .cse432 (select .cse433 v_arrayElimCell_58))))))))) is different from true [2018-11-10 10:28:21,413 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse47 (= |c_main_write~$Pointer$_#value.base| c_main_~x~0.base)) (.cse1 (= |c_main_write~$Pointer$_#ptr.base| c_main_~x~0.base)) (.cse0 (= c_main_~x~0.offset |c_main_write~$Pointer$_#ptr.offset|))) (let ((.cse80 (not .cse0)) (.cse87 (bvadd |c_main_write~$Pointer$_#ptr.offset| (_ bv8 32))) (.cse12 (not .cse1)) (.cse356 (not .cse47)) (.cse88 (bvadd |c_main_write~$Pointer$_#ptr.offset| (_ bv12 32))) (.cse239 (select |c_#length| |c_main_write~$Pointer$_#ptr.base|))) (and (or .cse0 .cse1 (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_prenex_70 (_ BitVec 32)) (v_prenex_71 (_ BitVec 32)) (v_prenex_67 (_ BitVec 32)) (v_prenex_68 (_ BitVec 32)) (v_prenex_69 (_ BitVec 32))) (let ((.cse4 (bvadd v_prenex_71 (_ bv8 32))) (.cse6 (bvadd v_prenex_67 v_prenex_71)) (.cse2 (bvadd v_prenex_71 (_ bv4 32))) (.cse3 (store |c_#length| v_prenex_69 v_prenex_68)) (.cse5 (bvadd v_prenex_71 (_ bv12 32))) (.cse7 (select |c_#length| v_arrayElimCell_32))) (or (bvsle .cse2 (select .cse3 v_arrayElimCell_32)) (not (bvsle .cse4 .cse5)) (not (bvsle .cse6 .cse7)) (not (= (select |c_#valid| v_prenex_69) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse4)) (not (bvsle v_prenex_71 .cse6)) (bvsle .cse2 (select .cse3 v_prenex_70)) (not (bvsle .cse5 .cse7)) (= v_arrayElimCell_32 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_71)))))) (or .cse0 .cse1 (forall ((v_prenex_63 (_ BitVec 32)) (v_prenex_64 (_ BitVec 32)) (v_prenex_65 (_ BitVec 32)) (v_prenex_66 (_ BitVec 32)) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse8 (bvadd v_prenex_63 v_prenex_66)) (.cse10 (select |c_#length| v_arrayElimCell_176)) (.cse9 (bvadd v_prenex_66 (_ bv8 32))) (.cse11 (bvadd v_prenex_66 (_ bv12 32)))) (or (not (= (select |c_#valid| v_prenex_65) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_66)) (not (bvsle v_prenex_66 .cse8)) (not (bvsle (_ bv0 32) .cse9)) (bvsle (bvadd v_prenex_66 (_ bv4 32)) (select (store |c_#length| v_prenex_65 v_prenex_64) v_arrayElimCell_176)) (not (bvsle .cse8 .cse10)) (not (bvsle .cse11 .cse10)) (not (bvsle .cse9 .cse11)))))) (or .cse0 .cse12 (forall ((v_arrayElimCell_205 (_ BitVec 32)) (v_prenex_113 (_ BitVec 32)) (v_prenex_112 (_ BitVec 32)) (v_prenex_111 (_ BitVec 32)) (v_prenex_110 (_ BitVec 32))) (let ((.cse15 (bvadd v_prenex_112 (_ bv8 32))) (.cse13 (bvadd v_prenex_110 v_prenex_112)) (.cse16 (bvadd v_prenex_112 (_ bv12 32))) (.cse14 (select |c_#length| v_arrayElimCell_205))) (or (not (bvsle .cse13 .cse14)) (not (bvsle .cse15 .cse16)) (not (bvsle (_ bv0 32) .cse15)) (not (bvsle (_ bv0 32) v_prenex_112)) (not (= (select |c_#valid| v_prenex_111) (_ bv0 1))) (bvsle (bvadd v_prenex_112 (_ bv4 32)) (select (store |c_#length| v_prenex_111 v_prenex_113) v_arrayElimCell_205)) (not (bvsle v_prenex_112 .cse13)) (not (bvsle .cse16 .cse14)) (= v_arrayElimCell_205 c_main_~x~0.base))))) (or (forall ((v_prenex_319 (_ BitVec 32)) (v_prenex_318 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_prenex_322 (_ BitVec 32)) (v_prenex_321 (_ BitVec 32)) (v_prenex_320 (_ BitVec 32))) (let ((.cse17 (bvadd v_prenex_322 v_prenex_320)) (.cse20 (bvadd v_prenex_320 (_ bv12 32))) (.cse18 (select |c_#length| v_arrayElimCell_182)) (.cse19 (bvadd v_prenex_320 (_ bv8 32))) (.cse21 (bvadd v_prenex_320 (_ bv4 32))) (.cse22 (store |c_#length| v_prenex_318 v_prenex_321))) (or (not (bvsle .cse17 .cse18)) (not (bvsle .cse19 .cse20)) (not (= (select |c_#valid| v_prenex_318) (_ bv0 1))) (bvsle .cse21 (select .cse22 v_arrayElimCell_182)) (= v_arrayElimCell_182 c_main_~x~0.base) (not (bvsle v_prenex_320 .cse17)) (not (bvsle .cse20 .cse18)) (not (bvsle (_ bv0 32) v_prenex_320)) (not (bvsle (_ bv0 32) .cse19)) (bvsle .cse21 (select .cse22 v_prenex_319))))) .cse1) (or (forall ((v_arrayElimCell_66 (_ BitVec 32)) (v_prenex_339 (_ BitVec 32)) (v_prenex_338 (_ BitVec 32)) (v_prenex_337 (_ BitVec 32)) (v_prenex_336 (_ BitVec 32))) (let ((.cse23 (bvadd v_prenex_339 v_prenex_337)) (.cse24 (select |c_#length| v_arrayElimCell_66)) (.cse25 (bvadd v_prenex_337 (_ bv8 32))) (.cse26 (bvadd v_prenex_337 (_ bv12 32)))) (or (not (bvsle v_prenex_337 .cse23)) (not (bvsle .cse23 .cse24)) (not (= (select |c_#valid| v_prenex_336) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_337)) (not (bvsle (_ bv0 32) .cse25)) (bvsle (bvadd v_prenex_337 (_ bv4 32)) (select (store |c_#length| v_prenex_336 v_prenex_338) v_arrayElimCell_66)) (not (bvsle .cse26 .cse24)) (not (bvsle .cse25 .cse26))))) .cse0 .cse1) (or .cse0 .cse1 (forall ((v_arrayElimCell_167 (_ BitVec 32)) (v_prenex_142 (_ BitVec 32)) (v_prenex_141 (_ BitVec 32)) (v_prenex_140 (_ BitVec 32)) (v_prenex_144 (_ BitVec 32)) (v_prenex_143 (_ BitVec 32))) (let ((.cse30 (bvadd v_prenex_143 (_ bv12 32))) (.cse28 (select |c_#length| v_arrayElimCell_167)) (.cse27 (bvadd v_prenex_141 v_prenex_143)) (.cse29 (bvadd v_prenex_143 (_ bv8 32))) (.cse31 (bvadd v_prenex_143 (_ bv4 32))) (.cse32 (store |c_#length| v_prenex_140 v_prenex_144))) (or (not (bvsle .cse27 .cse28)) (not (bvsle .cse29 .cse30)) (bvsle .cse31 (select .cse32 v_arrayElimCell_167)) (not (bvsle .cse30 .cse28)) (not (bvsle v_prenex_143 .cse27)) (not (bvsle (_ bv0 32) .cse29)) (not (bvsle (_ bv0 32) v_prenex_143)) (not (= (select |c_#valid| v_prenex_140) (_ bv0 1))) (bvsle .cse31 (select .cse32 v_prenex_142)))))) (or .cse0 .cse12 (forall ((v_arrayElimCell_207 (_ BitVec 32)) (v_prenex_256 (_ BitVec 32)) (v_prenex_255 (_ BitVec 32)) (v_prenex_254 (_ BitVec 32)) (v_prenex_253 (_ BitVec 32))) (let ((.cse35 (bvadd v_prenex_254 (_ bv12 32))) (.cse33 (bvadd v_prenex_256 v_prenex_254)) (.cse36 (select |c_#length| v_arrayElimCell_207)) (.cse34 (bvadd v_prenex_254 (_ bv8 32)))) (or (not (bvsle v_prenex_254 .cse33)) (not (bvsle (_ bv0 32) v_prenex_254)) (not (bvsle .cse34 .cse35)) (not (= (select |c_#valid| v_prenex_253) (_ bv0 1))) (not (bvsle .cse35 .cse36)) (bvsle (bvadd v_prenex_254 (_ bv4 32)) (select (store |c_#length| v_prenex_253 v_prenex_255) v_arrayElimCell_207)) (not (bvsle .cse33 .cse36)) (not (bvsle (_ bv0 32) .cse34)))))) (or (forall ((v_arrayElimCell_201 (_ BitVec 32)) (v_prenex_219 (_ BitVec 32)) (v_prenex_218 (_ BitVec 32)) (v_prenex_217 (_ BitVec 32)) (v_prenex_216 (_ BitVec 32)) (v_prenex_220 (_ BitVec 32))) (let ((.cse38 (bvadd v_prenex_218 (_ bv4 32))) (.cse39 (store |c_#length| v_prenex_216 v_prenex_219)) (.cse37 (bvadd v_prenex_220 v_prenex_218)) (.cse41 (select |c_#length| v_arrayElimCell_201)) (.cse42 (bvadd v_prenex_218 (_ bv8 32))) (.cse40 (bvadd v_prenex_218 (_ bv12 32)))) (or (not (bvsle v_prenex_218 .cse37)) (bvsle .cse38 (select .cse39 v_arrayElimCell_201)) (= v_arrayElimCell_201 c_main_~x~0.base) (bvsle .cse38 (select .cse39 v_prenex_217)) (not (bvsle (_ bv0 32) v_prenex_218)) (not (bvsle .cse40 .cse41)) (not (bvsle .cse37 .cse41)) (not (= (select |c_#valid| v_prenex_216) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse42)) (not (bvsle .cse42 .cse40))))) .cse1) (or .cse0 .cse1 (forall ((v_prenex_274 (_ BitVec 32)) (v_arrayElimCell_102 (_ BitVec 32)) (v_prenex_277 (_ BitVec 32)) (v_prenex_276 (_ BitVec 32)) (v_prenex_275 (_ BitVec 32))) (let ((.cse44 (bvadd v_prenex_275 (_ bv12 32))) (.cse43 (bvadd v_prenex_275 (_ bv8 32))) (.cse45 (bvadd v_prenex_277 v_prenex_275)) (.cse46 (select |c_#length| v_arrayElimCell_102))) (or (not (bvsle .cse43 .cse44)) (not (bvsle v_prenex_275 .cse45)) (not (bvsle .cse44 .cse46)) (bvsle (bvadd v_prenex_275 (_ bv4 32)) (select (store |c_#length| v_prenex_274 v_prenex_276) v_arrayElimCell_102)) (not (bvsle (_ bv0 32) .cse43)) (not (= (select |c_#valid| v_prenex_274) (_ bv0 1))) (not (bvsle .cse45 .cse46)) (not (bvsle (_ bv0 32) v_prenex_275)))))) (or .cse47 .cse0 .cse1 (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_prenex_296 (_ BitVec 32)) (v_prenex_295 (_ BitVec 32)) (v_prenex_294 (_ BitVec 32)) (v_prenex_293 (_ BitVec 32)) (v_prenex_292 (_ BitVec 32))) (let ((.cse51 (select |c_#length| v_arrayElimCell_46)) (.cse50 (bvadd v_prenex_294 (_ bv12 32))) (.cse52 (bvadd v_prenex_296 v_prenex_294)) (.cse53 (bvadd v_prenex_294 (_ bv8 32))) (.cse48 (bvadd v_prenex_294 (_ bv4 32))) (.cse49 (store |c_#length| v_prenex_292 v_prenex_295))) (or (not (= (select |c_#valid| v_prenex_292) (_ bv0 1))) (bvsle .cse48 (select .cse49 v_arrayElimCell_46)) (not (bvsle (_ bv0 32) v_prenex_294)) (not (bvsle .cse50 .cse51)) (not (bvsle .cse52 .cse51)) (= v_arrayElimCell_46 c_main_~x~0.base) (not (bvsle .cse53 .cse50)) (not (bvsle v_prenex_294 .cse52)) (not (bvsle (_ bv0 32) .cse53)) (bvsle .cse48 (select .cse49 v_prenex_293)))))) (or .cse47 (forall ((v_prenex_370 (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_369 (_ BitVec 32)) (v_prenex_368 (_ BitVec 32)) (v_prenex_367 (_ BitVec 32))) (let ((.cse55 (bvadd v_prenex_369 (_ bv8 32))) (.cse54 (bvadd v_prenex_370 v_prenex_369)) (.cse56 (bvadd v_prenex_369 (_ bv12 32))) (.cse57 (select |c_#length| v_prenex_16))) (or (not (= (select |c_#valid| v_prenex_368) (_ bv0 1))) (= v_prenex_16 c_main_~x~0.base) (not (bvsle v_prenex_369 .cse54)) (not (bvsle .cse55 .cse56)) (bvsle (bvadd v_prenex_369 (_ bv4 32)) (select (store |c_#length| v_prenex_368 v_prenex_367) v_prenex_16)) (not (bvsle (_ bv0 32) .cse55)) (not (bvsle (_ bv0 32) v_prenex_369)) (not (bvsle .cse54 .cse57)) (not (bvsle .cse56 .cse57))))) .cse0 .cse1) (or (forall ((v_prenex_209 (_ BitVec 32)) (v_prenex_208 (_ BitVec 32)) (v_prenex_207 (_ BitVec 32)) (v_arrayElimCell_195 (_ BitVec 32)) (v_prenex_210 (_ BitVec 32))) (let ((.cse58 (bvadd v_prenex_210 v_prenex_208)) (.cse60 (select |c_#length| v_arrayElimCell_195)) (.cse59 (bvadd v_prenex_208 (_ bv8 32))) (.cse61 (bvadd v_prenex_208 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_208)) (not (bvsle v_prenex_208 .cse58)) (= v_arrayElimCell_195 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse59)) (not (bvsle .cse58 .cse60)) (bvsle (bvadd v_prenex_208 (_ bv4 32)) (select (store |c_#length| v_prenex_207 v_prenex_209) v_arrayElimCell_195)) (not (= (select |c_#valid| v_prenex_207) (_ bv0 1))) (not (bvsle .cse61 .cse60)) (not (bvsle .cse59 .cse61))))) .cse1) (or .cse0 .cse1 (forall ((v_prenex_84 (_ BitVec 32)) (v_prenex_85 (_ BitVec 32)) (v_arrayElimCell_49 (_ BitVec 32)) (v_prenex_82 (_ BitVec 32)) (v_prenex_83 (_ BitVec 32))) (let ((.cse64 (bvadd v_prenex_82 v_prenex_84)) (.cse63 (select |c_#length| v_arrayElimCell_49)) (.cse65 (bvadd v_prenex_84 (_ bv8 32))) (.cse62 (bvadd v_prenex_84 (_ bv12 32)))) (or (not (bvsle .cse62 .cse63)) (not (bvsle v_prenex_84 .cse64)) (not (bvsle .cse64 .cse63)) (= v_arrayElimCell_49 c_main_~x~0.base) (bvsle (bvadd v_prenex_84 (_ bv4 32)) (select (store |c_#length| v_prenex_83 v_prenex_85) v_arrayElimCell_49)) (not (bvsle (_ bv0 32) v_prenex_84)) (not (bvsle (_ bv0 32) .cse65)) (not (bvsle .cse65 .cse62)) (not (= (select |c_#valid| v_prenex_83) (_ bv0 1))))))) (= (bvadd (select |c_#valid| |c_main_write~$Pointer$_#value.base|) (_ bv1 1)) (_ bv0 1)) (or .cse1 (forall ((v_arrayElimCell_192 (_ BitVec 32)) (v_prenex_402 (_ BitVec 32)) (v_prenex_401 (_ BitVec 32)) (v_prenex_400 (_ BitVec 32)) (v_prenex_399 (_ BitVec 32))) (let ((.cse67 (bvadd v_prenex_401 (_ bv12 32))) (.cse69 (bvadd v_prenex_402 v_prenex_401)) (.cse68 (select |c_#length| v_arrayElimCell_192)) (.cse66 (bvadd v_prenex_401 (_ bv8 32)))) (or (not (bvsle .cse66 .cse67)) (not (bvsle (_ bv0 32) v_prenex_401)) (not (bvsle .cse67 .cse68)) (not (bvsle v_prenex_401 .cse69)) (bvsle (bvadd v_prenex_401 (_ bv4 32)) (select (store |c_#length| v_prenex_400 v_prenex_399) v_arrayElimCell_192)) (not (bvsle .cse69 .cse68)) (not (= (select |c_#valid| v_prenex_400) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse66)))))) (or .cse47 .cse1 (forall ((v_prenex_86 (_ BitVec 32)) (v_prenex_87 (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_88 (_ BitVec 32)) (v_prenex_23 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (let ((.cse70 (bvadd v_prenex_86 v_prenex_89)) (.cse72 (bvadd v_prenex_89 (_ bv4 32))) (.cse73 (store |c_#length| v_prenex_87 v_prenex_90)) (.cse74 (bvadd v_prenex_89 (_ bv8 32))) (.cse75 (bvadd v_prenex_89 (_ bv12 32))) (.cse71 (select |c_#length| v_prenex_23))) (or (not (bvsle .cse70 .cse71)) (= v_prenex_23 c_main_~x~0.base) (bvsle .cse72 (select .cse73 v_prenex_23)) (not (bvsle .cse74 .cse75)) (not (bvsle v_prenex_89 .cse70)) (bvsle .cse72 (select .cse73 v_prenex_88)) (not (bvsle (_ bv0 32) v_prenex_89)) (not (bvsle (_ bv0 32) .cse74)) (not (bvsle .cse75 .cse71)) (not (= (select |c_#valid| v_prenex_87) (_ bv0 1))))))) (or .cse47 .cse12 (forall ((v_prenex_268 (_ BitVec 32)) (v_prenex_267 (_ BitVec 32)) (v_prenex_266 (_ BitVec 32)) (v_prenex_265 (_ BitVec 32))) (let ((.cse78 (bvadd v_prenex_266 (_ bv8 32))) (.cse76 (bvadd v_prenex_266 (_ bv12 32))) (.cse79 (bvadd v_prenex_268 v_prenex_266)) (.cse77 (select |c_#length| |c_main_write~$Pointer$_#value.base|))) (or (not (bvsle .cse76 .cse77)) (not (= (select |c_#valid| v_prenex_265) (_ bv0 1))) (bvsle (bvadd v_prenex_266 (_ bv4 32)) (select (store |c_#length| v_prenex_265 v_prenex_267) |c_main_write~$Pointer$_#value.base|)) (not (bvsle (_ bv0 32) .cse78)) (not (bvsle (_ bv0 32) v_prenex_266)) (not (bvsle v_prenex_266 .cse79)) (not (bvsle .cse78 .cse76)) (not (bvsle .cse79 .cse77))))) .cse80) (or .cse0 .cse1 (forall ((v_prenex_273 (_ BitVec 32)) (v_prenex_272 (_ BitVec 32)) (v_prenex_271 (_ BitVec 32)) (v_prenex_270 (_ BitVec 32)) (v_prenex_269 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse81 (bvadd v_prenex_271 (_ bv12 32))) (.cse84 (bvadd v_prenex_271 (_ bv4 32))) (.cse85 (store |c_#length| v_prenex_269 v_prenex_272)) (.cse86 (bvadd v_prenex_271 (_ bv8 32))) (.cse83 (bvadd v_prenex_273 v_prenex_271)) (.cse82 (select |c_#length| v_prenex_11))) (or (not (bvsle .cse81 .cse82)) (not (= (select |c_#valid| v_prenex_269) (_ bv0 1))) (= v_prenex_11 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_271)) (not (bvsle v_prenex_271 .cse83)) (bvsle .cse84 (select .cse85 v_prenex_11)) (not (bvsle .cse86 .cse81)) (bvsle .cse84 (select .cse85 v_prenex_270)) (not (bvsle (_ bv0 32) .cse86)) (not (bvsle .cse83 .cse82)))))) (bvsle .cse87 .cse88) (or .cse47 .cse0 .cse1 (forall ((v_prenex_15 (_ BitVec 32)) (v_prenex_126 (_ BitVec 32)) (v_prenex_125 (_ BitVec 32)) (v_prenex_124 (_ BitVec 32)) (v_prenex_123 (_ BitVec 32))) (let ((.cse89 (bvadd v_prenex_124 v_prenex_125)) (.cse90 (select |c_#length| v_prenex_15)) (.cse92 (bvadd v_prenex_125 (_ bv8 32))) (.cse91 (bvadd v_prenex_125 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_125)) (bvsle (bvadd v_prenex_125 (_ bv4 32)) (select (store |c_#length| v_prenex_123 v_prenex_126) v_prenex_15)) (not (bvsle v_prenex_125 .cse89)) (not (bvsle .cse89 .cse90)) (not (= (select |c_#valid| v_prenex_123) (_ bv0 1))) (not (bvsle .cse91 .cse90)) (not (bvsle (_ bv0 32) .cse92)) (not (bvsle .cse92 .cse91)))))) (or (forall ((v_prenex_30 (_ BitVec 32)) (v_prenex_313 (_ BitVec 32)) (v_prenex_312 (_ BitVec 32)) (v_prenex_311 (_ BitVec 32)) (v_prenex_310 (_ BitVec 32))) (let ((.cse93 (bvadd v_prenex_313 v_prenex_311)) (.cse94 (select |c_#length| v_prenex_30)) (.cse95 (bvadd v_prenex_311 (_ bv8 32))) (.cse96 (bvadd v_prenex_311 (_ bv12 32)))) (or (= v_prenex_30 c_main_~x~0.base) (not (bvsle .cse93 .cse94)) (not (bvsle v_prenex_311 .cse93)) (not (= (select |c_#valid| v_prenex_310) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse95)) (not (bvsle (_ bv0 32) v_prenex_311)) (not (bvsle .cse96 .cse94)) (bvsle (bvadd v_prenex_311 (_ bv4 32)) (select (store |c_#length| v_prenex_310 v_prenex_312) v_prenex_30)) (not (bvsle .cse95 .cse96))))) .cse1) (or .cse0 (forall ((v_arrayElimCell_117 (_ BitVec 32)) (v_prenex_326 (_ BitVec 32)) (v_prenex_325 (_ BitVec 32)) (v_prenex_324 (_ BitVec 32)) (v_prenex_323 (_ BitVec 32))) (let ((.cse97 (bvadd v_prenex_324 (_ bv8 32))) (.cse100 (bvadd v_prenex_324 (_ bv12 32))) (.cse99 (select |c_#length| v_arrayElimCell_117)) (.cse98 (bvadd v_prenex_326 v_prenex_324))) (or (not (bvsle (_ bv0 32) .cse97)) (not (bvsle (_ bv0 32) v_prenex_324)) (not (bvsle .cse98 .cse99)) (bvsle (bvadd v_prenex_324 (_ bv4 32)) (select (store |c_#length| v_prenex_323 v_prenex_325) v_arrayElimCell_117)) (not (= (select |c_#valid| v_prenex_323) (_ bv0 1))) (not (bvsle .cse97 .cse100)) (not (bvsle .cse100 .cse99)) (not (bvsle v_prenex_324 .cse98))))) .cse1) (bvsle (_ bv0 32) |c_main_write~$Pointer$_#ptr.offset|) (or .cse47 (forall ((v_prenex_51 (_ BitVec 32)) (v_prenex_52 (_ BitVec 32)) (v_prenex_50 (_ BitVec 32)) (v_prenex_49 (_ BitVec 32)) (v_prenex_33 (_ BitVec 32))) (let ((.cse102 (select |c_#length| v_prenex_33)) (.cse103 (bvadd v_prenex_49 v_prenex_52)) (.cse104 (bvadd v_prenex_52 (_ bv8 32))) (.cse101 (bvadd v_prenex_52 (_ bv12 32)))) (or (not (bvsle .cse101 .cse102)) (= v_prenex_33 c_main_~x~0.base) (not (bvsle .cse103 .cse102)) (not (bvsle v_prenex_52 .cse103)) (not (bvsle (_ bv0 32) .cse104)) (bvsle (bvadd v_prenex_52 (_ bv4 32)) (select (store |c_#length| v_prenex_50 v_prenex_51) v_prenex_33)) (not (= (select |c_#valid| v_prenex_50) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_52)) (not (bvsle .cse104 .cse101))))) .cse1) (or (forall ((v_prenex_393 (_ BitVec 32)) (v_prenex_392 (_ BitVec 32)) (v_prenex_391 (_ BitVec 32)) (v_prenex_390 (_ BitVec 32)) (v_prenex_389 (_ BitVec 32)) (v_arrayElimCell_130 (_ BitVec 32))) (let ((.cse109 (bvadd v_prenex_392 (_ bv4 32))) (.cse110 (store |c_#length| v_prenex_391 v_prenex_390)) (.cse106 (bvadd v_prenex_393 v_prenex_392)) (.cse108 (select |c_#length| v_arrayElimCell_130)) (.cse105 (bvadd v_prenex_392 (_ bv8 32))) (.cse107 (bvadd v_prenex_392 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) .cse105)) (not (bvsle v_prenex_392 .cse106)) (not (bvsle .cse107 .cse108)) (not (= (select |c_#valid| v_prenex_391) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_392)) (= v_arrayElimCell_130 c_main_~x~0.base) (bvsle .cse109 (select .cse110 v_arrayElimCell_130)) (bvsle .cse109 (select .cse110 v_prenex_389)) (not (bvsle .cse106 .cse108)) (not (bvsle .cse105 .cse107))))) .cse1) (or .cse0 (forall ((v_prenex_282 (_ BitVec 32)) (v_prenex_281 (_ BitVec 32)) (v_prenex_280 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_279 (_ BitVec 32)) (v_prenex_278 (_ BitVec 32))) (let ((.cse111 (bvadd v_prenex_280 (_ bv8 32))) (.cse113 (bvadd v_prenex_280 (_ bv12 32))) (.cse114 (bvadd v_prenex_280 (_ bv4 32))) (.cse115 (store |c_#length| v_prenex_278 v_prenex_281)) (.cse112 (bvadd v_prenex_282 v_prenex_280)) (.cse116 (select |c_#length| v_prenex_8))) (or (not (bvsle (_ bv0 32) .cse111)) (not (bvsle v_prenex_280 .cse112)) (not (bvsle .cse111 .cse113)) (not (bvsle (_ bv0 32) v_prenex_280)) (bvsle .cse114 (select .cse115 v_prenex_8)) (not (= (select |c_#valid| v_prenex_278) (_ bv0 1))) (not (bvsle .cse113 .cse116)) (bvsle .cse114 (select .cse115 v_prenex_279)) (not (bvsle .cse112 .cse116))))) .cse1) (or .cse1 (forall ((v_prenex_73 (_ BitVec 32)) (v_prenex_74 (_ BitVec 32)) (v_prenex_75 (_ BitVec 32)) (v_prenex_76 (_ BitVec 32)) (v_prenex_72 (_ BitVec 32)) (v_arrayElimCell_198 (_ BitVec 32))) (let ((.cse120 (select |c_#length| v_arrayElimCell_198)) (.cse119 (bvadd v_prenex_72 v_prenex_75)) (.cse121 (bvadd v_prenex_75 (_ bv12 32))) (.cse122 (bvadd v_prenex_75 (_ bv8 32))) (.cse117 (bvadd v_prenex_75 (_ bv4 32))) (.cse118 (store |c_#length| v_prenex_73 v_prenex_76))) (or (bvsle .cse117 (select .cse118 v_arrayElimCell_198)) (not (bvsle .cse119 .cse120)) (not (bvsle .cse121 .cse120)) (not (bvsle (_ bv0 32) v_prenex_75)) (not (bvsle v_prenex_75 .cse119)) (not (= (select |c_#valid| v_prenex_73) (_ bv0 1))) (not (bvsle .cse122 .cse121)) (not (bvsle (_ bv0 32) .cse122)) (bvsle .cse117 (select .cse118 v_prenex_74)))))) (= (_ bv1 1) (select |c_#valid| |c_main_write~$Pointer$_#ptr.base|)) (or .cse0 .cse1 (forall ((v_prenex_135 (_ BitVec 32)) (v_arrayElimCell_164 (_ BitVec 32)) (v_prenex_134 (_ BitVec 32)) (v_prenex_133 (_ BitVec 32)) (v_prenex_132 (_ BitVec 32))) (let ((.cse123 (bvadd v_prenex_134 (_ bv12 32))) (.cse126 (bvadd v_prenex_133 v_prenex_134)) (.cse124 (select |c_#length| v_arrayElimCell_164)) (.cse125 (bvadd v_prenex_134 (_ bv8 32)))) (or (not (bvsle .cse123 .cse124)) (= v_arrayElimCell_164 c_main_~x~0.base) (bvsle (bvadd v_prenex_134 (_ bv4 32)) (select (store |c_#length| v_prenex_132 v_prenex_135) v_arrayElimCell_164)) (not (bvsle (_ bv0 32) v_prenex_134)) (not (bvsle .cse125 .cse123)) (not (= (select |c_#valid| v_prenex_132) (_ bv0 1))) (not (bvsle v_prenex_134 .cse126)) (not (bvsle .cse126 .cse124)) (not (bvsle (_ bv0 32) .cse125)))))) (or .cse0 .cse1 (forall ((v_prenex_395 (_ BitVec 32)) (v_prenex_394 (_ BitVec 32)) (v_arrayElimCell_99 (_ BitVec 32)) (v_prenex_398 (_ BitVec 32)) (v_prenex_397 (_ BitVec 32)) (v_prenex_396 (_ BitVec 32))) (let ((.cse129 (bvadd v_prenex_397 (_ bv12 32))) (.cse128 (bvadd v_prenex_397 (_ bv8 32))) (.cse127 (bvadd v_prenex_398 v_prenex_397)) (.cse130 (select |c_#length| v_arrayElimCell_99)) (.cse131 (bvadd v_prenex_397 (_ bv4 32))) (.cse132 (store |c_#length| v_prenex_396 v_prenex_395))) (or (not (= (select |c_#valid| v_prenex_396) (_ bv0 1))) (not (bvsle v_prenex_397 .cse127)) (= v_arrayElimCell_99 c_main_~x~0.base) (not (bvsle .cse128 .cse129)) (not (bvsle .cse129 .cse130)) (bvsle .cse131 (select .cse132 v_arrayElimCell_99)) (not (bvsle (_ bv0 32) v_prenex_397)) (not (bvsle (_ bv0 32) .cse128)) (not (bvsle .cse127 .cse130)) (bvsle .cse131 (select .cse132 v_prenex_394)))))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_prenex_329 (_ BitVec 32)) (v_prenex_328 (_ BitVec 32)) (v_prenex_327 (_ BitVec 32)) (v_prenex_331 (_ BitVec 32)) (v_prenex_330 (_ BitVec 32))) (let ((.cse133 (bvadd v_prenex_329 (_ bv8 32))) (.cse134 (bvadd v_prenex_329 (_ bv12 32))) (.cse136 (bvadd v_prenex_329 (_ bv4 32))) (.cse137 (store |c_#length| v_prenex_327 v_prenex_330)) (.cse138 (bvadd v_prenex_331 v_prenex_329)) (.cse135 (select |c_#length| v_arrayElimCell_38))) (or (not (bvsle .cse133 .cse134)) (not (bvsle (_ bv0 32) .cse133)) (not (bvsle .cse134 .cse135)) (bvsle .cse136 (select .cse137 v_prenex_328)) (not (bvsle (_ bv0 32) v_prenex_329)) (bvsle .cse136 (select .cse137 v_arrayElimCell_38)) (not (bvsle v_prenex_329 .cse138)) (not (= (select |c_#valid| v_prenex_327) (_ bv0 1))) (not (bvsle .cse138 .cse135))))) .cse0 .cse1) (or .cse1 (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_prenex_148 (_ BitVec 32)) (v_prenex_147 (_ BitVec 32)) (v_prenex_146 (_ BitVec 32)) (v_prenex_145 (_ BitVec 32))) (let ((.cse139 (bvadd v_prenex_147 (_ bv12 32))) (.cse141 (bvadd v_prenex_146 v_prenex_147)) (.cse140 (select |c_#length| v_arrayElimCell_139)) (.cse142 (bvadd v_prenex_147 (_ bv8 32)))) (or (not (bvsle .cse139 .cse140)) (not (= (select |c_#valid| v_prenex_145) (_ bv0 1))) (not (bvsle v_prenex_147 .cse141)) (= v_arrayElimCell_139 c_main_~x~0.base) (not (bvsle .cse142 .cse139)) (not (bvsle (_ bv0 32) v_prenex_147)) (not (bvsle .cse141 .cse140)) (bvsle (bvadd v_prenex_147 (_ bv4 32)) (select (store |c_#length| v_prenex_145 v_prenex_148) v_arrayElimCell_139)) (not (bvsle (_ bv0 32) .cse142)))))) (or (forall ((v_arrayElimCell_145 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (|main_write~$Pointer$_#sizeOfWrittenType| (_ BitVec 32)) (|v_main_#Ultimate.alloc_~size_4| (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (|v_main_write~$Pointer$_#ptr.offset_35| (_ BitVec 32))) (let ((.cse145 (bvadd |main_write~$Pointer$_#sizeOfWrittenType| |v_main_write~$Pointer$_#ptr.offset_35|)) (.cse143 (bvadd |v_main_write~$Pointer$_#ptr.offset_35| (_ bv4 32))) (.cse144 (store |c_#length| v_prenex_2 |v_main_#Ultimate.alloc_~size_4|)) (.cse147 (bvadd |v_main_write~$Pointer$_#ptr.offset_35| (_ bv8 32))) (.cse148 (bvadd |v_main_write~$Pointer$_#ptr.offset_35| (_ bv12 32))) (.cse146 (select |c_#length| v_arrayElimCell_145))) (or (bvsle .cse143 (select .cse144 v_arrayElimCell_145)) (not (= (select |c_#valid| v_prenex_2) (_ bv0 1))) (not (bvsle .cse145 .cse146)) (not (bvsle (_ bv0 32) .cse147)) (not (bvsle |v_main_write~$Pointer$_#ptr.offset_35| .cse145)) (bvsle .cse143 (select .cse144 v_subst_2)) (= v_arrayElimCell_145 c_main_~x~0.base) (not (bvsle .cse147 .cse148)) (not (bvsle .cse148 .cse146)) (not (bvsle (_ bv0 32) |v_main_write~$Pointer$_#ptr.offset_35|))))) .cse1) (or .cse0 .cse1 (forall ((v_prenex_131 (_ BitVec 32)) (v_prenex_130 (_ BitVec 32)) (v_prenex_129 (_ BitVec 32)) (v_prenex_128 (_ BitVec 32)) (v_prenex_127 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse150 (bvadd v_prenex_130 (_ bv12 32))) (.cse154 (select |c_#length| v_arrayElimCell_122)) (.cse149 (bvadd v_prenex_130 (_ bv8 32))) (.cse151 (bvadd v_prenex_130 (_ bv4 32))) (.cse152 (store |c_#length| v_prenex_127 v_prenex_131)) (.cse153 (bvadd v_prenex_128 v_prenex_130))) (or (not (bvsle .cse149 .cse150)) (bvsle .cse151 (select .cse152 v_prenex_129)) (= v_arrayElimCell_122 c_main_~x~0.base) (not (bvsle .cse153 .cse154)) (not (bvsle .cse150 .cse154)) (not (bvsle (_ bv0 32) .cse149)) (not (bvsle (_ bv0 32) v_prenex_130)) (bvsle .cse151 (select .cse152 v_arrayElimCell_122)) (not (= (select |c_#valid| v_prenex_127) (_ bv0 1))) (not (bvsle v_prenex_130 .cse153)))))) (or .cse1 (forall ((v_prenex_40 (_ BitVec 32)) (v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32)) (v_arrayElimCell_150 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse157 (bvadd v_prenex_44 (_ bv4 32))) (.cse158 (store |c_#length| v_prenex_41 v_prenex_43)) (.cse160 (bvadd v_prenex_44 (_ bv8 32))) (.cse155 (bvadd v_prenex_44 (_ bv12 32))) (.cse159 (bvadd v_prenex_40 v_prenex_44)) (.cse156 (select |c_#length| v_arrayElimCell_150))) (or (not (bvsle .cse155 .cse156)) (bvsle .cse157 (select .cse158 v_prenex_42)) (not (= (select |c_#valid| v_prenex_41) (_ bv0 1))) (not (bvsle v_prenex_44 .cse159)) (= v_arrayElimCell_150 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse160)) (bvsle .cse157 (select .cse158 v_arrayElimCell_150)) (not (bvsle .cse160 .cse155)) (not (bvsle .cse159 .cse156)) (not (bvsle (_ bv0 32) v_prenex_44)))))) (or .cse0 (forall ((v_prenex_161 (_ BitVec 32)) (v_prenex_160 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32)) (v_prenex_159 (_ BitVec 32)) (v_prenex_158 (_ BitVec 32))) (let ((.cse163 (bvadd v_prenex_159 v_prenex_160)) (.cse161 (bvadd v_prenex_160 (_ bv8 32))) (.cse162 (bvadd v_prenex_160 (_ bv12 32))) (.cse164 (select |c_#length| v_arrayElimCell_118))) (or (not (= (select |c_#valid| v_prenex_158) (_ bv0 1))) (not (bvsle .cse161 .cse162)) (not (bvsle v_prenex_160 .cse163)) (not (bvsle .cse163 .cse164)) (not (bvsle (_ bv0 32) .cse161)) (not (bvsle .cse162 .cse164)) (bvsle (bvadd v_prenex_160 (_ bv4 32)) (select (store |c_#length| v_prenex_158 v_prenex_161) v_arrayElimCell_118)) (not (bvsle (_ bv0 32) v_prenex_160)))))) (or .cse0 (forall ((v_prenex_362 (_ BitVec 32)) (v_prenex_366 (_ BitVec 32)) (v_prenex_365 (_ BitVec 32)) (v_prenex_364 (_ BitVec 32)) (v_arrayElimCell_121 (_ BitVec 32)) (v_prenex_363 (_ BitVec 32))) (let ((.cse165 (bvadd v_prenex_365 (_ bv4 32))) (.cse166 (store |c_#length| v_prenex_364 v_prenex_363)) (.cse168 (select |c_#length| v_arrayElimCell_121)) (.cse169 (bvadd v_prenex_366 v_prenex_365)) (.cse167 (bvadd v_prenex_365 (_ bv12 32))) (.cse170 (bvadd v_prenex_365 (_ bv8 32)))) (or (= v_arrayElimCell_121 c_main_~x~0.base) (bvsle .cse165 (select .cse166 v_prenex_362)) (not (bvsle (_ bv0 32) v_prenex_365)) (bvsle .cse165 (select .cse166 v_arrayElimCell_121)) (not (= (select |c_#valid| v_prenex_364) (_ bv0 1))) (not (bvsle .cse167 .cse168)) (not (bvsle .cse169 .cse168)) (not (bvsle v_prenex_365 .cse169)) (not (bvsle .cse170 .cse167)) (not (bvsle (_ bv0 32) .cse170)))))) (or (forall ((v_prenex_206 (_ BitVec 32)) (v_prenex_205 (_ BitVec 32)) (v_prenex_204 (_ BitVec 32)) (v_prenex_203 (_ BitVec 32)) (v_arrayElimCell_142 (_ BitVec 32))) (let ((.cse173 (bvadd v_prenex_206 v_prenex_204)) (.cse171 (bvadd v_prenex_204 (_ bv8 32))) (.cse172 (bvadd v_prenex_204 (_ bv12 32))) (.cse174 (select |c_#length| v_arrayElimCell_142))) (or (not (bvsle .cse171 .cse172)) (not (bvsle v_prenex_204 .cse173)) (not (bvsle (_ bv0 32) v_prenex_204)) (not (bvsle .cse173 .cse174)) (not (bvsle (_ bv0 32) .cse171)) (not (= (select |c_#valid| v_prenex_203) (_ bv0 1))) (not (bvsle .cse172 .cse174)) (bvsle (bvadd v_prenex_204 (_ bv4 32)) (select (store |c_#length| v_prenex_203 v_prenex_205) v_arrayElimCell_142))))) .cse1) (or .cse47 .cse0 (forall ((v_prenex_241 (_ BitVec 32)) (v_prenex_240 (_ BitVec 32)) (v_prenex_239 (_ BitVec 32)) (v_arrayElimCell_96 (_ BitVec 32)) (v_prenex_242 (_ BitVec 32))) (let ((.cse175 (bvadd v_prenex_242 v_prenex_240)) (.cse178 (bvadd v_prenex_240 (_ bv12 32))) (.cse176 (select |c_#length| v_arrayElimCell_96)) (.cse177 (bvadd v_prenex_240 (_ bv8 32)))) (or (not (bvsle .cse175 .cse176)) (not (bvsle (_ bv0 32) v_prenex_240)) (= v_arrayElimCell_96 c_main_~x~0.base) (not (bvsle v_prenex_240 .cse175)) (not (bvsle .cse177 .cse178)) (not (bvsle .cse178 .cse176)) (bvsle (bvadd v_prenex_240 (_ bv4 32)) (select (store |c_#length| v_prenex_239 v_prenex_241) v_arrayElimCell_96)) (not (bvsle (_ bv0 32) .cse177)) (not (= (select |c_#valid| v_prenex_239) (_ bv0 1)))))) .cse1) (or .cse0 .cse1 (forall ((v_arrayElimCell_211 (_ BitVec 32)) (v_prenex_351 (_ BitVec 32)) (v_prenex_350 (_ BitVec 32)) (v_prenex_349 (_ BitVec 32)) (v_prenex_352 (_ BitVec 32))) (let ((.cse179 (bvadd v_prenex_351 (_ bv8 32))) (.cse180 (bvadd v_prenex_351 (_ bv12 32))) (.cse182 (bvadd v_prenex_352 v_prenex_351)) (.cse181 (select |c_#length| v_arrayElimCell_211))) (or (not (bvsle (_ bv0 32) .cse179)) (bvsle (bvadd v_prenex_351 (_ bv4 32)) (select (store |c_#length| v_prenex_350 v_prenex_349) v_arrayElimCell_211)) (not (bvsle .cse179 .cse180)) (not (bvsle .cse180 .cse181)) (not (bvsle v_prenex_351 .cse182)) (not (bvsle .cse182 .cse181)) (not (= (select |c_#valid| v_prenex_350) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_351)))))) (or .cse1 (forall ((v_prenex_252 (_ BitVec 32)) (v_prenex_251 (_ BitVec 32)) (v_prenex_250 (_ BitVec 32)) (v_prenex_249 (_ BitVec 32)) (v_prenex_248 (_ BitVec 32)) (v_prenex_34 (_ BitVec 32))) (let ((.cse185 (bvadd v_prenex_250 (_ bv4 32))) (.cse186 (store |c_#length| v_prenex_248 v_prenex_251)) (.cse187 (bvadd v_prenex_250 (_ bv8 32))) (.cse188 (bvadd v_prenex_250 (_ bv12 32))) (.cse184 (select |c_#length| v_prenex_34)) (.cse183 (bvadd v_prenex_252 v_prenex_250))) (or (not (bvsle .cse183 .cse184)) (bvsle .cse185 (select .cse186 v_prenex_34)) (= v_prenex_34 c_main_~x~0.base) (bvsle .cse185 (select .cse186 v_prenex_249)) (not (bvsle .cse187 .cse188)) (not (bvsle (_ bv0 32) .cse187)) (not (bvsle (_ bv0 32) v_prenex_250)) (not (bvsle .cse188 .cse184)) (not (bvsle v_prenex_250 .cse183)) (not (= (select |c_#valid| v_prenex_248) (_ bv0 1))))))) (or (forall ((v_prenex_171 (_ BitVec 32)) (v_prenex_170 (_ BitVec 32)) (v_prenex_169 (_ BitVec 32)) (v_arrayElimCell_173 (_ BitVec 32)) (v_prenex_168 (_ BitVec 32)) (v_prenex_167 (_ BitVec 32))) (let ((.cse192 (bvadd v_prenex_170 (_ bv8 32))) (.cse189 (bvadd v_prenex_170 (_ bv4 32))) (.cse190 (store |c_#length| v_prenex_167 v_prenex_171)) (.cse191 (bvadd v_prenex_168 v_prenex_170)) (.cse193 (bvadd v_prenex_170 (_ bv12 32))) (.cse194 (select |c_#length| v_arrayElimCell_173))) (or (bvsle .cse189 (select .cse190 v_prenex_169)) (not (bvsle v_prenex_170 .cse191)) (not (bvsle (_ bv0 32) v_prenex_170)) (not (bvsle .cse192 .cse193)) (not (bvsle (_ bv0 32) .cse192)) (bvsle .cse189 (select .cse190 v_arrayElimCell_173)) (not (bvsle .cse191 .cse194)) (not (= (select |c_#valid| v_prenex_167) (_ bv0 1))) (= v_arrayElimCell_173 c_main_~x~0.base) (not (bvsle .cse193 .cse194))))) .cse0 .cse1) (or .cse0 .cse1 (forall ((v_prenex_197 (_ BitVec 32)) (v_prenex_196 (_ BitVec 32)) (v_prenex_195 (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (v_prenex_198 (_ BitVec 32))) (let ((.cse195 (bvadd v_prenex_196 (_ bv8 32))) (.cse196 (bvadd v_prenex_196 (_ bv12 32))) (.cse198 (bvadd v_prenex_198 v_prenex_196)) (.cse197 (select |c_#length| v_prenex_10))) (or (not (bvsle (_ bv0 32) .cse195)) (not (bvsle (_ bv0 32) v_prenex_196)) (not (bvsle .cse196 .cse197)) (bvsle (bvadd v_prenex_196 (_ bv4 32)) (select (store |c_#length| v_prenex_195 v_prenex_197) v_prenex_10)) (not (= (select |c_#valid| v_prenex_195) (_ bv0 1))) (not (bvsle v_prenex_196 .cse198)) (= v_prenex_10 c_main_~x~0.base) (not (bvsle .cse195 .cse196)) (not (bvsle .cse198 .cse197)))))) (or .cse0 (forall ((v_prenex_96 (_ BitVec 32)) (v_prenex_97 (_ BitVec 32)) (v_prenex_98 (_ BitVec 32)) (v_arrayElimCell_216 (_ BitVec 32)) (v_prenex_99 (_ BitVec 32))) (let ((.cse201 (bvadd v_prenex_98 (_ bv8 32))) (.cse202 (bvadd v_prenex_98 (_ bv12 32))) (.cse200 (select |c_#length| v_arrayElimCell_216)) (.cse199 (bvadd v_prenex_96 v_prenex_98))) (or (not (= (select |c_#valid| v_prenex_97) (_ bv0 1))) (bvsle (bvadd v_prenex_98 (_ bv4 32)) (select (store |c_#length| v_prenex_97 v_prenex_99) v_arrayElimCell_216)) (not (bvsle (_ bv0 32) v_prenex_98)) (not (bvsle .cse199 .cse200)) (not (bvsle (_ bv0 32) .cse201)) (= v_arrayElimCell_216 c_main_~x~0.base) (not (bvsle .cse201 .cse202)) (not (bvsle .cse202 .cse200)) (not (bvsle v_prenex_98 .cse199))))) .cse1) (= (bvadd (select |c_#length| |c_main_write~$Pointer$_#value.base|) (_ bv4294967284 32)) (_ bv0 32)) (or .cse47 .cse0 .cse1 (forall ((v_prenex_9 (_ BitVec 32)) (v_prenex_247 (_ BitVec 32)) (v_prenex_246 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32)) (v_prenex_244 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (let ((.cse203 (bvadd v_prenex_247 v_prenex_245)) (.cse205 (select |c_#length| v_prenex_9)) (.cse206 (bvadd v_prenex_245 (_ bv8 32))) (.cse204 (bvadd v_prenex_245 (_ bv12 32))) (.cse207 (bvadd v_prenex_245 (_ bv4 32))) (.cse208 (store |c_#length| v_prenex_243 v_prenex_246))) (or (not (bvsle v_prenex_245 .cse203)) (not (bvsle .cse204 .cse205)) (not (= (select |c_#valid| v_prenex_243) (_ bv0 1))) (not (bvsle .cse203 .cse205)) (not (bvsle (_ bv0 32) .cse206)) (not (bvsle .cse206 .cse204)) (not (bvsle (_ bv0 32) v_prenex_245)) (bvsle .cse207 (select .cse208 v_prenex_9)) (= v_prenex_9 c_main_~x~0.base) (bvsle .cse207 (select .cse208 v_prenex_244)))))) (= (_ bv4 32) |c_main_write~$Pointer$_#sizeOfWrittenType|) (or .cse47 .cse0 (forall ((v_prenex_120 (_ BitVec 32)) (v_arrayElimCell_126 (_ BitVec 32)) (v_prenex_119 (_ BitVec 32)) (v_prenex_122 (_ BitVec 32)) (v_prenex_121 (_ BitVec 32))) (let ((.cse211 (bvadd v_prenex_120 v_prenex_121)) (.cse210 (select |c_#length| v_arrayElimCell_126)) (.cse212 (bvadd v_prenex_121 (_ bv8 32))) (.cse209 (bvadd v_prenex_121 (_ bv12 32)))) (or (bvsle (bvadd v_prenex_121 (_ bv4 32)) (select (store |c_#length| v_prenex_119 v_prenex_122) v_arrayElimCell_126)) (not (bvsle .cse209 .cse210)) (not (bvsle (_ bv0 32) v_prenex_121)) (not (bvsle v_prenex_121 .cse211)) (not (bvsle .cse211 .cse210)) (not (bvsle (_ bv0 32) .cse212)) (not (= (select |c_#valid| v_prenex_119) (_ bv0 1))) (= v_arrayElimCell_126 c_main_~x~0.base) (not (bvsle .cse212 .cse209)))))) (or .cse47 (forall ((v_prenex_309 (_ BitVec 32)) (v_prenex_308 (_ BitVec 32)) (v_prenex_307 (_ BitVec 32)) (v_prenex_306 (_ BitVec 32)) (v_prenex_305 (_ BitVec 32)) (v_prenex_29 (_ BitVec 32))) (let ((.cse213 (bvadd v_prenex_307 (_ bv8 32))) (.cse216 (bvadd v_prenex_307 (_ bv12 32))) (.cse218 (bvadd v_prenex_309 v_prenex_307)) (.cse217 (select |c_#length| v_prenex_29)) (.cse214 (bvadd v_prenex_307 (_ bv4 32))) (.cse215 (store |c_#length| v_prenex_305 v_prenex_308))) (or (not (bvsle (_ bv0 32) v_prenex_307)) (not (bvsle (_ bv0 32) .cse213)) (bvsle .cse214 (select .cse215 v_prenex_29)) (not (bvsle .cse213 .cse216)) (= v_prenex_29 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_305) (_ bv0 1))) (not (bvsle .cse216 .cse217)) (not (bvsle v_prenex_307 .cse218)) (not (bvsle .cse218 .cse217)) (bvsle .cse214 (select .cse215 v_prenex_306))))) .cse1) (or .cse0 .cse1 (forall ((v_arrayElimCell_219 (_ BitVec 32)) (v_prenex_48 (_ BitVec 32)) (v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32)) (v_prenex_47 (_ BitVec 32))) (let ((.cse219 (bvadd v_prenex_45 v_prenex_48)) (.cse221 (select |c_#length| v_arrayElimCell_219)) (.cse220 (bvadd v_prenex_48 (_ bv8 32))) (.cse222 (bvadd v_prenex_48 (_ bv12 32)))) (or (not (bvsle v_prenex_48 .cse219)) (not (= (select |c_#valid| v_prenex_46) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse220)) (not (bvsle (_ bv0 32) v_prenex_48)) (not (bvsle .cse219 .cse221)) (not (bvsle .cse222 .cse221)) (bvsle (bvadd v_prenex_48 (_ bv4 32)) (select (store |c_#length| v_prenex_46 v_prenex_47) v_arrayElimCell_219)) (not (bvsle .cse220 .cse222)))))) (or .cse0 .cse12 (forall ((v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_317 (_ BitVec 32)) (v_prenex_316 (_ BitVec 32)) (v_prenex_315 (_ BitVec 32)) (v_prenex_314 (_ BitVec 32))) (let ((.cse225 (select |c_#length| v_arrayElimCell_112)) (.cse223 (bvadd v_prenex_315 (_ bv8 32))) (.cse224 (bvadd v_prenex_315 (_ bv12 32))) (.cse226 (bvadd v_prenex_317 v_prenex_315))) (or (not (bvsle (_ bv0 32) .cse223)) (bvsle (bvadd v_prenex_315 (_ bv4 32)) (select (store |c_#length| v_prenex_314 v_prenex_316) v_arrayElimCell_112)) (not (= (select |c_#valid| v_prenex_314) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_315)) (not (bvsle .cse224 .cse225)) (not (bvsle .cse226 .cse225)) (not (bvsle .cse223 .cse224)) (not (bvsle v_prenex_315 .cse226)))))) (or .cse0 .cse1 (forall ((v_prenex_373 (_ BitVec 32)) (v_prenex_372 (_ BitVec 32)) (v_prenex_371 (_ BitVec 32)) (v_arrayElimCell_159 (_ BitVec 32)) (v_prenex_375 (_ BitVec 32)) (v_prenex_374 (_ BitVec 32))) (let ((.cse228 (select |c_#length| v_arrayElimCell_159)) (.cse231 (bvadd v_prenex_374 (_ bv8 32))) (.cse232 (bvadd v_prenex_374 (_ bv12 32))) (.cse227 (bvadd v_prenex_375 v_prenex_374)) (.cse229 (bvadd v_prenex_374 (_ bv4 32))) (.cse230 (store |c_#length| v_prenex_373 v_prenex_372))) (or (not (bvsle .cse227 .cse228)) (bvsle .cse229 (select .cse230 v_prenex_371)) (not (bvsle (_ bv0 32) .cse231)) (= v_arrayElimCell_159 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_373) (_ bv0 1))) (not (bvsle .cse232 .cse228)) (not (bvsle .cse231 .cse232)) (not (bvsle v_prenex_374 .cse227)) (not (bvsle (_ bv0 32) v_prenex_374)) (bvsle .cse229 (select .cse230 v_arrayElimCell_159)))))) (or .cse0 (forall ((v_prenex_80 (_ BitVec 32)) (v_prenex_81 (_ BitVec 32)) (v_arrayElimCell_77 (_ BitVec 32)) (v_prenex_77 (_ BitVec 32)) (v_prenex_78 (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (let ((.cse233 (bvadd v_prenex_80 (_ bv8 32))) (.cse235 (bvadd v_prenex_77 v_prenex_80)) (.cse237 (bvadd v_prenex_80 (_ bv4 32))) (.cse238 (store |c_#length| v_prenex_78 v_prenex_81)) (.cse234 (bvadd v_prenex_80 (_ bv12 32))) (.cse236 (select |c_#length| v_arrayElimCell_77))) (or (not (bvsle (_ bv0 32) v_prenex_80)) (not (= (select |c_#valid| v_prenex_78) (_ bv0 1))) (= v_arrayElimCell_77 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse233)) (not (bvsle .cse233 .cse234)) (not (bvsle .cse235 .cse236)) (bvsle .cse237 (select .cse238 v_arrayElimCell_77)) (not (bvsle v_prenex_80 .cse235)) (bvsle .cse237 (select .cse238 v_prenex_79)) (not (bvsle .cse234 .cse236))))) .cse1) (= (bvadd .cse239 (_ bv4294967284 32)) (_ bv0 32)) (or .cse0 .cse1 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_prenex_291 (_ BitVec 32)) (v_prenex_290 (_ BitVec 32)) (v_prenex_289 (_ BitVec 32)) (v_prenex_288 (_ BitVec 32)) (v_prenex_287 (_ BitVec 32))) (let ((.cse244 (select |c_#length| v_arrayElimCell_35)) (.cse243 (bvadd v_prenex_291 v_prenex_289)) (.cse242 (bvadd v_prenex_289 (_ bv8 32))) (.cse245 (bvadd v_prenex_289 (_ bv12 32))) (.cse240 (bvadd v_prenex_289 (_ bv4 32))) (.cse241 (store |c_#length| v_prenex_287 v_prenex_290))) (or (bvsle .cse240 (select .cse241 v_arrayElimCell_35)) (not (bvsle (_ bv0 32) .cse242)) (not (bvsle .cse243 .cse244)) (not (bvsle .cse245 .cse244)) (not (bvsle v_prenex_289 .cse243)) (not (= (select |c_#valid| v_prenex_287) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_289)) (= v_arrayElimCell_35 c_main_~x~0.base) (not (bvsle .cse242 .cse245)) (bvsle .cse240 (select .cse241 v_prenex_288)))))) (or .cse0 (forall ((v_prenex_186 (_ BitVec 32)) (v_prenex_189 (_ BitVec 32)) (v_prenex_13 (_ BitVec 32)) (v_prenex_188 (_ BitVec 32)) (v_prenex_187 (_ BitVec 32))) (let ((.cse246 (bvadd v_prenex_187 v_prenex_188)) (.cse248 (bvadd v_prenex_188 (_ bv12 32))) (.cse249 (select |c_#length| v_prenex_13)) (.cse247 (bvadd v_prenex_188 (_ bv8 32)))) (or (not (bvsle v_prenex_188 .cse246)) (not (bvsle .cse247 .cse248)) (not (bvsle .cse246 .cse249)) (not (bvsle (_ bv0 32) v_prenex_188)) (= v_prenex_13 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_186) (_ bv0 1))) (not (bvsle .cse248 .cse249)) (bvsle (bvadd v_prenex_188 (_ bv4 32)) (select (store |c_#length| v_prenex_186 v_prenex_189) v_prenex_13)) (not (bvsle (_ bv0 32) .cse247))))) .cse1) (or (forall ((v_prenex_104 (_ BitVec 32)) (v_prenex_103 (_ BitVec 32)) (v_prenex_102 (_ BitVec 32)) (v_prenex_101 (_ BitVec 32)) (v_prenex_100 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (let ((.cse250 (bvadd v_prenex_100 v_prenex_103)) (.cse252 (select |c_#length| v_arrayElimCell_155)) (.cse253 (bvadd v_prenex_103 (_ bv4 32))) (.cse254 (store |c_#length| v_prenex_101 v_prenex_104)) (.cse255 (bvadd v_prenex_103 (_ bv8 32))) (.cse251 (bvadd v_prenex_103 (_ bv12 32)))) (or (not (bvsle v_prenex_103 .cse250)) (not (bvsle .cse251 .cse252)) (not (bvsle .cse250 .cse252)) (bvsle .cse253 (select .cse254 v_prenex_102)) (not (bvsle (_ bv0 32) v_prenex_103)) (bvsle .cse253 (select .cse254 v_arrayElimCell_155)) (not (= (select |c_#valid| v_prenex_101) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse255)) (not (bvsle .cse255 .cse251))))) .cse1) (or .cse12 .cse80 (forall ((v_prenex_361 (_ BitVec 32)) (v_prenex_360 (_ BitVec 32)) (v_prenex_359 (_ BitVec 32)) (v_prenex_358 (_ BitVec 32))) (let ((.cse258 (bvadd v_prenex_360 (_ bv12 32))) (.cse256 (bvadd v_prenex_361 v_prenex_360)) (.cse259 (select |c_#length| |c_main_write~$Pointer$_#value.base|)) (.cse257 (bvadd v_prenex_360 (_ bv8 32)))) (or (not (bvsle v_prenex_360 .cse256)) (not (bvsle .cse257 .cse258)) (not (bvsle .cse258 .cse259)) (not (bvsle (_ bv0 32) v_prenex_360)) (bvsle (bvadd v_prenex_360 (_ bv4 32)) (select (store |c_#length| v_prenex_359 v_prenex_358) |c_main_write~$Pointer$_#value.base|)) (not (= (select |c_#valid| v_prenex_359) (_ bv0 1))) (not (bvsle .cse256 .cse259)) (not (bvsle (_ bv0 32) .cse257)))))) (or .cse47 .cse0 .cse12 (forall ((v_prenex_340 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_343 (_ BitVec 32)) (v_prenex_342 (_ BitVec 32)) (v_prenex_341 (_ BitVec 32))) (let ((.cse260 (bvadd v_prenex_343 v_prenex_341)) (.cse262 (bvadd v_prenex_341 (_ bv8 32))) (.cse263 (bvadd v_prenex_341 (_ bv12 32))) (.cse261 (select |c_#length| v_arrayElimCell_109))) (or (bvsle (bvadd v_prenex_341 (_ bv4 32)) (select (store |c_#length| v_prenex_340 v_prenex_342) v_arrayElimCell_109)) (not (bvsle .cse260 .cse261)) (not (bvsle (_ bv0 32) .cse262)) (not (bvsle v_prenex_341 .cse260)) (not (bvsle (_ bv0 32) v_prenex_341)) (not (bvsle .cse262 .cse263)) (not (= (select |c_#valid| v_prenex_340) (_ bv0 1))) (= v_arrayElimCell_109 c_main_~x~0.base) (not (bvsle .cse263 .cse261)))))) (or .cse1 (forall ((v_prenex_263 (_ BitVec 32)) (v_prenex_262 (_ BitVec 32)) (v_prenex_261 (_ BitVec 32)) (v_arrayElimCell_133 (_ BitVec 32)) (v_prenex_264 (_ BitVec 32))) (let ((.cse265 (select |c_#length| v_arrayElimCell_133)) (.cse267 (bvadd v_prenex_264 v_prenex_262)) (.cse266 (bvadd v_prenex_262 (_ bv8 32))) (.cse264 (bvadd v_prenex_262 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_262)) (not (bvsle .cse264 .cse265)) (not (bvsle (_ bv0 32) .cse266)) (not (bvsle .cse267 .cse265)) (not (bvsle v_prenex_262 .cse267)) (= v_arrayElimCell_133 c_main_~x~0.base) (not (bvsle .cse266 .cse264)) (bvsle (bvadd v_prenex_262 (_ bv4 32)) (select (store |c_#length| v_prenex_261 v_prenex_263) v_arrayElimCell_133)) (not (= (select |c_#valid| v_prenex_261) (_ bv0 1))))))) (or .cse47 .cse0 .cse1 (forall ((v_arrayElimCell_125 (_ BitVec 32)) (v_prenex_234 (_ BitVec 32)) (v_prenex_233 (_ BitVec 32)) (v_prenex_232 (_ BitVec 32)) (v_prenex_231 (_ BitVec 32))) (let ((.cse269 (bvadd v_prenex_232 (_ bv12 32))) (.cse268 (bvadd v_prenex_232 (_ bv8 32))) (.cse270 (select |c_#length| v_arrayElimCell_125)) (.cse271 (bvadd v_prenex_234 v_prenex_232))) (or (not (= (select |c_#valid| v_prenex_231) (_ bv0 1))) (not (bvsle .cse268 .cse269)) (not (bvsle .cse269 .cse270)) (not (bvsle (_ bv0 32) .cse268)) (= v_arrayElimCell_125 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_232)) (not (bvsle .cse271 .cse270)) (bvsle (bvadd v_prenex_232 (_ bv4 32)) (select (store |c_#length| v_prenex_231 v_prenex_233) v_arrayElimCell_125)) (not (bvsle v_prenex_232 .cse271)))))) (or .cse0 .cse1 (forall ((v_prenex_348 (_ BitVec 32)) (v_prenex_347 (_ BitVec 32)) (v_prenex_346 (_ BitVec 32)) (v_prenex_345 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_344 (_ BitVec 32))) (let ((.cse274 (select |c_#length| v_prenex_4)) (.cse275 (bvadd v_prenex_346 (_ bv4 32))) (.cse276 (store |c_#length| v_prenex_344 v_prenex_347)) (.cse273 (bvadd v_prenex_348 v_prenex_346)) (.cse272 (bvadd v_prenex_346 (_ bv8 32))) (.cse277 (bvadd v_prenex_346 (_ bv12 32)))) (or (not (bvsle (_ bv0 32) v_prenex_346)) (not (bvsle (_ bv0 32) .cse272)) (not (bvsle .cse273 .cse274)) (not (= (select |c_#valid| v_prenex_344) (_ bv0 1))) (bvsle .cse275 (select .cse276 v_prenex_345)) (not (bvsle .cse277 .cse274)) (bvsle .cse275 (select .cse276 v_prenex_4)) (not (bvsle v_prenex_346 .cse273)) (not (bvsle .cse272 .cse277)) (= v_prenex_4 c_main_~x~0.base))))) (or .cse47 .cse1 (forall ((v_prenex_409 (_ BitVec 32)) (v_prenex_408 (_ BitVec 32)) (v_prenex_407 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32)) (v_prenex_411 (_ BitVec 32)) (v_prenex_410 (_ BitVec 32))) (let ((.cse281 (bvadd v_prenex_411 v_prenex_410)) (.cse282 (select |c_#length| v_prenex_28)) (.cse278 (bvadd v_prenex_410 (_ bv4 32))) (.cse279 (store |c_#length| v_prenex_409 v_prenex_408)) (.cse280 (bvadd v_prenex_410 (_ bv8 32))) (.cse283 (bvadd v_prenex_410 (_ bv12 32)))) (or (bvsle .cse278 (select .cse279 v_prenex_28)) (not (bvsle (_ bv0 32) .cse280)) (not (= (select |c_#valid| v_prenex_409) (_ bv0 1))) (not (bvsle .cse281 .cse282)) (not (bvsle v_prenex_410 .cse281)) (not (bvsle .cse283 .cse282)) (bvsle .cse278 (select .cse279 v_prenex_407)) (not (bvsle .cse280 .cse283)) (not (bvsle (_ bv0 32) v_prenex_410)))))) (or .cse0 (forall ((v_arrayElimCell_170 (_ BitVec 32)) (v_prenex_202 (_ BitVec 32)) (v_prenex_201 (_ BitVec 32)) (v_prenex_200 (_ BitVec 32)) (v_prenex_199 (_ BitVec 32))) (let ((.cse284 (bvadd v_prenex_202 v_prenex_200)) (.cse286 (bvadd v_prenex_200 (_ bv12 32))) (.cse287 (select |c_#length| v_arrayElimCell_170)) (.cse285 (bvadd v_prenex_200 (_ bv8 32)))) (or (= v_arrayElimCell_170 c_main_~x~0.base) (not (bvsle v_prenex_200 .cse284)) (bvsle (bvadd v_prenex_200 (_ bv4 32)) (select (store |c_#length| v_prenex_199 v_prenex_201) v_arrayElimCell_170)) (not (bvsle .cse285 .cse286)) (not (bvsle .cse284 .cse287)) (not (= (select |c_#valid| v_prenex_199) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_200)) (not (bvsle .cse286 .cse287)) (not (bvsle (_ bv0 32) .cse285))))) .cse1) (or .cse0 .cse1 (forall ((v_prenex_194 (_ BitVec 32)) (v_prenex_193 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32)) (v_prenex_192 (_ BitVec 32)) (v_prenex_191 (_ BitVec 32)) (v_prenex_190 (_ BitVec 32))) (let ((.cse288 (bvadd v_prenex_192 (_ bv12 32))) (.cse292 (bvadd v_prenex_192 (_ bv8 32))) (.cse290 (bvadd v_prenex_192 (_ bv4 32))) (.cse291 (store |c_#length| v_prenex_190 v_prenex_193)) (.cse293 (bvadd v_prenex_194 v_prenex_192)) (.cse289 (select |c_#length| v_arrayElimCell_43))) (or (not (bvsle .cse288 .cse289)) (not (bvsle (_ bv0 32) v_prenex_192)) (bvsle .cse290 (select .cse291 v_arrayElimCell_43)) (= v_arrayElimCell_43 c_main_~x~0.base) (not (bvsle .cse292 .cse288)) (not (bvsle (_ bv0 32) .cse292)) (not (bvsle v_prenex_192 .cse293)) (not (= (select |c_#valid| v_prenex_190) (_ bv0 1))) (bvsle .cse290 (select .cse291 v_prenex_191)) (not (bvsle .cse293 .cse289)))))) (or .cse47 (forall ((v_prenex_27 (_ BitVec 32)) (v_prenex_300 (_ BitVec 32)) (v_prenex_299 (_ BitVec 32)) (v_prenex_298 (_ BitVec 32)) (v_prenex_297 (_ BitVec 32))) (let ((.cse294 (bvadd v_prenex_300 v_prenex_298)) (.cse297 (bvadd v_prenex_298 (_ bv12 32))) (.cse295 (select |c_#length| v_prenex_27)) (.cse296 (bvadd v_prenex_298 (_ bv8 32)))) (or (bvsle (bvadd v_prenex_298 (_ bv4 32)) (select (store |c_#length| v_prenex_297 v_prenex_299) v_prenex_27)) (not (= (select |c_#valid| v_prenex_297) (_ bv0 1))) (not (bvsle v_prenex_298 .cse294)) (not (bvsle .cse294 .cse295)) (not (bvsle (_ bv0 32) v_prenex_298)) (not (bvsle .cse296 .cse297)) (not (bvsle .cse297 .cse295)) (not (bvsle (_ bv0 32) .cse296)) (= v_prenex_27 c_main_~x~0.base)))) .cse1) .cse0 (bvsle (_ bv0 32) .cse87) (or .cse0 .cse1 (forall ((v_prenex_7 (_ BitVec 32)) (v_prenex_357 (_ BitVec 32)) (v_prenex_356 (_ BitVec 32)) (v_prenex_355 (_ BitVec 32)) (v_prenex_354 (_ BitVec 32)) (v_prenex_353 (_ BitVec 32))) (let ((.cse298 (bvadd v_prenex_356 (_ bv8 32))) (.cse299 (bvadd v_prenex_356 (_ bv12 32))) (.cse300 (bvadd v_prenex_356 (_ bv4 32))) (.cse301 (store |c_#length| v_prenex_355 v_prenex_354)) (.cse302 (bvadd v_prenex_357 v_prenex_356)) (.cse303 (select |c_#length| v_prenex_7))) (or (not (bvsle .cse298 .cse299)) (not (= (select |c_#valid| v_prenex_355) (_ bv0 1))) (bvsle .cse300 (select .cse301 v_prenex_7)) (= v_prenex_7 c_main_~x~0.base) (not (bvsle (_ bv0 32) .cse298)) (not (bvsle v_prenex_356 .cse302)) (not (bvsle .cse299 .cse303)) (not (bvsle (_ bv0 32) v_prenex_356)) (bvsle .cse300 (select .cse301 v_prenex_353)) (not (bvsle .cse302 .cse303)))))) (or .cse1 (forall ((v_prenex_53 (_ BitVec 32)) (v_prenex_54 (_ BitVec 32)) (v_prenex_55 (_ BitVec 32)) (v_prenex_56 (_ BitVec 32)) (v_prenex_57 (_ BitVec 32))) (let ((.cse304 (bvadd v_prenex_57 (_ bv8 32))) (.cse305 (bvadd v_prenex_57 (_ bv12 32))) (.cse307 (bvadd v_prenex_53 v_prenex_57)) (.cse306 (select |c_#length| v_prenex_56))) (or (not (bvsle (_ bv0 32) .cse304)) (not (bvsle (_ bv0 32) v_prenex_57)) (not (bvsle .cse305 .cse306)) (bvsle (bvadd v_prenex_57 (_ bv4 32)) (select (store |c_#length| v_prenex_55 v_prenex_54) v_prenex_56)) (not (bvsle v_prenex_57 .cse307)) (not (bvsle .cse304 .cse305)) (not (= (select |c_#valid| v_prenex_55) (_ bv0 1))) (not (bvsle .cse307 .cse306)))))) (or .cse1 (forall ((v_prenex_109 (_ BitVec 32)) (v_prenex_108 (_ BitVec 32)) (v_prenex_107 (_ BitVec 32)) (v_prenex_106 (_ BitVec 32)) (v_prenex_26 (_ BitVec 32)) (v_prenex_105 (_ BitVec 32))) (let ((.cse308 (bvadd v_prenex_105 v_prenex_108)) (.cse310 (bvadd v_prenex_108 (_ bv8 32))) (.cse312 (bvadd v_prenex_108 (_ bv4 32))) (.cse313 (store |c_#length| v_prenex_106 v_prenex_109)) (.cse311 (bvadd v_prenex_108 (_ bv12 32))) (.cse309 (select |c_#length| v_prenex_26))) (or (not (bvsle .cse308 .cse309)) (not (= (select |c_#valid| v_prenex_106) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse310)) (not (bvsle (_ bv0 32) v_prenex_108)) (not (bvsle v_prenex_108 .cse308)) (not (bvsle .cse310 .cse311)) (bvsle .cse312 (select .cse313 v_prenex_26)) (bvsle .cse312 (select .cse313 v_prenex_107)) (not (bvsle .cse311 .cse309)))))) (or .cse47 (forall ((v_prenex_335 (_ BitVec 32)) (v_prenex_334 (_ BitVec 32)) (v_prenex_333 (_ BitVec 32)) (v_prenex_332 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse314 (bvadd v_prenex_333 (_ bv8 32))) (.cse315 (bvadd v_prenex_333 (_ bv12 32))) (.cse316 (select |c_#length| v_prenex_24)) (.cse317 (bvadd v_prenex_335 v_prenex_333))) (or (not (bvsle (_ bv0 32) .cse314)) (bvsle (bvadd v_prenex_333 (_ bv4 32)) (select (store |c_#length| v_prenex_332 v_prenex_334) v_prenex_24)) (not (= (select |c_#valid| v_prenex_332) (_ bv0 1))) (not (bvsle .cse315 .cse316)) (not (bvsle (_ bv0 32) v_prenex_333)) (not (bvsle .cse314 .cse315)) (not (bvsle .cse317 .cse316)) (not (bvsle v_prenex_333 .cse317))))) .cse1) (or .cse0 (forall ((v_prenex_238 (_ BitVec 32)) (v_prenex_237 (_ BitVec 32)) (v_prenex_236 (_ BitVec 32)) (v_prenex_235 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse318 (bvadd v_prenex_236 (_ bv8 32))) (.cse319 (bvadd v_prenex_236 (_ bv12 32))) (.cse321 (select |c_#length| v_prenex_12)) (.cse320 (bvadd v_prenex_238 v_prenex_236))) (or (bvsle (bvadd v_prenex_236 (_ bv4 32)) (select (store |c_#length| v_prenex_235 v_prenex_237) v_prenex_12)) (not (bvsle (_ bv0 32) v_prenex_236)) (not (bvsle .cse318 .cse319)) (not (bvsle .cse320 .cse321)) (not (bvsle (_ bv0 32) .cse318)) (not (bvsle .cse319 .cse321)) (not (= (select |c_#valid| v_prenex_235) (_ bv0 1))) (not (bvsle v_prenex_236 .cse320))))) .cse1) (or .cse0 (forall ((v_arrayElimCell_224 (_ BitVec 32)) (v_prenex_260 (_ BitVec 32)) (v_prenex_259 (_ BitVec 32)) (v_prenex_258 (_ BitVec 32)) (v_prenex_257 (_ BitVec 32))) (let ((.cse325 (bvadd v_prenex_258 (_ bv12 32))) (.cse323 (select |c_#length| v_arrayElimCell_224)) (.cse322 (bvadd v_prenex_260 v_prenex_258)) (.cse324 (bvadd v_prenex_258 (_ bv8 32)))) (or (= v_arrayElimCell_224 c_main_~x~0.base) (not (bvsle .cse322 .cse323)) (not (bvsle .cse324 .cse325)) (bvsle (bvadd v_prenex_258 (_ bv4 32)) (select (store |c_#length| v_prenex_257 v_prenex_259) v_arrayElimCell_224)) (not (bvsle .cse325 .cse323)) (not (= (select |c_#valid| v_prenex_257) (_ bv0 1))) (not (bvsle v_prenex_258 .cse322)) (not (bvsle (_ bv0 32) v_prenex_258)) (not (bvsle (_ bv0 32) .cse324)))))) (or .cse47 .cse0 .cse1 (forall ((v_prenex_5 (_ BitVec 32)) (v_prenex_225 (_ BitVec 32)) (v_prenex_224 (_ BitVec 32)) (v_prenex_223 (_ BitVec 32)) (v_prenex_222 (_ BitVec 32)) (v_prenex_221 (_ BitVec 32))) (let ((.cse326 (bvadd v_prenex_223 (_ bv12 32))) (.cse331 (bvadd v_prenex_223 (_ bv8 32))) (.cse328 (bvadd v_prenex_225 v_prenex_223)) (.cse327 (select |c_#length| v_prenex_5)) (.cse329 (bvadd v_prenex_223 (_ bv4 32))) (.cse330 (store |c_#length| v_prenex_221 v_prenex_224))) (or (not (bvsle (_ bv0 32) v_prenex_223)) (not (bvsle .cse326 .cse327)) (not (bvsle v_prenex_223 .cse328)) (bvsle .cse329 (select .cse330 v_prenex_5)) (not (bvsle .cse331 .cse326)) (not (bvsle (_ bv0 32) .cse331)) (not (= (select |c_#valid| v_prenex_221) (_ bv0 1))) (not (bvsle .cse328 .cse327)) (bvsle .cse329 (select .cse330 v_prenex_222)) (= v_prenex_5 c_main_~x~0.base))))) (or .cse0 .cse1 (forall ((v_prenex_175 (_ BitVec 32)) (v_prenex_174 (_ BitVec 32)) (v_prenex_173 (_ BitVec 32)) (v_prenex_172 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 32)) (v_prenex_176 (_ BitVec 32))) (let ((.cse333 (select |c_#length| v_arrayElimCell_52)) (.cse332 (bvadd v_prenex_173 v_prenex_175)) (.cse335 (bvadd v_prenex_175 (_ bv4 32))) (.cse336 (store |c_#length| v_prenex_172 v_prenex_176)) (.cse337 (bvadd v_prenex_175 (_ bv8 32))) (.cse334 (bvadd v_prenex_175 (_ bv12 32)))) (or (not (bvsle .cse332 .cse333)) (not (bvsle .cse334 .cse333)) (not (= (select |c_#valid| v_prenex_172) (_ bv0 1))) (bvsle .cse335 (select .cse336 v_prenex_174)) (not (bvsle v_prenex_175 .cse332)) (not (bvsle (_ bv0 32) .cse337)) (bvsle .cse335 (select .cse336 v_arrayElimCell_52)) (not (bvsle (_ bv0 32) v_prenex_175)) (not (bvsle .cse337 .cse334)) (= v_arrayElimCell_52 c_main_~x~0.base))))) (or .cse0 .cse1 (forall ((v_prenex_185 (_ BitVec 32)) (v_prenex_184 (_ BitVec 32)) (v_prenex_183 (_ BitVec 32)) (v_prenex_182 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse339 (bvadd v_prenex_184 (_ bv8 32))) (.cse338 (bvadd v_prenex_183 v_prenex_184)) (.cse340 (bvadd v_prenex_184 (_ bv12 32))) (.cse341 (select |c_#length| v_arrayElimCell_74))) (or (not (bvsle v_prenex_184 .cse338)) (not (bvsle .cse339 .cse340)) (not (bvsle (_ bv0 32) .cse339)) (not (bvsle .cse338 .cse341)) (not (bvsle (_ bv0 32) v_prenex_184)) (= v_arrayElimCell_74 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_182) (_ bv0 1))) (not (bvsle .cse340 .cse341)) (bvsle (bvadd v_prenex_184 (_ bv4 32)) (select (store |c_#length| v_prenex_182 v_prenex_185) v_arrayElimCell_74)))))) (or .cse0 .cse12 (forall ((v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_215 (_ BitVec 32)) (v_prenex_214 (_ BitVec 32)) (v_prenex_213 (_ BitVec 32)) (v_prenex_212 (_ BitVec 32)) (v_prenex_211 (_ BitVec 32))) (let ((.cse342 (bvadd v_prenex_213 (_ bv12 32))) (.cse346 (bvadd v_prenex_213 (_ bv8 32))) (.cse344 (bvadd v_prenex_213 (_ bv4 32))) (.cse345 (store |c_#length| v_prenex_211 v_prenex_214)) (.cse343 (select |c_#length| v_arrayElimCell_114)) (.cse347 (bvadd v_prenex_215 v_prenex_213))) (or (not (bvsle .cse342 .cse343)) (= v_arrayElimCell_114 c_main_~x~0.base) (bvsle .cse344 (select .cse345 v_prenex_212)) (not (bvsle .cse346 .cse342)) (not (bvsle (_ bv0 32) .cse346)) (bvsle .cse344 (select .cse345 v_arrayElimCell_114)) (not (= (select |c_#valid| v_prenex_211) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_213)) (not (bvsle .cse347 .cse343)) (not (bvsle v_prenex_213 .cse347)))))) (or .cse47 .cse1 (forall ((v_prenex_31 (_ BitVec 32)) (v_prenex_304 (_ BitVec 32)) (v_prenex_303 (_ BitVec 32)) (v_prenex_302 (_ BitVec 32)) (v_prenex_301 (_ BitVec 32))) (let ((.cse348 (bvadd v_prenex_302 (_ bv8 32))) (.cse350 (bvadd v_prenex_302 (_ bv12 32))) (.cse349 (bvadd v_prenex_304 v_prenex_302)) (.cse351 (select |c_#length| v_prenex_31))) (or (not (bvsle (_ bv0 32) .cse348)) (not (bvsle v_prenex_302 .cse349)) (= v_prenex_31 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_302)) (not (bvsle .cse350 .cse351)) (not (bvsle .cse348 .cse350)) (not (= (select |c_#valid| v_prenex_301) (_ bv0 1))) (bvsle (bvadd v_prenex_302 (_ bv4 32)) (select (store |c_#length| v_prenex_301 v_prenex_303) v_prenex_31)) (not (bvsle .cse349 .cse351)))))) (or (forall ((v_prenex_384 (_ BitVec 32)) (v_prenex_383 (_ BitVec 32)) (v_prenex_382 (_ BitVec 32)) (v_prenex_381 (_ BitVec 32)) (v_prenex_380 (_ BitVec 32))) (let ((.cse352 (bvadd v_prenex_384 v_prenex_383)) (.cse355 (bvadd v_prenex_383 (_ bv12 32))) (.cse353 (select |c_#length| v_prenex_380)) (.cse354 (bvadd v_prenex_383 (_ bv8 32)))) (or (not (bvsle .cse352 .cse353)) (not (bvsle v_prenex_383 .cse352)) (not (bvsle .cse354 .cse355)) (not (bvsle .cse355 .cse353)) (not (bvsle (_ bv0 32) v_prenex_383)) (not (bvsle (_ bv0 32) .cse354)) (not (= (select |c_#valid| v_prenex_382) (_ bv0 1))) (bvsle (bvadd v_prenex_383 (_ bv4 32)) (select (store |c_#length| v_prenex_382 v_prenex_381) v_prenex_380))))) .cse356) (or (forall ((v_prenex_164 (_ BitVec 32)) (v_prenex_163 (_ BitVec 32)) (v_prenex_162 (_ BitVec 32)) (v_arrayElimCell_136 (_ BitVec 32)) (v_prenex_166 (_ BitVec 32)) (v_prenex_165 (_ BitVec 32))) (let ((.cse357 (bvadd v_prenex_163 v_prenex_165)) (.cse358 (bvadd v_prenex_165 (_ bv8 32))) (.cse361 (bvadd v_prenex_165 (_ bv4 32))) (.cse362 (store |c_#length| v_prenex_162 v_prenex_166)) (.cse359 (bvadd v_prenex_165 (_ bv12 32))) (.cse360 (select |c_#length| v_arrayElimCell_136))) (or (not (bvsle v_prenex_165 .cse357)) (= v_arrayElimCell_136 c_main_~x~0.base) (not (bvsle .cse358 .cse359)) (not (bvsle .cse357 .cse360)) (bvsle .cse361 (select .cse362 v_prenex_164)) (not (bvsle (_ bv0 32) .cse358)) (bvsle .cse361 (select .cse362 v_arrayElimCell_136)) (not (bvsle .cse359 .cse360)) (not (= (select |c_#valid| v_prenex_162) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_165))))) .cse1) (or .cse47 .cse1 (forall ((v_prenex_118 (_ BitVec 32)) (v_prenex_117 (_ BitVec 32)) (v_prenex_116 (_ BitVec 32)) (v_prenex_115 (_ BitVec 32)) (v_prenex_114 (_ BitVec 32)) (v_prenex_25 (_ BitVec 32))) (let ((.cse363 (bvadd v_prenex_117 (_ bv8 32))) (.cse364 (bvadd v_prenex_117 (_ bv12 32))) (.cse367 (bvadd v_prenex_115 v_prenex_117)) (.cse368 (select |c_#length| v_prenex_25)) (.cse365 (bvadd v_prenex_117 (_ bv4 32))) (.cse366 (store |c_#length| v_prenex_114 v_prenex_118))) (or (not (bvsle (_ bv0 32) v_prenex_117)) (not (bvsle (_ bv0 32) .cse363)) (= v_prenex_25 c_main_~x~0.base) (not (bvsle .cse363 .cse364)) (bvsle .cse365 (select .cse366 v_prenex_116)) (not (bvsle v_prenex_117 .cse367)) (not (= (select |c_#valid| v_prenex_114) (_ bv0 1))) (not (bvsle .cse364 .cse368)) (not (bvsle .cse367 .cse368)) (bvsle .cse365 (select .cse366 v_prenex_25)))))) (or .cse1 (forall ((v_prenex_32 (_ BitVec 32)) (v_prenex_181 (_ BitVec 32)) (v_prenex_180 (_ BitVec 32)) (v_prenex_179 (_ BitVec 32)) (v_prenex_178 (_ BitVec 32)) (v_prenex_177 (_ BitVec 32))) (let ((.cse371 (select |c_#length| v_prenex_32)) (.cse369 (bvadd v_prenex_180 (_ bv8 32))) (.cse374 (bvadd v_prenex_180 (_ bv12 32))) (.cse370 (bvadd v_prenex_178 v_prenex_180)) (.cse372 (bvadd v_prenex_180 (_ bv4 32))) (.cse373 (store |c_#length| v_prenex_177 v_prenex_181))) (or (not (bvsle (_ bv0 32) .cse369)) (not (bvsle (_ bv0 32) v_prenex_180)) (not (bvsle .cse370 .cse371)) (bvsle .cse372 (select .cse373 v_prenex_179)) (not (bvsle .cse374 .cse371)) (not (= (select |c_#valid| v_prenex_177) (_ bv0 1))) (not (bvsle .cse369 .cse374)) (= v_prenex_32 c_main_~x~0.base) (not (bvsle v_prenex_180 .cse370)) (bvsle .cse372 (select .cse373 v_prenex_32)))))) (or .cse1 (forall ((v_prenex_230 (_ BitVec 32)) (v_prenex_229 (_ BitVec 32)) (v_prenex_228 (_ BitVec 32)) (v_prenex_227 (_ BitVec 32)) (v_prenex_226 (_ BitVec 32)) (v_prenex_35 (_ BitVec 32))) (let ((.cse379 (bvadd v_prenex_230 v_prenex_228)) (.cse377 (bvadd v_prenex_228 (_ bv8 32))) (.cse375 (bvadd v_prenex_228 (_ bv4 32))) (.cse376 (store |c_#length| v_prenex_226 v_prenex_229)) (.cse378 (bvadd v_prenex_228 (_ bv12 32))) (.cse380 (select |c_#length| v_prenex_35))) (or (bvsle .cse375 (select .cse376 v_prenex_227)) (not (bvsle (_ bv0 32) v_prenex_228)) (not (= (select |c_#valid| v_prenex_226) (_ bv0 1))) (not (bvsle .cse377 .cse378)) (= v_prenex_35 c_main_~x~0.base) (not (bvsle .cse379 .cse380)) (not (bvsle v_prenex_228 .cse379)) (not (bvsle (_ bv0 32) .cse377)) (bvsle .cse375 (select .cse376 v_prenex_35)) (not (bvsle .cse378 .cse380)))))) (or .cse0 (forall ((v_prenex_388 (_ BitVec 32)) (v_prenex_387 (_ BitVec 32)) (v_prenex_386 (_ BitVec 32)) (v_arrayElimCell_220 (_ BitVec 32)) (v_prenex_385 (_ BitVec 32))) (let ((.cse381 (bvadd v_prenex_387 (_ bv8 32))) (.cse384 (bvadd v_prenex_387 (_ bv12 32))) (.cse383 (select |c_#length| v_arrayElimCell_220)) (.cse382 (bvadd v_prenex_388 v_prenex_387))) (or (not (bvsle (_ bv0 32) .cse381)) (not (bvsle (_ bv0 32) v_prenex_387)) (bvsle (bvadd v_prenex_387 (_ bv4 32)) (select (store |c_#length| v_prenex_386 v_prenex_385) v_arrayElimCell_220)) (not (bvsle .cse382 .cse383)) (not (bvsle .cse381 .cse384)) (not (bvsle .cse384 .cse383)) (not (bvsle v_prenex_387 .cse382)) (not (= (select |c_#valid| v_prenex_386) (_ bv0 1))))))) (or (forall ((v_prenex_285 (_ BitVec 32)) (v_prenex_284 (_ BitVec 32)) (v_prenex_283 (_ BitVec 32)) (v_arrayElimCell_63 (_ BitVec 32)) (v_prenex_286 (_ BitVec 32))) (let ((.cse387 (select |c_#length| v_arrayElimCell_63)) (.cse385 (bvadd v_prenex_284 (_ bv8 32))) (.cse388 (bvadd v_prenex_284 (_ bv12 32))) (.cse386 (bvadd v_prenex_286 v_prenex_284))) (or (not (bvsle (_ bv0 32) .cse385)) (not (bvsle (_ bv0 32) v_prenex_284)) (not (bvsle .cse386 .cse387)) (not (bvsle .cse388 .cse387)) (= v_arrayElimCell_63 c_main_~x~0.base) (not (bvsle .cse385 .cse388)) (bvsle (bvadd v_prenex_284 (_ bv4 32)) (select (store |c_#length| v_prenex_283 v_prenex_285) v_arrayElimCell_63)) (not (bvsle v_prenex_284 .cse386)) (not (= (select |c_#valid| v_prenex_283) (_ bv0 1)))))) .cse0 .cse1) (or .cse47 .cse0 .cse1 (forall ((v_prenex_95 (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (v_prenex_93 (_ BitVec 32)) (v_prenex_94 (_ BitVec 32)) (v_arrayElimCell_29 (_ BitVec 32))) (let ((.cse389 (bvadd v_prenex_94 (_ bv4 32))) (.cse390 (store |c_#length| v_prenex_92 v_prenex_95)) (.cse391 (bvadd v_prenex_91 v_prenex_94)) (.cse392 (bvadd v_prenex_94 (_ bv8 32))) (.cse394 (bvadd v_prenex_94 (_ bv12 32))) (.cse393 (select |c_#length| v_arrayElimCell_29))) (or (bvsle .cse389 (select .cse390 v_arrayElimCell_29)) (not (bvsle v_prenex_94 .cse391)) (not (bvsle (_ bv0 32) .cse392)) (bvsle .cse389 (select .cse390 v_prenex_93)) (not (bvsle .cse391 .cse393)) (not (bvsle (_ bv0 32) v_prenex_94)) (not (= (select |c_#valid| v_prenex_92) (_ bv0 1))) (not (bvsle .cse392 .cse394)) (not (bvsle .cse394 .cse393)))))) (or .cse47 .cse0 .cse1 (forall ((v_prenex_406 (_ BitVec 32)) (v_prenex_405 (_ BitVec 32)) (v_prenex_404 (_ BitVec 32)) (v_prenex_403 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse395 (bvadd v_prenex_406 v_prenex_405)) (.cse398 (bvadd v_prenex_405 (_ bv12 32))) (.cse396 (select |c_#length| v_prenex_14)) (.cse397 (bvadd v_prenex_405 (_ bv8 32)))) (or (not (bvsle (_ bv0 32) v_prenex_405)) (not (bvsle .cse395 .cse396)) (not (= (select |c_#valid| v_prenex_404) (_ bv0 1))) (bvsle (bvadd v_prenex_405 (_ bv4 32)) (select (store |c_#length| v_prenex_404 v_prenex_403) v_prenex_14)) (= v_prenex_14 c_main_~x~0.base) (not (bvsle .cse397 .cse398)) (not (bvsle v_prenex_405 .cse395)) (not (bvsle .cse398 .cse396)) (not (bvsle (_ bv0 32) .cse397)))))) .cse356 (or .cse0 (forall ((v_prenex_62 (_ BitVec 32)) (v_prenex_60 (_ BitVec 32)) (v_prenex_61 (_ BitVec 32)) (v_prenex_59 (_ BitVec 32)) (v_prenex_58 (_ BitVec 32))) (let ((.cse400 (select |c_#length| v_prenex_61)) (.cse399 (bvadd v_prenex_58 v_prenex_62)) (.cse401 (bvadd v_prenex_62 (_ bv12 32))) (.cse402 (bvadd v_prenex_62 (_ bv8 32)))) (or (not (= (select |c_#valid| v_prenex_60) (_ bv0 1))) (not (bvsle .cse399 .cse400)) (not (bvsle (_ bv0 32) v_prenex_62)) (not (bvsle .cse401 .cse400)) (not (bvsle v_prenex_62 .cse399)) (not (bvsle .cse402 .cse401)) (bvsle (bvadd v_prenex_62 (_ bv4 32)) (select (store |c_#length| v_prenex_60 v_prenex_59) v_prenex_61)) (not (bvsle (_ bv0 32) .cse402)))))) (or .cse47 .cse0 .cse1 (forall ((v_prenex_139 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_138 (_ BitVec 32)) (v_prenex_137 (_ BitVec 32)) (v_prenex_136 (_ BitVec 32))) (let ((.cse403 (bvadd v_prenex_137 v_prenex_138)) (.cse404 (select |c_#length| v_prenex_6)) (.cse406 (bvadd v_prenex_138 (_ bv8 32))) (.cse405 (bvadd v_prenex_138 (_ bv12 32)))) (or (bvsle (bvadd v_prenex_138 (_ bv4 32)) (select (store |c_#length| v_prenex_136 v_prenex_139) v_prenex_6)) (not (bvsle .cse403 .cse404)) (not (bvsle v_prenex_138 .cse403)) (not (bvsle .cse405 .cse404)) (not (bvsle (_ bv0 32) .cse406)) (= v_prenex_6 c_main_~x~0.base) (not (bvsle (_ bv0 32) v_prenex_138)) (not (= (select |c_#valid| v_prenex_136) (_ bv0 1))) (not (bvsle .cse406 .cse405)))))) (or .cse0 (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_prenex_416 (_ BitVec 32)) (v_prenex_415 (_ BitVec 32)) (v_prenex_414 (_ BitVec 32)) (v_prenex_413 (_ BitVec 32)) (v_prenex_412 (_ BitVec 32))) (let ((.cse409 (bvadd v_prenex_415 (_ bv8 32))) (.cse411 (bvadd v_prenex_416 v_prenex_415)) (.cse407 (bvadd v_prenex_415 (_ bv4 32))) (.cse408 (store |c_#length| v_prenex_414 v_prenex_413)) (.cse410 (bvadd v_prenex_415 (_ bv12 32))) (.cse412 (select |c_#length| v_arrayElimCell_69))) (or (bvsle .cse407 (select .cse408 v_prenex_412)) (not (bvsle (_ bv0 32) .cse409)) (not (bvsle (_ bv0 32) v_prenex_415)) (not (bvsle .cse409 .cse410)) (not (bvsle .cse411 .cse412)) (not (bvsle v_prenex_415 .cse411)) (not (= (select |c_#valid| v_prenex_414) (_ bv0 1))) (bvsle .cse407 (select .cse408 v_arrayElimCell_69)) (not (bvsle .cse410 .cse412))))) .cse1) (or .cse1 (forall ((v_prenex_379 (_ BitVec 32)) (v_prenex_378 (_ BitVec 32)) (v_prenex_377 (_ BitVec 32)) (v_prenex_376 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse414 (bvadd v_prenex_379 v_prenex_378)) (.cse413 (bvadd v_prenex_378 (_ bv8 32))) (.cse416 (bvadd v_prenex_378 (_ bv12 32))) (.cse415 (select |c_#length| v_arrayElimCell_187))) (or (bvsle (bvadd v_prenex_378 (_ bv4 32)) (select (store |c_#length| v_prenex_377 v_prenex_376) v_arrayElimCell_187)) (not (bvsle (_ bv0 32) .cse413)) (not (bvsle v_prenex_378 .cse414)) (not (bvsle .cse414 .cse415)) (= v_arrayElimCell_187 c_main_~x~0.base) (not (= (select |c_#valid| v_prenex_377) (_ bv0 1))) (not (bvsle .cse413 .cse416)) (not (bvsle .cse416 .cse415)) (not (bvsle (_ bv0 32) v_prenex_378)))))) .cse1 (= c_main_~x~0.offset (_ bv0 32)) (or .cse0 .cse1 (forall ((v_prenex_152 (_ BitVec 32)) (v_arrayElimCell_223 (_ BitVec 32)) (v_prenex_151 (_ BitVec 32)) (v_prenex_150 (_ BitVec 32)) (v_prenex_149 (_ BitVec 32))) (let ((.cse417 (bvadd v_prenex_150 v_prenex_151)) (.cse418 (select |c_#length| v_arrayElimCell_223)) (.cse420 (bvadd v_prenex_151 (_ bv8 32))) (.cse419 (bvadd v_prenex_151 (_ bv12 32)))) (or (not (bvsle v_prenex_151 .cse417)) (not (bvsle .cse417 .cse418)) (= v_arrayElimCell_223 c_main_~x~0.base) (bvsle (bvadd v_prenex_151 (_ bv4 32)) (select (store |c_#length| v_prenex_149 v_prenex_152) v_arrayElimCell_223)) (not (bvsle .cse419 .cse418)) (not (bvsle (_ bv0 32) .cse420)) (not (bvsle .cse420 .cse419)) (not (= (select |c_#valid| v_prenex_149) (_ bv0 1))) (not (bvsle (_ bv0 32) v_prenex_151)))))) (bvsle .cse88 .cse239) (or .cse0 .cse1 (forall ((v_prenex_153 (_ BitVec 32)) (v_arrayElimCell_58 (_ BitVec 32)) (v_prenex_157 (_ BitVec 32)) (v_prenex_156 (_ BitVec 32)) (v_prenex_155 (_ BitVec 32)) (v_prenex_154 (_ BitVec 32))) (let ((.cse424 (bvadd v_prenex_156 (_ bv12 32))) (.cse422 (select |c_#length| v_arrayElimCell_58)) (.cse421 (bvadd v_prenex_154 v_prenex_156)) (.cse423 (bvadd v_prenex_156 (_ bv8 32))) (.cse425 (bvadd v_prenex_156 (_ bv4 32))) (.cse426 (store |c_#length| v_prenex_153 v_prenex_157))) (or (not (bvsle .cse421 .cse422)) (not (bvsle .cse423 .cse424)) (not (bvsle (_ bv0 32) v_prenex_156)) (= v_arrayElimCell_58 c_main_~x~0.base) (bvsle .cse425 (select .cse426 v_prenex_155)) (not (bvsle .cse424 .cse422)) (not (bvsle v_prenex_156 .cse421)) (not (= (select |c_#valid| v_prenex_153) (_ bv0 1))) (not (bvsle (_ bv0 32) .cse423)) (bvsle .cse425 (select .cse426 v_arrayElimCell_58))))))))) is different from true [2018-11-10 10:28:28,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:28,891 INFO L93 Difference]: Finished difference Result 253 states and 294 transitions. [2018-11-10 10:28:28,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-10 10:28:28,894 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 32 [2018-11-10 10:28:28,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:28:28,894 INFO L225 Difference]: With dead ends: 253 [2018-11-10 10:28:28,895 INFO L226 Difference]: Without dead ends: 253 [2018-11-10 10:28:28,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=256, Invalid=1241, Unknown=5, NotChecked=390, Total=1892 [2018-11-10 10:28:28,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-11-10 10:28:28,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-11-10 10:28:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-10 10:28:28,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 294 transitions. [2018-11-10 10:28:28,900 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 294 transitions. Word has length 32 [2018-11-10 10:28:28,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:28:28,901 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 294 transitions. [2018-11-10 10:28:28,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-10 10:28:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 294 transitions. [2018-11-10 10:28:28,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 10:28:28,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:28:28,902 INFO L375 BasicCegarLoop]: trace histogram [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-11-10 10:28:28,902 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:28:28,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:28,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1645288596, now seen corresponding path program 1 times [2018-11-10 10:28:28,903 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:28:28,903 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:28:28,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:29,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:29,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-10 10:28:29,143 INFO L477 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-11-10 10:28:29,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:29,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:29,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:29,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:11, output treesize:3 [2018-11-10 10:28:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:28:29,248 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:28:29,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:28:29,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:28:29,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:28:29,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:28:29,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:28:29,250 INFO L87 Difference]: Start difference. First operand 253 states and 294 transitions. Second operand 8 states. [2018-11-10 10:28:30,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:30,165 INFO L93 Difference]: Finished difference Result 252 states and 292 transitions. [2018-11-10 10:28:30,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:28:30,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-10 10:28:30,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:28:30,167 INFO L225 Difference]: With dead ends: 252 [2018-11-10 10:28:30,167 INFO L226 Difference]: Without dead ends: 252 [2018-11-10 10:28:30,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:28:30,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-10 10:28:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2018-11-10 10:28:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-11-10 10:28:30,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 292 transitions. [2018-11-10 10:28:30,171 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 292 transitions. Word has length 34 [2018-11-10 10:28:30,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:28:30,171 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 292 transitions. [2018-11-10 10:28:30,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:28:30,171 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 292 transitions. [2018-11-10 10:28:30,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 10:28:30,172 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:28:30,172 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:30,172 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:28:30,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:30,172 INFO L82 PathProgramCache]: Analyzing trace with hash 574377974, now seen corresponding path program 1 times [2018-11-10 10:28:30,173 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:28:30,173 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:28:30,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:30,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:30,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-10 10:28:30,346 INFO L477 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-11-10 10:28:30,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:30,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:30,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-10 10:28:30,354 INFO L477 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-11-10 10:28:30,354 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:30,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:30,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:30,355 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:1 [2018-11-10 10:28:30,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:28:30,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:30,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:30,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-10 10:28:30,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:28:30,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:28:30,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:30,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:30,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:28:30,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:28:30,412 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:30,415 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:30,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:30,422 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-11-10 10:28:30,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:28:30,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:28:30,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:30,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:30,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:28:30,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:28:30,453 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:30,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:30,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:30,461 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:14 [2018-11-10 10:28:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 10:28:30,473 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:28:30,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:28:30,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:28:30,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:28:30,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:28:30,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:28:30,476 INFO L87 Difference]: Start difference. First operand 252 states and 292 transitions. Second operand 5 states. [2018-11-10 10:28:31,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:31,138 INFO L93 Difference]: Finished difference Result 251 states and 290 transitions. [2018-11-10 10:28:31,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:28:31,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-11-10 10:28:31,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:28:31,140 INFO L225 Difference]: With dead ends: 251 [2018-11-10 10:28:31,140 INFO L226 Difference]: Without dead ends: 251 [2018-11-10 10:28:31,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:28:31,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-10 10:28:31,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-11-10 10:28:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-10 10:28:31,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 290 transitions. [2018-11-10 10:28:31,142 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 290 transitions. Word has length 36 [2018-11-10 10:28:31,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:28:31,142 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 290 transitions. [2018-11-10 10:28:31,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:28:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 290 transitions. [2018-11-10 10:28:31,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 10:28:31,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:28:31,143 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:31,143 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:28:31,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:31,143 INFO L82 PathProgramCache]: Analyzing trace with hash -782101764, now seen corresponding path program 1 times [2018-11-10 10:28:31,144 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:28:31,144 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:28:31,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:31,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:28:31,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:28:31,292 INFO L477 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 14 treesize of output 9 [2018-11-10 10:28:31,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:31,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:31,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:3 [2018-11-10 10:28:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:28:31,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:28:31,301 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/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-11-10 10:28:31,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:31,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:28:31,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:28:31,356 INFO L477 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 14 treesize of output 9 [2018-11-10 10:28:31,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:31,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:31,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:3 [2018-11-10 10:28:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:28:31,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 10:28:31,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 6 [2018-11-10 10:28:31,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:28:31,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:28:31,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:28:31,383 INFO L87 Difference]: Start difference. First operand 251 states and 290 transitions. Second operand 7 states. [2018-11-10 10:28:32,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:32,595 INFO L93 Difference]: Finished difference Result 425 states and 451 transitions. [2018-11-10 10:28:32,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 10:28:32,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-11-10 10:28:32,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:28:32,596 INFO L225 Difference]: With dead ends: 425 [2018-11-10 10:28:32,596 INFO L226 Difference]: Without dead ends: 425 [2018-11-10 10:28:32,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 140 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:28:32,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-11-10 10:28:32,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 283. [2018-11-10 10:28:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-11-10 10:28:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 326 transitions. [2018-11-10 10:28:32,600 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 326 transitions. Word has length 38 [2018-11-10 10:28:32,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:28:32,600 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 326 transitions. [2018-11-10 10:28:32,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:28:32,600 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 326 transitions. [2018-11-10 10:28:32,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 10:28:32,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:28:32,601 INFO L375 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] [2018-11-10 10:28:32,601 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:28:32,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:32,601 INFO L82 PathProgramCache]: Analyzing trace with hash -2073545896, now seen corresponding path program 1 times [2018-11-10 10:28:32,601 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:28:32,602 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:28:32,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:32,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:32,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-10 10:28:32,848 INFO L477 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-11-10 10:28:32,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:32,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:32,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:32,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:11, output treesize:3 [2018-11-10 10:28:32,970 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:28:32,970 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:28:32,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:28:32,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 10:28:32,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:28:32,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:28:32,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:28:32,973 INFO L87 Difference]: Start difference. First operand 283 states and 326 transitions. Second operand 9 states. [2018-11-10 10:28:33,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:33,983 INFO L93 Difference]: Finished difference Result 300 states and 345 transitions. [2018-11-10 10:28:33,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 10:28:33,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-10 10:28:33,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:28:33,985 INFO L225 Difference]: With dead ends: 300 [2018-11-10 10:28:33,985 INFO L226 Difference]: Without dead ends: 300 [2018-11-10 10:28:33,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-10 10:28:33,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-11-10 10:28:33,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 282. [2018-11-10 10:28:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-11-10 10:28:33,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 324 transitions. [2018-11-10 10:28:33,988 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 324 transitions. Word has length 38 [2018-11-10 10:28:33,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:28:33,988 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 324 transitions. [2018-11-10 10:28:33,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:28:33,988 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 324 transitions. [2018-11-10 10:28:33,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 10:28:33,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:28:33,988 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:33,989 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:28:33,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:33,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1524649222, now seen corresponding path program 1 times [2018-11-10 10:28:33,989 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:28:33,989 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:28:34,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:34,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:34,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:28:34,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:28:34,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-10 10:28:34,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:34,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-11-10 10:28:34,353 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:34,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-11-10 10:28:34,405 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 10:28:34,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-11-10 10:28:34,456 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:50 [2018-11-10 10:28:34,633 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 19 [2018-11-10 10:28:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:28:34,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:28:34,758 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:28:34,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:34,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:28:34,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:28:35,177 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 50 [2018-11-10 10:28:35,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 13 dim-0 vars, End of recursive call: 13 dim-0 vars, and 8 xjuncts. [2018-11-10 10:28:35,718 INFO L477 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 28 treesize of output 32 [2018-11-10 10:28:35,719 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 10:28:36,270 INFO L477 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 30 treesize of output 34 [2018-11-10 10:28:36,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 10:28:36,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: 19 dim-0 vars, and 12 xjuncts. [2018-11-10 10:28:36,868 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:91, output treesize:351 [2018-11-10 10:28:37,971 WARN L179 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 47 [2018-11-10 10:28:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:28:38,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 10:28:38,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 10, 10] total 23 [2018-11-10 10:28:38,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 10:28:38,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 10:28:38,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2018-11-10 10:28:38,324 INFO L87 Difference]: Start difference. First operand 282 states and 324 transitions. Second operand 24 states. [2018-11-10 10:28:38,556 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-11-10 10:28:38,952 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2018-11-10 10:28:41,502 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2018-11-10 10:28:43,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:43,780 INFO L93 Difference]: Finished difference Result 569 states and 603 transitions. [2018-11-10 10:28:43,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 10:28:43,781 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 39 [2018-11-10 10:28:43,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:28:43,783 INFO L225 Difference]: With dead ends: 569 [2018-11-10 10:28:43,783 INFO L226 Difference]: Without dead ends: 569 [2018-11-10 10:28:43,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=414, Invalid=992, Unknown=0, NotChecked=0, Total=1406 [2018-11-10 10:28:43,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-11-10 10:28:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 284. [2018-11-10 10:28:43,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-11-10 10:28:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 324 transitions. [2018-11-10 10:28:43,789 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 324 transitions. Word has length 39 [2018-11-10 10:28:43,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:28:43,789 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 324 transitions. [2018-11-10 10:28:43,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 10:28:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 324 transitions. [2018-11-10 10:28:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 10:28:43,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:28:43,790 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 10:28:43,790 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:28:43,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:43,790 INFO L82 PathProgramCache]: Analyzing trace with hash 187221690, now seen corresponding path program 1 times [2018-11-10 10:28:43,791 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:28:43,791 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:28:43,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:44,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:44,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-10 10:28:44,168 INFO L477 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-11-10 10:28:44,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-10 10:28:44,183 INFO L477 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-11-10 10:28:44,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,184 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,186 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:18, output treesize:3 [2018-11-10 10:28:44,197 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:28:44,198 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:28:44,199 INFO L477 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-11-10 10:28:44,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,216 INFO L477 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-11-10 10:28:44,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:19 [2018-11-10 10:28:44,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:28:44,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:28:44,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:28:44,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:28:44,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,290 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,306 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2018-11-10 10:28:44,367 INFO L477 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 27 treesize of output 28 [2018-11-10 10:28:44,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:28:44,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,416 INFO L477 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 48 treesize of output 44 [2018-11-10 10:28:44,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:28:44,419 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,449 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:63, output treesize:25 [2018-11-10 10:28:44,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 10:28:44,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 10:28:44,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,488 INFO L477 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-11-10 10:28:44,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 10:28:44,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,495 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:44,502 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2018-11-10 10:28:44,519 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:28:44,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:28:44,957 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-10 10:28:45,432 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-10 10:28:46,432 WARN L179 SmtUtils]: Spent 994.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-10 10:28:46,437 INFO L477 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 81 treesize of output 73 [2018-11-10 10:28:46,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2018-11-10 10:28:46,442 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:46,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:46,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 73 [2018-11-10 10:28:46,466 INFO L477 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 69 treesize of output 61 [2018-11-10 10:28:46,466 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:46,479 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:46,487 INFO L477 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 139 treesize of output 131 [2018-11-10 10:28:46,494 INFO L477 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 69 treesize of output 61 [2018-11-10 10:28:46,495 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:46,538 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:48,010 INFO L477 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 43 treesize of output 39 [2018-11-10 10:28:48,013 INFO L477 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 35 treesize of output 31 [2018-11-10 10:28:48,013 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:48,024 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:48,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-11-10 10:28:48,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-11-10 10:28:48,031 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:48,045 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:49,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 72 treesize of output 65 [2018-11-10 10:28:49,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:28:49,562 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:49,621 INFO L477 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 48 treesize of output 48 [2018-11-10 10:28:49,625 INFO L477 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 44 treesize of output 35 [2018-11-10 10:28:49,625 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:49,635 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:49,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 10:28:49,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:49,642 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:49,650 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:49,700 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 10:28:49,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 83 treesize of output 76 [2018-11-10 10:28:49,779 INFO L477 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 9 treesize of output 8 [2018-11-10 10:28:49,779 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:49,862 INFO L477 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 56 treesize of output 60 [2018-11-10 10:28:49,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-11-10 10:28:49,867 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:49,914 INFO L477 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 52 treesize of output 47 [2018-11-10 10:28:49,914 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:49,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2018-11-10 10:28:49,956 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:49,985 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 10:28:49,989 INFO L477 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-11-10 10:28:49,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:49,992 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:50,003 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:50,084 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-11-10 10:28:50,095 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 76 [2018-11-10 10:28:50,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:28:50,158 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:50,217 INFO L477 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 21 treesize of output 19 [2018-11-10 10:28:50,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:50,221 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:50,231 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:50,239 INFO L477 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 55 [2018-11-10 10:28:50,244 INFO L477 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 45 treesize of output 43 [2018-11-10 10:28:50,244 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:50,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:50,267 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:50,273 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:50,320 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-10 10:28:52,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 70 treesize of output 47 [2018-11-10 10:28:52,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:28:52,436 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:52,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 10:28:52,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:52,491 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:52,500 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:52,504 INFO L477 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 22 treesize of output 20 [2018-11-10 10:28:52,511 INFO L477 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 5 [2018-11-10 10:28:52,511 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:52,521 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:52,565 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 10:28:52,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 42 [2018-11-10 10:28:52,624 INFO L477 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 9 treesize of output 8 [2018-11-10 10:28:52,624 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:52,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 10:28:52,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:52,672 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:52,681 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:52,696 INFO L477 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 22 treesize of output 24 [2018-11-10 10:28:52,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-10 10:28:52,700 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:52,760 INFO L477 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 16 treesize of output 9 [2018-11-10 10:28:52,762 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:52,766 INFO L267 ElimStorePlain]: Start of recursive call 43: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:52,778 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:28:52,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 123 treesize of output 68 [2018-11-10 10:28:52,960 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-11-10 10:28:52,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:28:52,964 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:53,036 INFO L477 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-11-10 10:28:53,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:53,039 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:53,045 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:53,061 INFO L477 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 22 treesize of output 24 [2018-11-10 10:28:53,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-10 10:28:53,066 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:53,095 INFO L477 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 13 treesize of output 9 [2018-11-10 10:28:53,097 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:53,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2018-11-10 10:28:53,141 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 2 xjuncts. [2018-11-10 10:28:53,155 INFO L267 ElimStorePlain]: Start of recursive call 50: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:28:53,207 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-11-10 10:28:53,214 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 42 [2018-11-10 10:28:53,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:28:53,271 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:53,337 INFO L477 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 19 [2018-11-10 10:28:53,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:53,341 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:53,351 INFO L477 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 9 treesize of output 5 [2018-11-10 10:28:53,353 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:53,355 INFO L267 ElimStorePlain]: Start of recursive call 56: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:53,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 10:28:53,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:53,360 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:53,366 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:53,379 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:28:54,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 35 treesize of output 28 [2018-11-10 10:28:55,019 INFO L477 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 9 treesize of output 8 [2018-11-10 10:28:55,019 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:55,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 10:28:55,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:55,050 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:55,055 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:55,068 INFO L477 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 16 treesize of output 20 [2018-11-10 10:28:55,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-11-10 10:28:55,071 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:55,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-10 10:28:55,089 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:55,102 INFO L477 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 12 treesize of output 7 [2018-11-10 10:28:55,103 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:55,105 INFO L267 ElimStorePlain]: Start of recursive call 65: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:55,113 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:28:55,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 33 [2018-11-10 10:28:55,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:28:55,151 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:55,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 10:28:55,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:55,181 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:55,187 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:55,189 INFO L477 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 16 treesize of output 16 [2018-11-10 10:28:55,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-10 10:28:55,191 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:55,196 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:55,217 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 10:28:55,223 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-11-10 10:28:55,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:28:55,254 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:55,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 10:28:55,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:55,285 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:55,291 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:55,296 INFO L477 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 16 treesize of output 15 [2018-11-10 10:28:55,298 INFO L477 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 5 treesize of output 3 [2018-11-10 10:28:55,299 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:55,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:55,308 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:55,309 INFO L267 ElimStorePlain]: Start of recursive call 79: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:55,319 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:28:56,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 60 [2018-11-10 10:28:56,974 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2018-11-10 10:28:56,977 INFO L477 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 34 treesize of output 33 [2018-11-10 10:28:56,978 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:57,079 INFO L477 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 33 treesize of output 34 [2018-11-10 10:28:57,080 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:57,178 INFO L477 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 27 [2018-11-10 10:28:57,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:57,182 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:57,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 10:28:57,200 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:57,215 INFO L267 ElimStorePlain]: Start of recursive call 85: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:57,286 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-11-10 10:28:57,292 INFO L477 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 14 [2018-11-10 10:28:57,292 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:57,306 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:57,389 INFO L477 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 33 treesize of output 33 [2018-11-10 10:28:57,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-10 10:28:57,392 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:57,432 INFO L477 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 24 treesize of output 14 [2018-11-10 10:28:57,432 INFO L267 ElimStorePlain]: Start of recursive call 92: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:57,467 INFO L267 ElimStorePlain]: Start of recursive call 90: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 10:28:57,531 INFO L267 ElimStorePlain]: Start of recursive call 82: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-10 10:28:57,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2018-11-10 10:28:57,602 INFO L477 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 9 treesize of output 8 [2018-11-10 10:28:57,602 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:57,627 INFO L477 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 20 treesize of output 19 [2018-11-10 10:28:57,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:57,631 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:57,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-10 10:28:57,643 INFO L267 ElimStorePlain]: Start of recursive call 97: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:57,648 INFO L267 ElimStorePlain]: Start of recursive call 95: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:57,665 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:57,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 47 treesize of output 40 [2018-11-10 10:28:57,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:28:57,724 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:57,745 INFO L477 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 20 treesize of output 20 [2018-11-10 10:28:57,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-10 10:28:57,749 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:57,758 INFO L267 ElimStorePlain]: Start of recursive call 100: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:57,771 INFO L267 ElimStorePlain]: Start of recursive call 98: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:57,784 INFO L477 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 67 [2018-11-10 10:28:57,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:28:57,856 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:57,936 INFO L477 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 45 treesize of output 42 [2018-11-10 10:28:57,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:57,942 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:57,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:28:57,973 INFO L267 ElimStorePlain]: Start of recursive call 106: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:57,993 INFO L267 ElimStorePlain]: Start of recursive call 104: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:58,000 INFO L477 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 38 treesize of output 33 [2018-11-10 10:28:58,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:58,004 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:58,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-10 10:28:58,026 INFO L267 ElimStorePlain]: Start of recursive call 109: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:58,046 INFO L267 ElimStorePlain]: Start of recursive call 107: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:58,056 INFO L477 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 35 treesize of output 34 [2018-11-10 10:28:58,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:58,064 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:58,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:58,096 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:58,115 INFO L267 ElimStorePlain]: Start of recursive call 110: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:58,123 INFO L477 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 34 treesize of output 31 [2018-11-10 10:28:58,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:58,127 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:58,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:28:58,153 INFO L267 ElimStorePlain]: Start of recursive call 115: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:58,170 INFO L267 ElimStorePlain]: Start of recursive call 113: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:58,272 INFO L267 ElimStorePlain]: Start of recursive call 102: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-10 10:28:58,282 INFO L477 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 59 treesize of output 52 [2018-11-10 10:28:58,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:28:58,329 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:58,354 INFO L477 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 17 treesize of output 16 [2018-11-10 10:28:58,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:58,357 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:58,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:58,367 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:58,370 INFO L267 ElimStorePlain]: Start of recursive call 118: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:58,381 INFO L267 ElimStorePlain]: Start of recursive call 116: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:58,395 INFO L477 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 50 treesize of output 43 [2018-11-10 10:28:58,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:28:58,442 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:58,463 INFO L477 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 20 treesize of output 19 [2018-11-10 10:28:58,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:58,466 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:58,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-10 10:28:58,477 INFO L267 ElimStorePlain]: Start of recursive call 125: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:58,481 INFO L267 ElimStorePlain]: Start of recursive call 123: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:58,493 INFO L267 ElimStorePlain]: Start of recursive call 121: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:58,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-11-10 10:28:58,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:28:58,544 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:58,564 INFO L477 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 27 treesize of output 24 [2018-11-10 10:28:58,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:58,567 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:58,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 10:28:58,579 INFO L267 ElimStorePlain]: Start of recursive call 130: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:58,588 INFO L267 ElimStorePlain]: Start of recursive call 128: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:58,598 INFO L267 ElimStorePlain]: Start of recursive call 126: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:58,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2018-11-10 10:28:58,851 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2018-11-10 10:28:58,854 INFO L477 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 30 treesize of output 29 [2018-11-10 10:28:58,855 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:58,940 INFO L477 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 31 treesize of output 30 [2018-11-10 10:28:58,940 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:59,019 INFO L477 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 30 treesize of output 26 [2018-11-10 10:28:59,025 INFO L477 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 16 treesize of output 11 [2018-11-10 10:28:59,025 INFO L267 ElimStorePlain]: Start of recursive call 135: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:59,040 INFO L267 ElimStorePlain]: Start of recursive call 134: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:59,129 INFO L477 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 29 treesize of output 31 [2018-11-10 10:28:59,134 INFO L477 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 22 treesize of output 14 [2018-11-10 10:28:59,134 INFO L267 ElimStorePlain]: Start of recursive call 137: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:59,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-11-10 10:28:59,164 INFO L267 ElimStorePlain]: Start of recursive call 138: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:59,191 INFO L267 ElimStorePlain]: Start of recursive call 136: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 10:28:59,270 INFO L477 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 29 treesize of output 25 [2018-11-10 10:28:59,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:59,273 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:59,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-10 10:28:59,291 INFO L267 ElimStorePlain]: Start of recursive call 141: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:59,306 INFO L267 ElimStorePlain]: Start of recursive call 139: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:59,370 INFO L267 ElimStorePlain]: Start of recursive call 131: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-10 10:28:59,380 INFO L477 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 50 [2018-11-10 10:28:59,428 INFO L477 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 9 treesize of output 8 [2018-11-10 10:28:59,429 INFO L267 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:59,451 INFO L477 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 27 treesize of output 24 [2018-11-10 10:28:59,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 10:28:59,455 INFO L267 ElimStorePlain]: Start of recursive call 145: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:59,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:59,471 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:59,480 INFO L267 ElimStorePlain]: Start of recursive call 144: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:59,494 INFO L267 ElimStorePlain]: Start of recursive call 142: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:59,508 INFO L477 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 93 treesize of output 70 [2018-11-10 10:28:59,584 INFO L477 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 9 treesize of output 8 [2018-11-10 10:28:59,585 INFO L267 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:59,663 INFO L477 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 38 treesize of output 33 [2018-11-10 10:28:59,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:59,667 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:59,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-10 10:28:59,689 INFO L267 ElimStorePlain]: Start of recursive call 151: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:59,706 INFO L267 ElimStorePlain]: Start of recursive call 149: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:59,713 INFO L477 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 34 treesize of output 31 [2018-11-10 10:28:59,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:59,718 INFO L267 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:59,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:28:59,742 INFO L267 ElimStorePlain]: Start of recursive call 154: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:59,758 INFO L267 ElimStorePlain]: Start of recursive call 152: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:59,765 INFO L477 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 35 treesize of output 34 [2018-11-10 10:28:59,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:59,770 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:59,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:59,797 INFO L267 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:59,813 INFO L267 ElimStorePlain]: Start of recursive call 155: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:59,821 INFO L477 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 45 treesize of output 42 [2018-11-10 10:28:59,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:28:59,826 INFO L267 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:59,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:28:59,854 INFO L267 ElimStorePlain]: Start of recursive call 160: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:59,874 INFO L267 ElimStorePlain]: Start of recursive call 158: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:28:59,976 INFO L267 ElimStorePlain]: Start of recursive call 147: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-10 10:28:59,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 47 treesize of output 40 [2018-11-10 10:29:00,028 INFO L477 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 9 treesize of output 8 [2018-11-10 10:29:00,028 INFO L267 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:00,051 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2018-11-10 10:29:00,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-10 10:29:00,054 INFO L267 ElimStorePlain]: Start of recursive call 164: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:00,062 INFO L267 ElimStorePlain]: Start of recursive call 163: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:00,075 INFO L267 ElimStorePlain]: Start of recursive call 161: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:00,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 78 [2018-11-10 10:29:00,489 WARN L179 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-11-10 10:29:00,494 INFO L477 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 42 treesize of output 41 [2018-11-10 10:29:00,494 INFO L267 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:00,499 INFO L477 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 52 treesize of output 51 [2018-11-10 10:29:00,500 INFO L267 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:00,504 INFO L477 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 45 treesize of output 44 [2018-11-10 10:29:00,505 INFO L267 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:00,509 INFO L477 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 41 treesize of output 40 [2018-11-10 10:29:00,510 INFO L267 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:00,927 INFO L477 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 44 treesize of output 45 [2018-11-10 10:29:00,927 INFO L267 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:00,932 INFO L477 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 42 treesize of output 41 [2018-11-10 10:29:00,932 INFO L267 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:00,940 INFO L477 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 41 treesize of output 42 [2018-11-10 10:29:00,941 INFO L267 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:01,309 INFO L477 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 41 treesize of output 35 [2018-11-10 10:29:01,316 INFO L477 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-11-10 10:29:01,317 INFO L267 ElimStorePlain]: Start of recursive call 174: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:01,337 INFO L267 ElimStorePlain]: Start of recursive call 173: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:01,342 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-11-10 10:29:01,348 INFO L477 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 21 [2018-11-10 10:29:01,349 INFO L267 ElimStorePlain]: Start of recursive call 176: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:01,369 INFO L267 ElimStorePlain]: Start of recursive call 175: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:01,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-10 10:29:01,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-10 10:29:01,380 INFO L267 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:01,401 INFO L267 ElimStorePlain]: Start of recursive call 177: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:01,724 INFO L477 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 40 treesize of output 34 [2018-11-10 10:29:01,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:29:01,729 INFO L267 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:01,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:29:01,753 INFO L267 ElimStorePlain]: Start of recursive call 181: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:01,775 INFO L267 ElimStorePlain]: Start of recursive call 179: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:01,785 INFO L477 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 44 treesize of output 36 [2018-11-10 10:29:01,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:29:01,790 INFO L267 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:01,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-10 10:29:01,821 INFO L267 ElimStorePlain]: Start of recursive call 184: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:01,843 INFO L267 ElimStorePlain]: Start of recursive call 182: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:01,866 INFO L477 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 38 treesize of output 42 [2018-11-10 10:29:01,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-11-10 10:29:01,873 INFO L267 ElimStorePlain]: Start of recursive call 186: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:01,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-10 10:29:01,944 INFO L267 ElimStorePlain]: Start of recursive call 187: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:02,015 INFO L477 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 22 [2018-11-10 10:29:02,015 INFO L267 ElimStorePlain]: Start of recursive call 188: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:02,045 INFO L267 ElimStorePlain]: Start of recursive call 185: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:02,389 INFO L477 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 40 treesize of output 40 [2018-11-10 10:29:02,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-10 10:29:02,394 INFO L267 ElimStorePlain]: Start of recursive call 190: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:02,450 INFO L477 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 31 treesize of output 21 [2018-11-10 10:29:02,450 INFO L267 ElimStorePlain]: Start of recursive call 191: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:02,495 INFO L267 ElimStorePlain]: Start of recursive call 189: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 10:29:02,515 INFO L477 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 44 treesize of output 42 [2018-11-10 10:29:02,522 INFO L477 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 33 treesize of output 21 [2018-11-10 10:29:02,522 INFO L267 ElimStorePlain]: Start of recursive call 193: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:02,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-10 10:29:02,567 INFO L267 ElimStorePlain]: Start of recursive call 194: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:02,611 INFO L267 ElimStorePlain]: Start of recursive call 192: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 10:29:02,958 INFO L267 ElimStorePlain]: Start of recursive call 165: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 8 dim-0 vars, and 9 xjuncts. [2018-11-10 10:29:02,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 52 treesize of output 45 [2018-11-10 10:29:03,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:29:03,027 INFO L267 ElimStorePlain]: Start of recursive call 196: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:03,053 INFO L477 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 8 treesize of output 6 [2018-11-10 10:29:03,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:29:03,056 INFO L267 ElimStorePlain]: Start of recursive call 198: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:03,060 INFO L267 ElimStorePlain]: Start of recursive call 197: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:03,079 INFO L267 ElimStorePlain]: Start of recursive call 195: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:03,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 65 [2018-11-10 10:29:03,340 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2018-11-10 10:29:03,343 INFO L477 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 35 treesize of output 34 [2018-11-10 10:29:03,344 INFO L267 ElimStorePlain]: Start of recursive call 200: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:03,440 INFO L477 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 34 treesize of output 35 [2018-11-10 10:29:03,440 INFO L267 ElimStorePlain]: Start of recursive call 201: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:03,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-11-10 10:29:03,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-10 10:29:03,529 INFO L267 ElimStorePlain]: Start of recursive call 203: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:03,544 INFO L267 ElimStorePlain]: Start of recursive call 202: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:03,636 INFO L477 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 31 treesize of output 35 [2018-11-10 10:29:03,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-10 10:29:03,640 INFO L267 ElimStorePlain]: Start of recursive call 205: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:03,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-10 10:29:03,691 INFO L267 ElimStorePlain]: Start of recursive call 206: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:03,739 INFO L477 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 27 treesize of output 15 [2018-11-10 10:29:03,739 INFO L267 ElimStorePlain]: Start of recursive call 207: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:03,761 INFO L267 ElimStorePlain]: Start of recursive call 204: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:03,798 INFO L267 ElimStorePlain]: Start of recursive call 199: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:08,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: 74 dim-0 vars, and 40 xjuncts. [2018-11-10 10:29:08,464 INFO L202 ElimStorePlain]: Needed 207 recursive calls to eliminate 13 variables, input treesize:276, output treesize:637 [2018-11-10 10:29:10,034 WARN L179 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 312 DAG size of output: 19 [2018-11-10 10:29:10,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-11-10 10:29:10,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-11-10 10:29:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:10,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:29:10,060 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:29:10,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:10,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:10,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:10,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:10,137 INFO L477 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-11-10 10:29:10,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,156 INFO L477 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-11-10 10:29:10,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:19 [2018-11-10 10:29:10,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:29:10,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:29:10,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:29:10,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:29:10,223 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,227 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,244 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2018-11-10 10:29:10,262 INFO L477 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 27 treesize of output 28 [2018-11-10 10:29:10,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:29:10,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,307 INFO L477 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 48 treesize of output 44 [2018-11-10 10:29:10,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:29:10,311 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,343 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:63, output treesize:25 [2018-11-10 10:29:10,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 10:29:10,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 10:29:10,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,365 INFO L477 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-11-10 10:29:10,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 10:29:10,367 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,373 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:10,382 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2018-11-10 10:29:10,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:10,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:29:12,034 WARN L179 SmtUtils]: Spent 1.45 s on a formula simplification that was a NOOP. DAG size: 106 [2018-11-10 10:29:12,052 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 76 [2018-11-10 10:29:12,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:29:12,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:12,204 INFO L477 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 55 [2018-11-10 10:29:12,210 INFO L477 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 45 treesize of output 43 [2018-11-10 10:29:12,211 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:12,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:29:12,239 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:12,247 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:12,251 INFO L477 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 21 treesize of output 19 [2018-11-10 10:29:12,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:29:12,255 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:12,267 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:12,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-10 10:29:12,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 72 treesize of output 65 [2018-11-10 10:29:12,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:29:12,419 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:12,491 INFO L477 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 48 treesize of output 48 [2018-11-10 10:29:12,497 INFO L477 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 44 treesize of output 35 [2018-11-10 10:29:12,497 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:12,513 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:12,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 10:29:12,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:29:12,522 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:12,533 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:12,596 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 10:29:12,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 83 treesize of output 76 [2018-11-10 10:29:12,698 INFO L477 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 9 treesize of output 8 [2018-11-10 10:29:12,698 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:12,780 INFO L477 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-11-10 10:29:12,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:29:12,784 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:12,796 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:12,826 INFO L477 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 56 treesize of output 60 [2018-11-10 10:29:12,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2018-11-10 10:29:12,832 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:12,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-11-10 10:29:12,893 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:12,955 INFO L477 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 52 treesize of output 47 [2018-11-10 10:29:12,955 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:13,002 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 10:29:13,086 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-11-10 10:29:13,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 143 treesize of output 120 [2018-11-10 10:29:13,391 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2018-11-10 10:29:13,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:29:13,397 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:13,559 INFO L477 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 60 treesize of output 64 [2018-11-10 10:29:13,567 INFO L477 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 59 treesize of output 53 [2018-11-10 10:29:13,567 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:13,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 56 [2018-11-10 10:29:13,681 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 10:29:13,806 INFO L477 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 53 treesize of output 51 [2018-11-10 10:29:13,807 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:13,930 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 10:29:13,964 INFO L477 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 60 treesize of output 64 [2018-11-10 10:29:13,971 INFO L477 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 59 treesize of output 53 [2018-11-10 10:29:13,971 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:14,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 56 [2018-11-10 10:29:14,072 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 10:29:14,176 INFO L477 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 53 treesize of output 51 [2018-11-10 10:29:14,177 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:14,286 INFO L267 ElimStorePlain]: Start of recursive call 29: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 10:29:14,329 INFO L477 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 95 treesize of output 97 [2018-11-10 10:29:14,335 INFO L477 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 92 treesize of output 88 [2018-11-10 10:29:14,336 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:14,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 87 [2018-11-10 10:29:14,458 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 10:29:14,567 INFO L477 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 88 treesize of output 82 [2018-11-10 10:29:14,567 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:14,679 INFO L267 ElimStorePlain]: Start of recursive call 33: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 10:29:14,683 INFO L477 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 23 [2018-11-10 10:29:14,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:29:14,687 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:14,707 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:15,374 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 20 dim-0 vars, and 32 xjuncts. [2018-11-10 10:29:23,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-11-10 10:29:23,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-11-10 10:29:23,241 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:23,258 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:23,262 INFO L477 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 43 treesize of output 39 [2018-11-10 10:29:23,265 INFO L477 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 35 treesize of output 31 [2018-11-10 10:29:23,266 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:23,279 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:30,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 35 treesize of output 28 [2018-11-10 10:29:30,484 INFO L477 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 9 treesize of output 8 [2018-11-10 10:29:30,484 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:30,533 INFO L477 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 16 treesize of output 20 [2018-11-10 10:29:30,538 INFO L477 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 12 treesize of output 7 [2018-11-10 10:29:30,539 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:30,544 INFO L267 ElimStorePlain]: Start of recursive call 45: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:30,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 10:29:30,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:29:30,550 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:30,557 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:30,569 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:29:30,575 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-11-10 10:29:30,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:29:30,613 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:30,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 10:29:30,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:29:30,653 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:30,660 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:30,665 INFO L477 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 16 treesize of output 15 [2018-11-10 10:29:30,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:29:30,669 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:30,677 INFO L477 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 5 treesize of output 3 [2018-11-10 10:29:30,678 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:30,680 INFO L267 ElimStorePlain]: Start of recursive call 53: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:30,692 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:29:30,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 33 [2018-11-10 10:29:30,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:29:30,744 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:30,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 10:29:30,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:29:30,784 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:30,792 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:30,795 INFO L477 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 16 treesize of output 16 [2018-11-10 10:29:30,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-10 10:29:30,798 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:30,805 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:30,834 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 10:29:36,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 81 treesize of output 58 [2018-11-10 10:29:36,099 INFO L477 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 9 treesize of output 8 [2018-11-10 10:29:36,099 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:36,164 INFO L477 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 22 treesize of output 24 [2018-11-10 10:29:36,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-10 10:29:36,172 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:36,225 INFO L477 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 16 treesize of output 9 [2018-11-10 10:29:36,226 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:36,231 INFO L267 ElimStorePlain]: Start of recursive call 64: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:36,234 INFO L477 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-11-10 10:29:36,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:29:36,237 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:36,243 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:36,257 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:29:36,262 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 58 [2018-11-10 10:29:36,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:29:36,322 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:36,386 INFO L477 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 19 [2018-11-10 10:29:36,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:29:36,392 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:36,405 INFO L477 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 9 treesize of output 5 [2018-11-10 10:29:36,407 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:36,410 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:36,412 INFO L477 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 21 treesize of output 19 [2018-11-10 10:29:36,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:29:36,418 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:36,425 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:36,439 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:29:36,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 70 treesize of output 47 [2018-11-10 10:29:36,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:29:36,503 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:36,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 10:29:36,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:29:36,550 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:36,556 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:36,559 INFO L477 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 22 treesize of output 20 [2018-11-10 10:29:36,564 INFO L477 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 5 [2018-11-10 10:29:36,564 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:36,572 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:36,615 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 10:29:41,087 INFO L477 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 11 treesize of output 9 [2018-11-10 10:29:41,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-10 10:29:41,089 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:41,091 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:41,093 INFO L477 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 11 treesize of output 9 [2018-11-10 10:29:41,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-10 10:29:41,095 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:41,097 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:41,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 55 [2018-11-10 10:29:41,982 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2018-11-10 10:29:41,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 26 [2018-11-10 10:29:41,985 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:42,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-10 10:29:42,050 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:42,115 INFO L477 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 22 [2018-11-10 10:29:42,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:29:42,118 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:42,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-10 10:29:42,131 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:42,143 INFO L267 ElimStorePlain]: Start of recursive call 89: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:42,199 INFO L477 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 27 treesize of output 23 [2018-11-10 10:29:42,213 INFO L477 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 1 case distinctions, treesize of input 16 treesize of output 16 [2018-11-10 10:29:42,213 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 10:29:42,239 INFO L267 ElimStorePlain]: Start of recursive call 92: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 10:29:42,327 INFO L477 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 26 treesize of output 28 [2018-11-10 10:29:42,340 INFO L477 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 1 case distinctions, treesize of input 19 treesize of output 19 [2018-11-10 10:29:42,340 INFO L267 ElimStorePlain]: Start of recursive call 95: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 10:29:42,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-10 10:29:42,377 INFO L267 ElimStorePlain]: Start of recursive call 96: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:42,413 INFO L267 ElimStorePlain]: Start of recursive call 94: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 10:29:42,487 INFO L267 ElimStorePlain]: Start of recursive call 86: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-10 10:29:42,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 44 treesize of output 37 [2018-11-10 10:29:42,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:29:42,536 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:42,554 INFO L477 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 8 treesize of output 6 [2018-11-10 10:29:42,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 10:29:42,556 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:42,559 INFO L267 ElimStorePlain]: Start of recursive call 99: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:42,570 INFO L267 ElimStorePlain]: Start of recursive call 97: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:42,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 32 [2018-11-10 10:29:42,613 INFO L477 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 9 treesize of output 8 [2018-11-10 10:29:42,613 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:42,641 INFO L477 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 1 case distinctions, treesize of input 20 treesize of output 24 [2018-11-10 10:29:42,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-11-10 10:29:42,655 INFO L267 ElimStorePlain]: Start of recursive call 104: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 10:29:42,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-10 10:29:42,689 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:42,719 INFO L477 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 13 treesize of output 11 [2018-11-10 10:29:42,719 INFO L267 ElimStorePlain]: Start of recursive call 106: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:42,751 INFO L267 ElimStorePlain]: Start of recursive call 103: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 10:29:42,793 INFO L267 ElimStorePlain]: Start of recursive call 101: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 10:29:42,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 10 xjuncts. [2018-11-10 10:29:42,973 INFO L202 ElimStorePlain]: Needed 106 recursive calls to eliminate 13 variables, input treesize:276, output treesize:65 [2018-11-10 10:29:43,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-11-10 10:29:43,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:43,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:43,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-11-10 10:29:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:43,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 10:29:43,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8] total 13 [2018-11-10 10:29:43,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 10:29:43,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 10:29:43,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:29:43,053 INFO L87 Difference]: Start difference. First operand 284 states and 324 transitions. Second operand 14 states. [2018-11-10 10:29:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:48,465 INFO L93 Difference]: Finished difference Result 362 states and 412 transitions. [2018-11-10 10:29:48,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 10:29:48,468 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-11-10 10:29:48,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:48,469 INFO L225 Difference]: With dead ends: 362 [2018-11-10 10:29:48,469 INFO L226 Difference]: Without dead ends: 362 [2018-11-10 10:29:48,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 145 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-11-10 10:29:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-11-10 10:29:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 271. [2018-11-10 10:29:48,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-10 10:29:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 310 transitions. [2018-11-10 10:29:48,471 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 310 transitions. Word has length 40 [2018-11-10 10:29:48,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:48,471 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 310 transitions. [2018-11-10 10:29:48,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 10:29:48,471 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 310 transitions. [2018-11-10 10:29:48,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 10:29:48,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:48,472 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:48,472 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:29:48,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:48,472 INFO L82 PathProgramCache]: Analyzing trace with hash 679795530, now seen corresponding path program 1 times [2018-11-10 10:29:48,472 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:29:48,472 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fa7a5fe-0b96-47a2-9046-d36e986364c4/bin-2019/utaipan/cvc4nyu Starting monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:29:48,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:48,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:48,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:29:48,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:48,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:48,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-10 10:29:48,705 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:48,707 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:48,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 10:29:48,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:48,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:48,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:31 [2018-11-10 10:29:48,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:29:48,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:29:48,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:48,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:48,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:48,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:41 [2018-11-10 10:29:48,842 INFO L477 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 39 treesize of output 43 [2018-11-10 10:29:48,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:29:48,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:48,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:48,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:48,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:35 [2018-11-10 10:29:48,919 INFO L477 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 39 treesize of output 35 [2018-11-10 10:29:48,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11-10 10:29:48,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:48,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:48,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:48,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:29 [2018-11-10 10:29:49,029 INFO L477 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-11-10 10:29:49,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 10:29:49,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,045 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-11-10 10:29:49,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-11-10 10:29:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:49,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:29:56,569 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2018-11-10 10:29:58,586 WARN L832 $PredicateComparison]: unable to prove that (forall ((|main_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (v_subst_10 (_ BitVec 32)) (|main_write~$Pointer$_#value.base| (_ BitVec 32)) (v_subst_9 (_ BitVec 32))) (= (bvadd (select |c_#valid| (select (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_main_read~$Pointer$_#ptr.base|) |c_main_read~$Pointer$_#ptr.offset|))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |main_write~$Pointer$_#ptr.offset| |main_write~$Pointer$_#value.base|))))) (let ((.cse1 (select (select .cse0 c_main_~x~0.base) c_main_~x~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_subst_9 v_subst_10)))) c_main_~head~0.base) c_main_~head~0.offset)) (_ bv1 1)) (_ bv0 1))) is different from false [2018-11-10 10:29:58,769 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-10 10:29:58,795 INFO L477 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 157 treesize of output 102 [2018-11-10 10:29:58,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 10:29:58,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:59,105 INFO L477 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 78 [2018-11-10 10:29:59,110 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:29:59,110 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:00,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-10 10:30:00,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2018-11-10 10:30:00,252 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 10:30:00,314 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:30:01,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 44 [2018-11-10 10:30:01,239 INFO L477 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 24 treesize of output 38 [2018-11-10 10:30:01,240 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-10 10:30:01,317 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:30:02,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 51 [2018-11-10 10:30:02,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 54 [2018-11-10 10:30:02,536 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-10 10:30:02,717 INFO L477 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 5 case distinctions, treesize of input 46 treesize of output 75 [2018-11-10 10:30:02,718 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 8 xjuncts. [2018-11-10 10:30:02,866 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 10:30:04,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 73 [2018-11-10 10:30:04,447 INFO L477 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 41 treesize of output 39 [2018-11-10 10:30:04,447 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:30:07,796 INFO L477 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 40 treesize of output 34 [2018-11-10 10:30:07,796 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:10,917 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:30:10,917 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_prenex_558 term size 40 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) 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.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) 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.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-11-10 10:30:10,919 INFO L168 Benchmark]: Toolchain (without parser) took 255906.63 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 254.8 MB). Free memory was 945.5 MB in the beginning and 886.4 MB in the end (delta: 59.1 MB). Peak memory consumption was 313.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:30:10,920 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:30:10,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.07 ms. Allocated memory is still 1.0 GB. Free memory was 945.5 MB in the beginning and 924.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:30:10,920 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 924.0 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:30:10,920 INFO L168 Benchmark]: Boogie Preprocessor took 32.57 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-11-10 10:30:10,920 INFO L168 Benchmark]: RCFGBuilder took 809.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.2 MB). Peak memory consumption was 79.2 MB. Max. memory is 11.5 GB. [2018-11-10 10:30:10,920 INFO L168 Benchmark]: TraceAbstraction took 254649.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.5 MB). Free memory was 1.0 GB in the beginning and 886.4 MB in the end (delta: 157.7 MB). Peak memory consumption was 276.2 MB. Max. memory is 11.5 GB. [2018-11-10 10:30:10,921 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.07 ms. Allocated memory is still 1.0 GB. Free memory was 945.5 MB in the beginning and 924.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 924.0 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.57 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 809.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.2 MB). Peak memory consumption was 79.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 254649.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.5 MB). Free memory was 1.0 GB in the beginning and 886.4 MB in the end (delta: 157.7 MB). Peak memory consumption was 276.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_558 term size 40 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_558 term size 40: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...