./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b97bc973900e2f9596f533e03f1df56d5945f81 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 01:31:07,338 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:31:07,339 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:31:07,346 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:31:07,346 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:31:07,347 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:31:07,347 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:31:07,348 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:31:07,349 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:31:07,350 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:31:07,350 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:31:07,350 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:31:07,351 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:31:07,351 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:31:07,352 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:31:07,352 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:31:07,353 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:31:07,354 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:31:07,355 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:31:07,356 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:31:07,357 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:31:07,357 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:31:07,359 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:31:07,359 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:31:07,359 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:31:07,360 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:31:07,361 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:31:07,361 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:31:07,362 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:31:07,362 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:31:07,363 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:31:07,363 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:31:07,363 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:31:07,363 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:31:07,364 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:31:07,364 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:31:07,365 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 01:31:07,375 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:31:07,375 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:31:07,376 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:31:07,376 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:31:07,376 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 01:31:07,376 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 01:31:07,376 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 01:31:07,376 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 01:31:07,376 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 01:31:07,376 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 01:31:07,376 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 01:31:07,377 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 01:31:07,377 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 01:31:07,377 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:31:07,377 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:31:07,377 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:31:07,377 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:31:07,378 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:31:07,378 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:31:07,378 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:31:07,378 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:31:07,378 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:31:07,378 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:31:07,378 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:31:07,379 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:31:07,379 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:31:07,379 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:31:07,379 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:31:07,379 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:31:07,379 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:31:07,379 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:31:07,379 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:31:07,379 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:31:07,379 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 01:31:07,379 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:31:07,379 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:31:07,380 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 01:31:07,380 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_b3abe367-8628-4bcf-abdf-f143abbd63f3/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 ! call(__VERIFIER_error())) ) 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 -> 1b97bc973900e2f9596f533e03f1df56d5945f81 [2018-11-23 01:31:07,400 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:31:07,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:31:07,410 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:31:07,411 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:31:07,411 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:31:07,412 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/bin-2019/utaipan/../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-11-23 01:31:07,446 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/bin-2019/utaipan/data/8ec6bec77/5b85aba808ee4af39830919b1e449dfc/FLAG596bce985 [2018-11-23 01:31:07,889 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:31:07,890 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-11-23 01:31:07,899 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/bin-2019/utaipan/data/8ec6bec77/5b85aba808ee4af39830919b1e449dfc/FLAG596bce985 [2018-11-23 01:31:07,910 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/bin-2019/utaipan/data/8ec6bec77/5b85aba808ee4af39830919b1e449dfc [2018-11-23 01:31:07,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:31:07,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:31:07,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:31:07,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:31:07,917 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:31:07,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:31:07" (1/1) ... [2018-11-23 01:31:07,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5846bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:07, skipping insertion in model container [2018-11-23 01:31:07,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:31:07" (1/1) ... [2018-11-23 01:31:07,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:31:07,956 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:31:08,159 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:31:08,165 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:31:08,247 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:31:08,270 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:31:08,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:08 WrapperNode [2018-11-23 01:31:08,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:31:08,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:31:08,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:31:08,271 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:31:08,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:08" (1/1) ... [2018-11-23 01:31:08,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:08" (1/1) ... [2018-11-23 01:31:08,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:31:08,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:31:08,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:31:08,293 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:31:08,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:08" (1/1) ... [2018-11-23 01:31:08,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:08" (1/1) ... [2018-11-23 01:31:08,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:08" (1/1) ... [2018-11-23 01:31:08,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:08" (1/1) ... [2018-11-23 01:31:08,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:08" (1/1) ... [2018-11-23 01:31:08,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:08" (1/1) ... [2018-11-23 01:31:08,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:08" (1/1) ... [2018-11-23 01:31:08,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:31:08,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:31:08,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:31:08,315 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:31:08,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/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-23 01:31:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 01:31:08,346 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 01:31:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:31:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2018-11-23 01:31:08,346 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2018-11-23 01:31:08,347 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 01:31:08,347 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 01:31:08,347 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 01:31:08,347 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 01:31:08,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:31:08,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:31:08,347 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2018-11-23 01:31:08,347 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2018-11-23 01:31:08,347 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:31:08,348 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:31:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 01:31:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 01:31:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:31:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 01:31:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-11-23 01:31:08,348 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-11-23 01:31:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:31:08,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:31:08,621 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:31:08,621 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 01:31:08,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:31:08 BoogieIcfgContainer [2018-11-23 01:31:08,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:31:08,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:31:08,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:31:08,625 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:31:08,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:31:07" (1/3) ... [2018-11-23 01:31:08,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c1fa6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:31:08, skipping insertion in model container [2018-11-23 01:31:08,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:08" (2/3) ... [2018-11-23 01:31:08,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c1fa6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:31:08, skipping insertion in model container [2018-11-23 01:31:08,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:31:08" (3/3) ... [2018-11-23 01:31:08,628 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-11-23 01:31:08,633 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:31:08,638 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 01:31:08,646 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 01:31:08,663 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:31:08,663 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:31:08,663 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:31:08,664 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:31:08,664 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:31:08,664 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:31:08,664 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:31:08,664 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:31:08,674 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2018-11-23 01:31:08,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 01:31:08,679 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:31:08,680 INFO L402 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, 1, 1, 1] [2018-11-23 01:31:08,682 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:31:08,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:31:08,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1255392346, now seen corresponding path program 1 times [2018-11-23 01:31:08,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:31:08,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:31:08,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:31:08,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:31:08,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:31:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:31:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 01:31:08,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:31:08,785 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:31:08,786 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-23 01:31:08,787 INFO L202 CegarAbsIntRunner]: [1], [3], [5], [27], [29], [31], [34], [39], [42], [49], [55], [56], [62], [63], [78], [96], [98], [99], [100], [120], [122], [123], [157], [158], [159], [160], [161], [162], [167], [168], [175], [176], [177] [2018-11-23 01:31:08,811 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:31:08,811 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:31:08,882 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 01:31:08,883 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 24 variables. [2018-11-23 01:31:08,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:31:08,891 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 01:31:08,927 INFO L227 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 94.44% of their original sizes. [2018-11-23 01:31:08,927 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 01:31:08,931 INFO L415 sIntCurrentIteration]: We unified 36 AI predicates to 36 [2018-11-23 01:31:08,931 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 01:31:08,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:31:08,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [2] total 3 [2018-11-23 01:31:08,932 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:31:08,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:31:08,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:31:08,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:31:08,939 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 3 states. [2018-11-23 01:31:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:31:08,981 INFO L93 Difference]: Finished difference Result 135 states and 181 transitions. [2018-11-23 01:31:08,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:31:08,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 01:31:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:31:08,987 INFO L225 Difference]: With dead ends: 135 [2018-11-23 01:31:08,987 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 01:31:08,989 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 35 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-23 01:31:09,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 01:31:09,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-23 01:31:09,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 01:31:09,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2018-11-23 01:31:09,021 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 37 [2018-11-23 01:31:09,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:31:09,021 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2018-11-23 01:31:09,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:31:09,021 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2018-11-23 01:31:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 01:31:09,022 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:31:09,022 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:31:09,023 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:31:09,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:31:09,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1088704214, now seen corresponding path program 1 times [2018-11-23 01:31:09,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:31:09,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:31:09,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:31:09,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:31:09,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:31:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:31:09,162 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:31:09,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:31:09,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:31:09,163 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-11-23 01:31:09,163 INFO L202 CegarAbsIntRunner]: [1], [3], [5], [10], [13], [19], [29], [31], [34], [39], [42], [49], [55], [56], [62], [63], [78], [83], [86], [92], [98], [99], [100], [105], [108], [122], [123], [157], [158], [159], [160], [161], [162], [167], [168], [175], [176], [177] [2018-11-23 01:31:09,165 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:31:09,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:31:09,237 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:31:09,237 INFO L272 AbstractInterpreter]: Visited 38 different actions 44 times. Never merged. Never widened. Performed 307 root evaluator evaluations with a maximum evaluation depth of 4. Performed 307 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 26 variables. [2018-11-23 01:31:09,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:31:09,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:31:09,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:31:09,240 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/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-23 01:31:09,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:31:09,249 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:31:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:31:09,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:31:09,308 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-23 01:31:09,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:31:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:31:09,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 01:31:09,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 15 [2018-11-23 01:31:09,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:31:09,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:31:09,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:31:09,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-23 01:31:09,535 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 9 states. [2018-11-23 01:31:09,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:31:09,610 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2018-11-23 01:31:09,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:31:09,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-11-23 01:31:09,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:31:09,612 INFO L225 Difference]: With dead ends: 102 [2018-11-23 01:31:09,612 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 01:31:09,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-11-23 01:31:09,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 01:31:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-23 01:31:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 01:31:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-11-23 01:31:09,620 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 44 [2018-11-23 01:31:09,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:31:09,621 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-11-23 01:31:09,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:31:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-11-23 01:31:09,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 01:31:09,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:31:09,622 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:31:09,622 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:31:09,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:31:09,623 INFO L82 PathProgramCache]: Analyzing trace with hash 78154813, now seen corresponding path program 1 times [2018-11-23 01:31:09,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:31:09,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:31:09,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:31:09,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:31:09,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:31:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:31:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 01:31:09,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:31:09,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 01:31:09,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:31:09,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 01:31:09,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 01:31:09,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 01:31:09,732 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 10 states. [2018-11-23 01:31:09,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:31:09,863 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2018-11-23 01:31:09,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 01:31:09,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-11-23 01:31:09,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:31:09,866 INFO L225 Difference]: With dead ends: 84 [2018-11-23 01:31:09,866 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 01:31:09,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-11-23 01:31:09,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 01:31:09,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2018-11-23 01:31:09,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 01:31:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2018-11-23 01:31:09,873 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 48 [2018-11-23 01:31:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:31:09,873 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2018-11-23 01:31:09,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 01:31:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2018-11-23 01:31:09,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 01:31:09,874 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:31:09,874 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:31:09,874 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:31:09,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:31:09,874 INFO L82 PathProgramCache]: Analyzing trace with hash 455412652, now seen corresponding path program 1 times [2018-11-23 01:31:09,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:31:09,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:31:09,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:31:09,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:31:09,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:31:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:31:09,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 01:31:09,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:31:09,955 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:31:09,955 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-11-23 01:31:09,955 INFO L202 CegarAbsIntRunner]: [1], [3], [5], [10], [13], [19], [29], [31], [34], [39], [42], [49], [51], [55], [56], [62], [63], [78], [83], [86], [92], [98], [99], [100], [105], [108], [110], [116], [118], [122], [123], [157], [158], [159], [160], [161], [162], [167], [168], [175], [176], [177] [2018-11-23 01:31:09,956 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:31:09,956 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:31:10,052 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:31:10,053 INFO L272 AbstractInterpreter]: Visited 42 different actions 71 times. Merged at 14 different actions 20 times. Never widened. Performed 553 root evaluator evaluations with a maximum evaluation depth of 4. Performed 553 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 4 different actions. Largest state had 26 variables. [2018-11-23 01:31:10,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:31:10,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:31:10,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:31:10,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/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-23 01:31:10,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:31:10,090 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:31:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:31:10,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:31:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:31:10,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:31:10,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 01:31:10,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:31:10,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 15 [2018-11-23 01:31:10,294 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:31:10,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 01:31:10,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 01:31:10,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-11-23 01:31:10,294 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand 10 states. [2018-11-23 01:31:10,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:31:10,389 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2018-11-23 01:31:10,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:31:10,390 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2018-11-23 01:31:10,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:31:10,390 INFO L225 Difference]: With dead ends: 124 [2018-11-23 01:31:10,390 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 01:31:10,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 89 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-11-23 01:31:10,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 01:31:10,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-23 01:31:10,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 01:31:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2018-11-23 01:31:10,399 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 49 [2018-11-23 01:31:10,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:31:10,403 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2018-11-23 01:31:10,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 01:31:10,403 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2018-11-23 01:31:10,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 01:31:10,404 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:31:10,404 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:31:10,404 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:31:10,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:31:10,404 INFO L82 PathProgramCache]: Analyzing trace with hash -649980251, now seen corresponding path program 2 times [2018-11-23 01:31:10,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:31:10,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:31:10,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:31:10,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:31:10,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:31:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:31:10,505 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 01:31:10,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:31:10,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:31:10,505 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:31:10,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:31:10,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:31:10,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/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-23 01:31:10,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 01:31:10,516 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 01:31:10,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 01:31:10,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:31:10,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:31:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 01:31:10,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:31:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 01:31:10,711 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:31:10,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [12] total 20 [2018-11-23 01:31:10,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:31:10,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:31:10,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:31:10,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-11-23 01:31:10,712 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand 7 states. [2018-11-23 01:31:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:31:10,779 INFO L93 Difference]: Finished difference Result 140 states and 172 transitions. [2018-11-23 01:31:10,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 01:31:10,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-11-23 01:31:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:31:10,780 INFO L225 Difference]: With dead ends: 140 [2018-11-23 01:31:10,781 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 01:31:10,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-11-23 01:31:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 01:31:10,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2018-11-23 01:31:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 01:31:10,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2018-11-23 01:31:10,789 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 53 [2018-11-23 01:31:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:31:10,789 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2018-11-23 01:31:10,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:31:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2018-11-23 01:31:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 01:31:10,790 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:31:10,791 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:31:10,791 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:31:10,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:31:10,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1236786265, now seen corresponding path program 1 times [2018-11-23 01:31:10,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:31:10,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:31:10,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:31:10,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:31:10,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:31:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:31:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 01:31:10,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:31:10,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:31:10,905 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-23 01:31:10,906 INFO L202 CegarAbsIntRunner]: [1], [3], [5], [10], [15], [19], [29], [31], [34], [39], [42], [49], [51], [55], [56], [62], [63], [78], [83], [86], [92], [98], [99], [100], [105], [108], [110], [116], [118], [122], [123], [157], [158], [159], [160], [161], [162], [167], [168], [175], [176], [177] [2018-11-23 01:31:10,908 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:31:10,909 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:31:10,992 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:31:10,992 INFO L272 AbstractInterpreter]: Visited 42 different actions 78 times. Merged at 14 different actions 26 times. Widened at 1 different actions 1 times. Performed 561 root evaluator evaluations with a maximum evaluation depth of 4. Performed 561 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 4 different actions. Largest state had 26 variables. [2018-11-23 01:31:10,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:31:10,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:31:10,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:31:10,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/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-23 01:31:11,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:31:11,010 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:31:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:31:11,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:31:11,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 01:31:11,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 01:31:11,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:11,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:11,095 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-23 01:31:11,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-11-23 01:31:13,122 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| Int) (|v_main_~#s~0.base_BEFORE_CALL_1| Int)) (not (= 0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)) (select (select |c_#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))) is different from true [2018-11-23 01:31:13,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-11-23 01:31:13,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-11-23 01:31:13,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:13,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:13,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 01:31:13,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-11-23 01:31:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:31:13,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:31:13,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 01:31:13,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-11-23 01:31:13,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:13,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:13,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 01:31:13,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:21 [2018-11-23 01:31:13,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-23 01:31:13,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:31:13,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:13,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:13,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-23 01:31:13,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:31:13,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:13,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:13,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:13,727 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:4 [2018-11-23 01:31:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 01:31:13,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:31:13,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 13] total 24 [2018-11-23 01:31:13,754 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:31:13,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 01:31:13,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 01:31:13,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=444, Unknown=1, NotChecked=42, Total=552 [2018-11-23 01:31:13,755 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 19 states. [2018-11-23 01:31:32,011 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 25 DAG size of output: 14 [2018-11-23 01:31:40,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:31:40,231 INFO L93 Difference]: Finished difference Result 142 states and 167 transitions. [2018-11-23 01:31:40,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 01:31:40,232 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-11-23 01:31:40,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:31:40,233 INFO L225 Difference]: With dead ends: 142 [2018-11-23 01:31:40,234 INFO L226 Difference]: Without dead ends: 132 [2018-11-23 01:31:40,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 87 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=123, Invalid=804, Unknown=7, NotChecked=58, Total=992 [2018-11-23 01:31:40,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-23 01:31:40,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 104. [2018-11-23 01:31:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 01:31:40,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2018-11-23 01:31:40,245 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 53 [2018-11-23 01:31:40,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:31:40,245 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2018-11-23 01:31:40,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 01:31:40,245 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2018-11-23 01:31:40,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 01:31:40,247 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:31:40,247 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:31:40,247 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:31:40,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:31:40,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1653055102, now seen corresponding path program 2 times [2018-11-23 01:31:40,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:31:40,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:31:40,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:31:40,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:31:40,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:31:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:31:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 01:31:40,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:31:40,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:31:40,379 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:31:40,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:31:40,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:31:40,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/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-23 01:31:40,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 01:31:40,389 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 01:31:40,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 01:31:40,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:31:40,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:31:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 01:31:40,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:31:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 01:31:40,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:31:40,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 21 [2018-11-23 01:31:40,614 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:31:40,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 01:31:40,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 01:31:40,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-11-23 01:31:40,615 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand 14 states. [2018-11-23 01:31:40,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:31:40,777 INFO L93 Difference]: Finished difference Result 172 states and 218 transitions. [2018-11-23 01:31:40,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 01:31:40,777 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-11-23 01:31:40,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:31:40,778 INFO L225 Difference]: With dead ends: 172 [2018-11-23 01:31:40,778 INFO L226 Difference]: Without dead ends: 168 [2018-11-23 01:31:40,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 92 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2018-11-23 01:31:40,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-23 01:31:40,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 124. [2018-11-23 01:31:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-23 01:31:40,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 152 transitions. [2018-11-23 01:31:40,794 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 152 transitions. Word has length 54 [2018-11-23 01:31:40,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:31:40,795 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 152 transitions. [2018-11-23 01:31:40,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 01:31:40,795 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2018-11-23 01:31:40,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 01:31:40,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:31:40,797 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:31:40,797 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:31:40,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:31:40,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1672487161, now seen corresponding path program 3 times [2018-11-23 01:31:40,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:31:40,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:31:40,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:31:40,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:31:40,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:31:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:31:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 01:31:41,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:31:41,011 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:31:41,011 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:31:41,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:31:41,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:31:41,011 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/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-23 01:31:41,017 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 01:31:41,018 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 01:31:41,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 01:31:41,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:31:41,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:31:41,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-23 01:31:41,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:41,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:41,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 01:31:41,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 01:31:41,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-23 01:31:41,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:41,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:41,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 01:31:41,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-23 01:31:41,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:41,085 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:41,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:41,089 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-11-23 01:31:41,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:41,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:41,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 01:31:41,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:41,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:41,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-11-23 01:31:41,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 01:31:41,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 01:31:41,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:41,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:41,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 01:31:41,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 01:31:41,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:41,165 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:41,183 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-23 01:31:41,184 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:39 [2018-11-23 01:31:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:31:42,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:31:43,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 270 treesize of output 215 [2018-11-23 01:31:43,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-23 01:31:43,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 113 [2018-11-23 01:31:43,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 86 [2018-11-23 01:31:43,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:43,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 87 [2018-11-23 01:31:43,165 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 81 [2018-11-23 01:31:43,182 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,199 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:43,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-11-23 01:31:43,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:31:43,202 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,206 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 112 [2018-11-23 01:31:43,210 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:43,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 92 [2018-11-23 01:31:43,211 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,218 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 113 [2018-11-23 01:31:43,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 102 [2018-11-23 01:31:43,227 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 81 [2018-11-23 01:31:43,242 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 86 [2018-11-23 01:31:43,259 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:43,274 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:43,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 14 xjuncts. [2018-11-23 01:31:43,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 134 treesize of output 79 [2018-11-23 01:31:43,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 01:31:43,541 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2018-11-23 01:31:43,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21 [2018-11-23 01:31:43,569 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-23 01:31:43,580 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:43,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2018-11-23 01:31:43,583 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,585 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,588 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-11-23 01:31:43,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:43,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-11-23 01:31:43,597 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-23 01:31:43,608 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:43,608 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:43,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2018-11-23 01:31:43,609 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,611 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,615 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2018-11-23 01:31:43,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:43,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2018-11-23 01:31:43,623 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-11-23 01:31:43,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 01:31:43,634 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-11-23 01:31:43,639 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,640 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,643 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-11-23 01:31:43,652 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:43,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 49 [2018-11-23 01:31:43,664 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:43,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-11-23 01:31:43,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-11-23 01:31:43,686 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 01:31:43,693 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,696 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-11-23 01:31:43,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-23 01:31:43,701 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 8 [2018-11-23 01:31:43,712 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:43,717 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:31:43,740 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,741 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 01:31:43,742 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,745 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:43,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2018-11-23 01:31:43,750 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:43,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 54 [2018-11-23 01:31:43,753 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,763 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:43,764 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:43,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2018-11-23 01:31:43,770 INFO L478 Elim1Store]: Elim1 applied some 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 44 treesize of output 44 [2018-11-23 01:31:43,771 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 01:31:43,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 10 [2018-11-23 01:31:43,785 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,789 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,792 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,805 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:31:43,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 116 treesize of output 69 [2018-11-23 01:31:43,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-23 01:31:43,848 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:43,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 68 treesize of output 89 [2018-11-23 01:31:44,125 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 167 [2018-11-23 01:31:44,127 INFO L478 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 42 treesize of output 49 [2018-11-23 01:31:44,127 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:44,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-11-23 01:31:44,230 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:44,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-11-23 01:31:44,337 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:44,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 49 [2018-11-23 01:31:44,437 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:44,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-11-23 01:31:44,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-23 01:31:44,540 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:44,545 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:44,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2018-11-23 01:31:44,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-23 01:31:44,644 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:44,664 INFO L478 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 25 treesize of output 17 [2018-11-23 01:31:44,664 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:44,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2018-11-23 01:31:44,684 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:44,695 INFO L267 ElimStorePlain]: Start of recursive call 54: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:44,788 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:44,795 INFO L478 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 2 case distinctions, treesize of input 71 treesize of output 65 [2018-11-23 01:31:44,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2018-11-23 01:31:44,877 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:44,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2018-11-23 01:31:44,901 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:44,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2018-11-23 01:31:44,938 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:44,946 INFO L267 ElimStorePlain]: Start of recursive call 58: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:44,976 INFO L267 ElimStorePlain]: Start of recursive call 47: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:44,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 65 [2018-11-23 01:31:45,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-11-23 01:31:45,046 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2018-11-23 01:31:45,072 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 54 [2018-11-23 01:31:45,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-11-23 01:31:45,175 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-23 01:31:45,201 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,234 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:45,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 01:31:45,238 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:45,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-23 01:31:45,274 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,285 INFO L267 ElimStorePlain]: Start of recursive call 65: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,302 INFO L267 ElimStorePlain]: Start of recursive call 62: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 72 [2018-11-23 01:31:45,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-11-23 01:31:45,377 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 46 [2018-11-23 01:31:45,406 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 61 [2018-11-23 01:31:45,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2018-11-23 01:31:45,514 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-23 01:31:45,544 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,572 INFO L478 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 24 treesize of output 16 [2018-11-23 01:31:45,572 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 01:31:45,599 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-23 01:31:45,618 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,626 INFO L267 ElimStorePlain]: Start of recursive call 73: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,638 INFO L267 ElimStorePlain]: Start of recursive call 70: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 50 [2018-11-23 01:31:45,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-11-23 01:31:45,661 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-11-23 01:31:45,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-23 01:31:45,676 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:31:45,685 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,687 INFO L267 ElimStorePlain]: Start of recursive call 81: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,693 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:45,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 80 [2018-11-23 01:31:45,967 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 163 [2018-11-23 01:31:45,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 50 [2018-11-23 01:31:45,978 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:46,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-11-23 01:31:46,122 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:46,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-11-23 01:31:46,229 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:46,345 INFO L478 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 42 treesize of output 54 [2018-11-23 01:31:46,345 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:46,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 50 [2018-11-23 01:31:46,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-11-23 01:31:46,508 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:46,525 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:46,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2018-11-23 01:31:46,531 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:46,550 INFO L267 ElimStorePlain]: Start of recursive call 89: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:46,669 INFO L478 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 52 treesize of output 62 [2018-11-23 01:31:46,847 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 115 [2018-11-23 01:31:46,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-11-23 01:31:46,849 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:46,923 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:46,924 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:46,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 43 [2018-11-23 01:31:46,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2018-11-23 01:31:46,927 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:46,933 INFO L267 ElimStorePlain]: Start of recursive call 94: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:46,935 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:46,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 50 [2018-11-23 01:31:46,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2018-11-23 01:31:46,942 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:46,949 INFO L267 ElimStorePlain]: Start of recursive call 96: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-11-23 01:31:47,010 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,064 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:47,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 01:31:47,068 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:47,138 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:47,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 01:31:47,142 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:47,181 INFO L478 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 21 treesize of output 13 [2018-11-23 01:31:47,182 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,216 INFO L267 ElimStorePlain]: Start of recursive call 92: 10 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:47,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 01:31:47,344 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:47,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 3 [2018-11-23 01:31:47,345 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,347 INFO L267 ElimStorePlain]: Start of recursive call 102: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,357 INFO L267 ElimStorePlain]: Start of recursive call 84: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 48 [2018-11-23 01:31:47,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 01:31:47,380 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2018-11-23 01:31:47,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-11-23 01:31:47,402 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-23 01:31:47,416 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-23 01:31:47,424 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2018-11-23 01:31:47,433 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-11-23 01:31:47,440 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,443 INFO L267 ElimStorePlain]: Start of recursive call 106: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,445 INFO L267 ElimStorePlain]: Start of recursive call 104: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 63 [2018-11-23 01:31:47,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-11-23 01:31:47,519 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 51 [2018-11-23 01:31:47,550 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:47,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 54 [2018-11-23 01:31:47,683 INFO L478 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 30 treesize of output 22 [2018-11-23 01:31:47,683 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2018-11-23 01:31:47,718 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:47,755 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:47,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 01:31:47,760 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:47,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 01:31:47,794 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 01:31:47,822 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-23 01:31:47,844 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,857 INFO L267 ElimStorePlain]: Start of recursive call 115: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:47,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 01:31:47,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-11-23 01:31:47,907 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:31:47,912 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,915 INFO L267 ElimStorePlain]: Start of recursive call 122: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,921 INFO L267 ElimStorePlain]: Start of recursive call 112: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:47,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 64 [2018-11-23 01:31:48,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-23 01:31:48,019 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-23 01:31:48,053 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 46 [2018-11-23 01:31:48,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-11-23 01:31:48,115 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-11-23 01:31:48,131 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,140 INFO L267 ElimStorePlain]: Start of recursive call 128: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:31:48,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-23 01:31:48,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 8 [2018-11-23 01:31:48,158 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,161 INFO L267 ElimStorePlain]: Start of recursive call 131: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,170 INFO L267 ElimStorePlain]: Start of recursive call 125: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,188 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 01:31:48,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 72 [2018-11-23 01:31:48,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-23 01:31:48,228 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2018-11-23 01:31:48,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-11-23 01:31:48,265 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-11-23 01:31:48,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-11-23 01:31:48,273 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:31:48,276 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,277 INFO L267 ElimStorePlain]: Start of recursive call 137: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,280 INFO L267 ElimStorePlain]: Start of recursive call 135: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 66 [2018-11-23 01:31:48,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-11-23 01:31:48,355 INFO L267 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 48 [2018-11-23 01:31:48,386 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:48,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-11-23 01:31:48,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2018-11-23 01:31:48,419 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:31:48,425 INFO L267 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,428 INFO L267 ElimStorePlain]: Start of recursive call 143: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-11-23 01:31:48,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2018-11-23 01:31:48,439 INFO L267 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:48,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 01:31:48,447 INFO L267 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 01:31:48,448 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,453 INFO L267 ElimStorePlain]: Start of recursive call 146: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:31:48,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 43 [2018-11-23 01:31:48,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-23 01:31:48,480 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-11-23 01:31:48,495 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-23 01:31:48,506 INFO L267 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-23 01:31:48,516 INFO L267 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2018-11-23 01:31:48,527 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:48,536 INFO L267 ElimStorePlain]: Start of recursive call 150: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:48,545 INFO L267 ElimStorePlain]: Start of recursive call 140: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-11-23 01:31:48,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 01:31:48,575 INFO L267 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,585 INFO L478 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 36 treesize of output 35 [2018-11-23 01:31:48,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-11-23 01:31:48,587 INFO L267 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 01:31:48,593 INFO L267 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-23 01:31:48,597 INFO L267 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,598 INFO L267 ElimStorePlain]: Start of recursive call 158: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,600 INFO L267 ElimStorePlain]: Start of recursive call 156: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 75 [2018-11-23 01:31:48,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-11-23 01:31:48,679 INFO L267 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-11-23 01:31:48,714 INFO L267 ElimStorePlain]: Start of recursive call 164: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 56 [2018-11-23 01:31:48,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-23 01:31:48,777 INFO L267 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2018-11-23 01:31:48,792 INFO L267 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,799 INFO L267 ElimStorePlain]: Start of recursive call 165: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,808 INFO L267 ElimStorePlain]: Start of recursive call 162: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,822 INFO L267 ElimStorePlain]: Start of recursive call 133: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:48,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 72 [2018-11-23 01:31:48,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 01:31:48,860 INFO L267 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 65 [2018-11-23 01:31:48,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2018-11-23 01:31:48,959 INFO L267 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,961 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 01:31:48,961 INFO L267 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:48,962 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:48,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:48,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 65 [2018-11-23 01:31:48,965 INFO L267 ElimStorePlain]: Start of recursive call 173: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:31:48,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42 [2018-11-23 01:31:48,996 INFO L267 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,017 INFO L478 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 42 treesize of output 35 [2018-11-23 01:31:49,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-23 01:31:49,019 INFO L267 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 01:31:49,026 INFO L267 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:31:49,030 INFO L267 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,034 INFO L267 ElimStorePlain]: Start of recursive call 175: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 46 [2018-11-23 01:31:49,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 01:31:49,085 INFO L267 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 10 [2018-11-23 01:31:49,097 INFO L267 ElimStorePlain]: Start of recursive call 181: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-23 01:31:49,107 INFO L267 ElimStorePlain]: Start of recursive call 182: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-23 01:31:49,116 INFO L267 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,121 INFO L267 ElimStorePlain]: Start of recursive call 179: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,128 INFO L267 ElimStorePlain]: Start of recursive call 170: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 89 [2018-11-23 01:31:49,361 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 164 [2018-11-23 01:31:49,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-11-23 01:31:49,363 INFO L267 ElimStorePlain]: Start of recursive call 185: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-11-23 01:31:49,456 INFO L267 ElimStorePlain]: Start of recursive call 186: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-11-23 01:31:49,539 INFO L267 ElimStorePlain]: Start of recursive call 187: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-11-23 01:31:49,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 01:31:49,633 INFO L267 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,641 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:49,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-23 01:31:49,642 INFO L267 ElimStorePlain]: Start of recursive call 190: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,646 INFO L267 ElimStorePlain]: Start of recursive call 188: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-11-23 01:31:49,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2018-11-23 01:31:49,723 INFO L267 ElimStorePlain]: Start of recursive call 192: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 01:31:49,730 INFO L267 ElimStorePlain]: Start of recursive call 193: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,733 INFO L267 ElimStorePlain]: Start of recursive call 191: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 61 [2018-11-23 01:31:49,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:49,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 51 [2018-11-23 01:31:49,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 18 [2018-11-23 01:31:49,876 INFO L267 ElimStorePlain]: Start of recursive call 196: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:49,889 INFO L267 ElimStorePlain]: Start of recursive call 195: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:31:49,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 01:31:49,926 INFO L267 ElimStorePlain]: Start of recursive call 197: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 01:31:49,951 INFO L267 ElimStorePlain]: Start of recursive call 198: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:49,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-23 01:31:49,976 INFO L267 ElimStorePlain]: Start of recursive call 199: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:50,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2018-11-23 01:31:50,003 INFO L267 ElimStorePlain]: Start of recursive call 200: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:50,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-23 01:31:50,023 INFO L267 ElimStorePlain]: Start of recursive call 201: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:50,034 INFO L267 ElimStorePlain]: Start of recursive call 194: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:50,053 INFO L267 ElimStorePlain]: Start of recursive call 184: 3 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:50,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 80 [2018-11-23 01:31:50,330 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 158 [2018-11-23 01:31:50,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-11-23 01:31:50,332 INFO L267 ElimStorePlain]: Start of recursive call 203: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:50,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 48 [2018-11-23 01:31:50,459 INFO L267 ElimStorePlain]: Start of recursive call 204: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:50,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-11-23 01:31:50,558 INFO L267 ElimStorePlain]: Start of recursive call 205: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:50,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-11-23 01:31:50,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2018-11-23 01:31:50,678 INFO L267 ElimStorePlain]: Start of recursive call 207: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:50,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:31:50,687 INFO L267 ElimStorePlain]: Start of recursive call 208: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:50,694 INFO L267 ElimStorePlain]: Start of recursive call 206: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:50,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-11-23 01:31:50,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2018-11-23 01:31:50,703 INFO L267 ElimStorePlain]: Start of recursive call 210: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:50,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 01:31:50,714 INFO L267 ElimStorePlain]: Start of recursive call 211: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:50,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 01:31:50,716 INFO L267 ElimStorePlain]: Start of recursive call 212: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:50,725 INFO L267 ElimStorePlain]: Start of recursive call 209: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:31:50,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-11-23 01:31:50,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 01:31:50,822 INFO L267 ElimStorePlain]: Start of recursive call 214: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:50,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-23 01:31:50,832 INFO L267 ElimStorePlain]: Start of recursive call 215: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:50,837 INFO L267 ElimStorePlain]: Start of recursive call 213: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:50,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 48 [2018-11-23 01:31:50,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 27 [2018-11-23 01:31:50,911 INFO L267 ElimStorePlain]: Start of recursive call 217: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:50,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 01:31:50,956 INFO L267 ElimStorePlain]: Start of recursive call 218: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:51,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 26 [2018-11-23 01:31:51,003 INFO L267 ElimStorePlain]: Start of recursive call 219: End of recursive call: and 4 xjuncts. [2018-11-23 01:31:51,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 27 [2018-11-23 01:31:51,042 INFO L267 ElimStorePlain]: Start of recursive call 220: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:51,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-23 01:31:51,072 INFO L267 ElimStorePlain]: Start of recursive call 221: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:51,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 01:31:51,099 INFO L267 ElimStorePlain]: Start of recursive call 222: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:51,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-11-23 01:31:51,127 INFO L267 ElimStorePlain]: Start of recursive call 223: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:51,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-23 01:31:51,153 INFO L267 ElimStorePlain]: Start of recursive call 224: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:51,168 INFO L267 ElimStorePlain]: Start of recursive call 216: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:51,190 INFO L267 ElimStorePlain]: Start of recursive call 202: 3 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:51,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2018-11-23 01:31:51,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-11-23 01:31:51,215 INFO L267 ElimStorePlain]: Start of recursive call 226: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:51,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-11-23 01:31:51,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-23 01:31:51,226 INFO L267 ElimStorePlain]: Start of recursive call 228: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:51,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:31:51,234 INFO L267 ElimStorePlain]: Start of recursive call 229: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:51,235 INFO L267 ElimStorePlain]: Start of recursive call 227: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:51,238 INFO L267 ElimStorePlain]: Start of recursive call 225: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:51,253 INFO L267 ElimStorePlain]: Start of recursive call 168: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:51,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 73 [2018-11-23 01:31:51,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-23 01:31:51,311 INFO L267 ElimStorePlain]: Start of recursive call 231: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:51,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 73 [2018-11-23 01:31:51,521 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 116 [2018-11-23 01:31:51,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-11-23 01:31:51,523 INFO L267 ElimStorePlain]: Start of recursive call 233: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:51,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-11-23 01:31:51,591 INFO L267 ElimStorePlain]: Start of recursive call 234: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:51,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 48 [2018-11-23 01:31:51,653 INFO L267 ElimStorePlain]: Start of recursive call 235: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:51,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:51,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2018-11-23 01:31:51,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-23 01:31:51,726 INFO L267 ElimStorePlain]: Start of recursive call 237: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:51,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 12 [2018-11-23 01:31:51,738 INFO L267 ElimStorePlain]: Start of recursive call 238: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:51,746 INFO L267 ElimStorePlain]: Start of recursive call 236: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:31:51,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-11-23 01:31:51,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 12 [2018-11-23 01:31:51,825 INFO L267 ElimStorePlain]: Start of recursive call 240: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:51,832 INFO L267 ElimStorePlain]: Start of recursive call 239: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:31:51,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2018-11-23 01:31:51,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-11-23 01:31:51,880 INFO L267 ElimStorePlain]: Start of recursive call 242: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:51,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 01:31:51,899 INFO L267 ElimStorePlain]: Start of recursive call 243: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:51,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 27 [2018-11-23 01:31:51,915 INFO L267 ElimStorePlain]: Start of recursive call 244: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:51,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-23 01:31:51,931 INFO L267 ElimStorePlain]: Start of recursive call 245: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:51,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 01:31:51,944 INFO L267 ElimStorePlain]: Start of recursive call 246: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:51,956 INFO L267 ElimStorePlain]: Start of recursive call 241: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:52,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-11-23 01:31:52,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2018-11-23 01:31:52,001 INFO L267 ElimStorePlain]: Start of recursive call 248: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-23 01:31:52,007 INFO L267 ElimStorePlain]: Start of recursive call 249: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,013 INFO L267 ElimStorePlain]: Start of recursive call 247: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-11-23 01:31:52,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-11-23 01:31:52,036 INFO L267 ElimStorePlain]: Start of recursive call 251: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-23 01:31:52,046 INFO L267 ElimStorePlain]: Start of recursive call 252: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:52,052 INFO L267 ElimStorePlain]: Start of recursive call 250: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:31:52,086 INFO L267 ElimStorePlain]: Start of recursive call 232: 3 dim-1 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:52,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 48 [2018-11-23 01:31:52,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 12 [2018-11-23 01:31:52,107 INFO L267 ElimStorePlain]: Start of recursive call 254: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2018-11-23 01:31:52,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-11-23 01:31:52,121 INFO L267 ElimStorePlain]: Start of recursive call 256: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2018-11-23 01:31:52,136 INFO L267 ElimStorePlain]: Start of recursive call 257: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:52,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2018-11-23 01:31:52,148 INFO L267 ElimStorePlain]: Start of recursive call 258: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-23 01:31:52,149 INFO L267 ElimStorePlain]: Start of recursive call 259: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-23 01:31:52,159 INFO L267 ElimStorePlain]: Start of recursive call 260: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-23 01:31:52,168 INFO L267 ElimStorePlain]: Start of recursive call 261: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,175 INFO L267 ElimStorePlain]: Start of recursive call 255: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:52,182 INFO L267 ElimStorePlain]: Start of recursive call 253: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:52,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 82 [2018-11-23 01:31:52,341 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 119 [2018-11-23 01:31:52,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-11-23 01:31:52,343 INFO L267 ElimStorePlain]: Start of recursive call 263: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-11-23 01:31:52,406 INFO L267 ElimStorePlain]: Start of recursive call 264: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-11-23 01:31:52,468 INFO L267 ElimStorePlain]: Start of recursive call 265: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 56 [2018-11-23 01:31:52,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 01:31:52,571 INFO L267 ElimStorePlain]: Start of recursive call 267: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-23 01:31:52,586 INFO L267 ElimStorePlain]: Start of recursive call 268: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2018-11-23 01:31:52,599 INFO L267 ElimStorePlain]: Start of recursive call 269: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-23 01:31:52,609 INFO L267 ElimStorePlain]: Start of recursive call 270: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,615 INFO L267 ElimStorePlain]: Start of recursive call 266: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 61 [2018-11-23 01:31:52,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 01:31:52,732 INFO L267 ElimStorePlain]: Start of recursive call 272: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 01:31:52,758 INFO L267 ElimStorePlain]: Start of recursive call 273: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-11-23 01:31:52,780 INFO L267 ElimStorePlain]: Start of recursive call 274: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2018-11-23 01:31:52,804 INFO L267 ElimStorePlain]: Start of recursive call 275: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:52,833 INFO L267 ElimStorePlain]: Start of recursive call 271: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:52,871 INFO L267 ElimStorePlain]: Start of recursive call 262: 3 dim-1 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:52,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2018-11-23 01:31:52,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-11-23 01:31:52,892 INFO L267 ElimStorePlain]: Start of recursive call 277: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-11-23 01:31:52,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-11-23 01:31:52,901 INFO L267 ElimStorePlain]: Start of recursive call 279: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:31:52,904 INFO L267 ElimStorePlain]: Start of recursive call 280: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,905 INFO L267 ElimStorePlain]: Start of recursive call 278: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,908 INFO L267 ElimStorePlain]: Start of recursive call 276: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,930 INFO L267 ElimStorePlain]: Start of recursive call 230: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 01:31:52,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 120 treesize of output 73 [2018-11-23 01:31:52,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 01:31:52,968 INFO L267 ElimStorePlain]: Start of recursive call 282: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:52,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 61 [2018-11-23 01:31:53,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-23 01:31:53,063 INFO L267 ElimStorePlain]: Start of recursive call 284: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:53,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2018-11-23 01:31:53,092 INFO L267 ElimStorePlain]: Start of recursive call 285: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:53,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-11-23 01:31:53,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-23 01:31:53,117 INFO L267 ElimStorePlain]: Start of recursive call 287: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:53,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:31:53,123 INFO L267 ElimStorePlain]: Start of recursive call 288: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:53,127 INFO L267 ElimStorePlain]: Start of recursive call 286: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:53,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-23 01:31:53,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 8 [2018-11-23 01:31:53,147 INFO L267 ElimStorePlain]: Start of recursive call 290: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:53,150 INFO L267 ElimStorePlain]: Start of recursive call 289: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:53,160 INFO L267 ElimStorePlain]: Start of recursive call 283: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:53,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 46 treesize of output 77 [2018-11-23 01:31:53,389 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 179 [2018-11-23 01:31:53,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-11-23 01:31:53,391 INFO L267 ElimStorePlain]: Start of recursive call 292: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:53,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 47 [2018-11-23 01:31:53,520 INFO L267 ElimStorePlain]: Start of recursive call 293: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:53,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-11-23 01:31:53,634 INFO L267 ElimStorePlain]: Start of recursive call 294: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:53,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 51 [2018-11-23 01:31:53,737 INFO L267 ElimStorePlain]: Start of recursive call 295: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:53,845 INFO L478 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 53 treesize of output 47 [2018-11-23 01:31:53,884 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:53,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:53,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 76 [2018-11-23 01:31:53,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 31 [2018-11-23 01:31:53,913 INFO L267 ElimStorePlain]: Start of recursive call 298: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:54,014 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:54,014 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:54,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 42 [2018-11-23 01:31:54,021 INFO L267 ElimStorePlain]: Start of recursive call 299: End of recursive call: and 4 xjuncts. [2018-11-23 01:31:54,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-11-23 01:31:54,121 INFO L267 ElimStorePlain]: Start of recursive call 300: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:54,199 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:54,200 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:54,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 39 [2018-11-23 01:31:54,208 INFO L267 ElimStorePlain]: Start of recursive call 301: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:54,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 40 [2018-11-23 01:31:54,325 INFO L267 ElimStorePlain]: Start of recursive call 302: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:54,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 55 [2018-11-23 01:31:54,383 INFO L267 ElimStorePlain]: Start of recursive call 303: End of recursive call: and 16 xjuncts. [2018-11-23 01:31:54,519 INFO L267 ElimStorePlain]: Start of recursive call 297: 2 dim-0 vars, 9 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 01:31:54,521 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 01:31:54,521 INFO L267 ElimStorePlain]: Start of recursive call 304: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:54,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 40 [2018-11-23 01:31:54,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-11-23 01:31:54,533 INFO L267 ElimStorePlain]: Start of recursive call 306: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:54,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 33 [2018-11-23 01:31:54,562 INFO L267 ElimStorePlain]: Start of recursive call 307: End of recursive call: and 4 xjuncts. [2018-11-23 01:31:54,584 INFO L267 ElimStorePlain]: Start of recursive call 305: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:31:54,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 30 [2018-11-23 01:31:54,616 INFO L267 ElimStorePlain]: Start of recursive call 308: End of recursive call: and 4 xjuncts. [2018-11-23 01:31:54,640 INFO L267 ElimStorePlain]: Start of recursive call 296: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:54,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 54 [2018-11-23 01:31:54,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 01:31:54,819 INFO L267 ElimStorePlain]: Start of recursive call 310: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:54,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 01:31:54,848 INFO L267 ElimStorePlain]: Start of recursive call 311: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:54,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-23 01:31:54,878 INFO L267 ElimStorePlain]: Start of recursive call 312: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:54,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-11-23 01:31:54,906 INFO L267 ElimStorePlain]: Start of recursive call 313: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:54,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-23 01:31:54,934 INFO L267 ElimStorePlain]: Start of recursive call 314: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:54,961 INFO L267 ElimStorePlain]: Start of recursive call 309: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:55,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2018-11-23 01:31:55,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 26 [2018-11-23 01:31:55,058 INFO L267 ElimStorePlain]: Start of recursive call 316: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:55,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2018-11-23 01:31:55,074 INFO L267 ElimStorePlain]: Start of recursive call 317: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:55,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 30 [2018-11-23 01:31:55,098 INFO L267 ElimStorePlain]: Start of recursive call 318: End of recursive call: and 4 xjuncts. [2018-11-23 01:31:55,118 INFO L267 ElimStorePlain]: Start of recursive call 315: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:55,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-23 01:31:55,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-23 01:31:55,122 INFO L267 ElimStorePlain]: Start of recursive call 320: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:55,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 01:31:55,127 INFO L267 ElimStorePlain]: Start of recursive call 321: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:55,130 INFO L267 ElimStorePlain]: Start of recursive call 319: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:55,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-23 01:31:55,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 8 [2018-11-23 01:31:55,205 INFO L267 ElimStorePlain]: Start of recursive call 323: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:55,208 INFO L267 ElimStorePlain]: Start of recursive call 322: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:55,249 INFO L267 ElimStorePlain]: Start of recursive call 291: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:55,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 72 [2018-11-23 01:31:55,396 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 127 [2018-11-23 01:31:55,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 45 [2018-11-23 01:31:55,398 INFO L267 ElimStorePlain]: Start of recursive call 325: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:55,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 43 [2018-11-23 01:31:55,463 INFO L267 ElimStorePlain]: Start of recursive call 326: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:55,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 50 [2018-11-23 01:31:55,515 INFO L267 ElimStorePlain]: Start of recursive call 327: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:55,568 INFO L478 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 45 treesize of output 38 [2018-11-23 01:31:55,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 01:31:55,569 INFO L267 ElimStorePlain]: Start of recursive call 329: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:55,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-23 01:31:55,576 INFO L267 ElimStorePlain]: Start of recursive call 330: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:55,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-23 01:31:55,582 INFO L267 ElimStorePlain]: Start of recursive call 331: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:55,585 INFO L267 ElimStorePlain]: Start of recursive call 328: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:55,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2018-11-23 01:31:55,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 01:31:55,633 INFO L267 ElimStorePlain]: Start of recursive call 333: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:55,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-23 01:31:55,639 INFO L267 ElimStorePlain]: Start of recursive call 334: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:55,643 INFO L267 ElimStorePlain]: Start of recursive call 332: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:55,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-11-23 01:31:55,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-23 01:31:55,670 INFO L267 ElimStorePlain]: Start of recursive call 336: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:55,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 12 [2018-11-23 01:31:55,678 INFO L267 ElimStorePlain]: Start of recursive call 337: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:55,684 INFO L267 ElimStorePlain]: Start of recursive call 335: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:31:55,722 INFO L267 ElimStorePlain]: Start of recursive call 324: 3 dim-1 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:55,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 65 treesize of output 86 [2018-11-23 01:31:55,997 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 188 [2018-11-23 01:31:56,000 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:56,007 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:56,008 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:56,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 90 [2018-11-23 01:31:56,016 INFO L267 ElimStorePlain]: Start of recursive call 339: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:31:56,017 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 01:31:56,017 INFO L267 ElimStorePlain]: Start of recursive call 340: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:56,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 58 [2018-11-23 01:31:56,022 INFO L267 ElimStorePlain]: Start of recursive call 341: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:56,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 46 [2018-11-23 01:31:56,131 INFO L267 ElimStorePlain]: Start of recursive call 342: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:56,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-11-23 01:31:56,217 INFO L267 ElimStorePlain]: Start of recursive call 343: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:56,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2018-11-23 01:31:56,303 INFO L267 ElimStorePlain]: Start of recursive call 344: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:56,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2018-11-23 01:31:56,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2018-11-23 01:31:56,391 INFO L267 ElimStorePlain]: Start of recursive call 346: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:56,402 INFO L267 ElimStorePlain]: Start of recursive call 345: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:31:56,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 43 [2018-11-23 01:31:56,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-23 01:31:56,496 INFO L267 ElimStorePlain]: Start of recursive call 348: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:56,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-23 01:31:56,512 INFO L267 ElimStorePlain]: Start of recursive call 349: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:56,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-11-23 01:31:56,527 INFO L267 ElimStorePlain]: Start of recursive call 350: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:56,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2018-11-23 01:31:56,544 INFO L267 ElimStorePlain]: Start of recursive call 351: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:56,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 01:31:56,562 INFO L267 ElimStorePlain]: Start of recursive call 352: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:56,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-23 01:31:56,563 INFO L267 ElimStorePlain]: Start of recursive call 353: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:56,577 INFO L267 ElimStorePlain]: Start of recursive call 347: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:56,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2018-11-23 01:31:56,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2018-11-23 01:31:56,686 INFO L267 ElimStorePlain]: Start of recursive call 355: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:56,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-11-23 01:31:56,701 INFO L267 ElimStorePlain]: Start of recursive call 356: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:56,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 22 [2018-11-23 01:31:56,719 INFO L267 ElimStorePlain]: Start of recursive call 357: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:56,735 INFO L267 ElimStorePlain]: Start of recursive call 354: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:56,932 INFO L478 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 64 treesize of output 54 [2018-11-23 01:31:56,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2018-11-23 01:31:56,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 01:31:56,986 INFO L267 ElimStorePlain]: Start of recursive call 360: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:56,998 INFO L267 ElimStorePlain]: Start of recursive call 359: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:31:56,999 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 01:31:56,999 INFO L267 ElimStorePlain]: Start of recursive call 361: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:57,001 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:57,002 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:57,003 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:57,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 59 [2018-11-23 01:31:57,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 40 [2018-11-23 01:31:57,021 INFO L267 ElimStorePlain]: Start of recursive call 363: End of recursive call: and 8 xjuncts. [2018-11-23 01:31:57,049 INFO L267 ElimStorePlain]: Start of recursive call 362: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:57,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2018-11-23 01:31:57,071 INFO L267 ElimStorePlain]: Start of recursive call 364: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:57,085 INFO L267 ElimStorePlain]: Start of recursive call 358: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:31:57,159 INFO L478 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 60 treesize of output 66 [2018-11-23 01:31:57,316 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 105 [2018-11-23 01:31:57,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 01:31:57,318 INFO L267 ElimStorePlain]: Start of recursive call 366: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:57,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2018-11-23 01:31:57,375 INFO L267 ElimStorePlain]: Start of recursive call 367: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:57,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2018-11-23 01:31:57,428 INFO L267 ElimStorePlain]: Start of recursive call 368: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:57,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 01:31:57,577 INFO L267 ElimStorePlain]: Start of recursive call 369: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:57,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2018-11-23 01:31:57,615 INFO L267 ElimStorePlain]: Start of recursive call 370: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:57,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 01:31:57,640 INFO L267 ElimStorePlain]: Start of recursive call 371: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:57,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-23 01:31:57,659 INFO L267 ElimStorePlain]: Start of recursive call 372: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:57,670 INFO L267 ElimStorePlain]: Start of recursive call 365: 10 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:57,691 INFO L267 ElimStorePlain]: Start of recursive call 338: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:57,715 INFO L267 ElimStorePlain]: Start of recursive call 281: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 01:31:57,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 215 [2018-11-23 01:31:57,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-23 01:31:57,863 INFO L267 ElimStorePlain]: Start of recursive call 374: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:57,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 113 [2018-11-23 01:31:57,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 102 [2018-11-23 01:31:57,896 INFO L267 ElimStorePlain]: Start of recursive call 376: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:57,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2018-11-23 01:31:57,911 INFO L267 ElimStorePlain]: Start of recursive call 377: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:57,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 99 [2018-11-23 01:31:57,929 INFO L267 ElimStorePlain]: Start of recursive call 378: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:57,944 INFO L267 ElimStorePlain]: Start of recursive call 375: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:57,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:57,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 112 [2018-11-23 01:31:57,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 92 [2018-11-23 01:31:57,948 INFO L267 ElimStorePlain]: Start of recursive call 380: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:57,955 INFO L267 ElimStorePlain]: Start of recursive call 379: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:57,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-11-23 01:31:57,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:31:57,958 INFO L267 ElimStorePlain]: Start of recursive call 382: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:57,962 INFO L267 ElimStorePlain]: Start of recursive call 381: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:57,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 113 [2018-11-23 01:31:57,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 99 [2018-11-23 01:31:57,975 INFO L267 ElimStorePlain]: Start of recursive call 384: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:57,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 102 [2018-11-23 01:31:57,995 INFO L267 ElimStorePlain]: Start of recursive call 385: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:58,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2018-11-23 01:31:58,014 INFO L267 ElimStorePlain]: Start of recursive call 386: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:58,028 INFO L267 ElimStorePlain]: Start of recursive call 383: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:58,072 INFO L267 ElimStorePlain]: Start of recursive call 373: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 14 xjuncts. [2018-11-23 01:31:58,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 74 [2018-11-23 01:31:58,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-23 01:31:58,238 INFO L267 ElimStorePlain]: Start of recursive call 388: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:58,256 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:58,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:58,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 54 treesize of output 97 [2018-11-23 01:31:58,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 71 treesize of output 70 [2018-11-23 01:31:58,283 INFO L267 ElimStorePlain]: Start of recursive call 390: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:58,387 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:58,387 INFO L478 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 41 treesize of output 49 [2018-11-23 01:31:58,387 INFO L267 ElimStorePlain]: Start of recursive call 391: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:58,560 INFO L478 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 39 treesize of output 43 [2018-11-23 01:31:58,561 INFO L267 ElimStorePlain]: Start of recursive call 392: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:58,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-23 01:31:58,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 12 [2018-11-23 01:31:58,671 INFO L267 ElimStorePlain]: Start of recursive call 394: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:58,682 INFO L267 ElimStorePlain]: Start of recursive call 393: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:31:58,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-23 01:31:58,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 12 [2018-11-23 01:31:58,801 INFO L267 ElimStorePlain]: Start of recursive call 396: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:58,811 INFO L267 ElimStorePlain]: Start of recursive call 395: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:31:58,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 50 [2018-11-23 01:31:59,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-11-23 01:31:59,057 INFO L267 ElimStorePlain]: Start of recursive call 398: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 01:31:59,091 INFO L267 ElimStorePlain]: Start of recursive call 399: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:59,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 27 [2018-11-23 01:31:59,126 INFO L267 ElimStorePlain]: Start of recursive call 400: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:59,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 01:31:59,166 INFO L267 ElimStorePlain]: Start of recursive call 401: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-11-23 01:31:59,168 INFO L267 ElimStorePlain]: Start of recursive call 402: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,214 INFO L267 ElimStorePlain]: Start of recursive call 397: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:59,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 50 [2018-11-23 01:31:59,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-11-23 01:31:59,335 INFO L267 ElimStorePlain]: Start of recursive call 404: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,378 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:59,379 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:59,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-11-23 01:31:59,379 INFO L267 ElimStorePlain]: Start of recursive call 405: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-23 01:31:59,412 INFO L267 ElimStorePlain]: Start of recursive call 406: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 01:31:59,417 INFO L267 ElimStorePlain]: Start of recursive call 407: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:59,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 01:31:59,452 INFO L267 ElimStorePlain]: Start of recursive call 408: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-23 01:31:59,481 INFO L267 ElimStorePlain]: Start of recursive call 409: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,509 INFO L267 ElimStorePlain]: Start of recursive call 403: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:31:59,530 INFO L267 ElimStorePlain]: Start of recursive call 389: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,532 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:59,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2018-11-23 01:31:59,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 01:31:59,538 INFO L267 ElimStorePlain]: Start of recursive call 411: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-11-23 01:31:59,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:31:59,551 INFO L267 ElimStorePlain]: Start of recursive call 413: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-23 01:31:59,555 INFO L267 ElimStorePlain]: Start of recursive call 414: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,556 INFO L267 ElimStorePlain]: Start of recursive call 412: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,559 INFO L267 ElimStorePlain]: Start of recursive call 410: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,561 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:59,562 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:59,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 80 [2018-11-23 01:31:59,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 68 treesize of output 67 [2018-11-23 01:31:59,579 INFO L267 ElimStorePlain]: Start of recursive call 416: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-11-23 01:31:59,611 INFO L267 ElimStorePlain]: Start of recursive call 417: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2018-11-23 01:31:59,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2018-11-23 01:31:59,642 INFO L267 ElimStorePlain]: Start of recursive call 419: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-23 01:31:59,660 INFO L267 ElimStorePlain]: Start of recursive call 420: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,673 INFO L267 ElimStorePlain]: Start of recursive call 418: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,686 INFO L267 ElimStorePlain]: Start of recursive call 415: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,689 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:59,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:31:59,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 54 treesize of output 97 [2018-11-23 01:31:59,720 INFO L478 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 70 treesize of output 71 [2018-11-23 01:31:59,720 INFO L267 ElimStorePlain]: Start of recursive call 422: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,838 INFO L478 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 39 treesize of output 42 [2018-11-23 01:31:59,839 INFO L267 ElimStorePlain]: Start of recursive call 423: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 45 treesize of output 44 [2018-11-23 01:31:59,917 INFO L267 ElimStorePlain]: Start of recursive call 424: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-11-23 01:32:00,087 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:00,088 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:00,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-23 01:32:00,088 INFO L267 ElimStorePlain]: Start of recursive call 426: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 01:32:00,095 INFO L267 ElimStorePlain]: Start of recursive call 427: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,099 INFO L267 ElimStorePlain]: Start of recursive call 425: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-23 01:32:00,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 12 [2018-11-23 01:32:00,168 INFO L267 ElimStorePlain]: Start of recursive call 429: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:00,176 INFO L267 ElimStorePlain]: Start of recursive call 428: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:32:00,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 50 [2018-11-23 01:32:00,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-23 01:32:00,330 INFO L267 ElimStorePlain]: Start of recursive call 431: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-23 01:32:00,360 INFO L267 ElimStorePlain]: Start of recursive call 432: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 01:32:00,388 INFO L267 ElimStorePlain]: Start of recursive call 433: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:00,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2018-11-23 01:32:00,422 INFO L267 ElimStorePlain]: Start of recursive call 434: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:00,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-11-23 01:32:00,446 INFO L267 ElimStorePlain]: Start of recursive call 435: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2018-11-23 01:32:00,466 INFO L267 ElimStorePlain]: Start of recursive call 436: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,479 INFO L267 ElimStorePlain]: Start of recursive call 430: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:32:00,509 INFO L267 ElimStorePlain]: Start of recursive call 421: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,510 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:00,512 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:00,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 80 [2018-11-23 01:32:00,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 68 treesize of output 67 [2018-11-23 01:32:00,528 INFO L267 ElimStorePlain]: Start of recursive call 438: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 40 [2018-11-23 01:32:00,566 INFO L267 ElimStorePlain]: Start of recursive call 439: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:00,600 INFO L478 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 45 treesize of output 46 [2018-11-23 01:32:00,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 01:32:00,601 INFO L267 ElimStorePlain]: Start of recursive call 441: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:00,610 INFO L267 ElimStorePlain]: Start of recursive call 442: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 01:32:00,615 INFO L267 ElimStorePlain]: Start of recursive call 443: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,619 INFO L267 ElimStorePlain]: Start of recursive call 440: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-23 01:32:00,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:00,648 INFO L267 ElimStorePlain]: Start of recursive call 445: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:00,654 INFO L267 ElimStorePlain]: Start of recursive call 446: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,658 INFO L267 ElimStorePlain]: Start of recursive call 444: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-11-23 01:32:00,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:00,661 INFO L267 ElimStorePlain]: Start of recursive call 448: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 8 [2018-11-23 01:32:00,670 INFO L267 ElimStorePlain]: Start of recursive call 449: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:00,675 INFO L267 ElimStorePlain]: Start of recursive call 447: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:32:00,692 INFO L267 ElimStorePlain]: Start of recursive call 437: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,694 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:00,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:00,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 56 [2018-11-23 01:32:00,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 01:32:00,700 INFO L267 ElimStorePlain]: Start of recursive call 451: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-11-23 01:32:00,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:00,711 INFO L267 ElimStorePlain]: Start of recursive call 453: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:00,714 INFO L267 ElimStorePlain]: Start of recursive call 454: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,715 INFO L267 ElimStorePlain]: Start of recursive call 452: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,719 INFO L267 ElimStorePlain]: Start of recursive call 450: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,720 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:00,721 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:00,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:00,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 76 [2018-11-23 01:32:00,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-23 01:32:00,729 INFO L267 ElimStorePlain]: Start of recursive call 456: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,740 INFO L478 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 36 treesize of output 37 [2018-11-23 01:32:00,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:00,742 INFO L267 ElimStorePlain]: Start of recursive call 458: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 01:32:00,748 INFO L267 ElimStorePlain]: Start of recursive call 459: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:00,751 INFO L267 ElimStorePlain]: Start of recursive call 460: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,752 INFO L267 ElimStorePlain]: Start of recursive call 457: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,755 INFO L267 ElimStorePlain]: Start of recursive call 455: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,757 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:00,758 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:00,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:00,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 93 [2018-11-23 01:32:00,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 79 [2018-11-23 01:32:00,774 INFO L267 ElimStorePlain]: Start of recursive call 462: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 42 treesize of output 41 [2018-11-23 01:32:00,808 INFO L267 ElimStorePlain]: Start of recursive call 463: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,832 INFO L478 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 41 treesize of output 36 [2018-11-23 01:32:00,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-23 01:32:00,833 INFO L267 ElimStorePlain]: Start of recursive call 465: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 01:32:00,841 INFO L267 ElimStorePlain]: Start of recursive call 466: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:00,846 INFO L267 ElimStorePlain]: Start of recursive call 467: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,850 INFO L267 ElimStorePlain]: Start of recursive call 464: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2018-11-23 01:32:00,874 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:00,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-11-23 01:32:00,875 INFO L267 ElimStorePlain]: Start of recursive call 469: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-23 01:32:00,888 INFO L267 ElimStorePlain]: Start of recursive call 470: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 01:32:00,899 INFO L267 ElimStorePlain]: Start of recursive call 471: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,907 INFO L267 ElimStorePlain]: Start of recursive call 468: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,916 INFO L267 ElimStorePlain]: Start of recursive call 461: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,935 INFO L267 ElimStorePlain]: Start of recursive call 387: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 01:32:00,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 132 treesize of output 77 [2018-11-23 01:32:00,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 01:32:00,976 INFO L267 ElimStorePlain]: Start of recursive call 473: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:00,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:01,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 51 treesize of output 80 [2018-11-23 01:32:01,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 54 treesize of output 53 [2018-11-23 01:32:01,021 INFO L267 ElimStorePlain]: Start of recursive call 475: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,112 INFO L478 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 39 treesize of output 42 [2018-11-23 01:32:01,112 INFO L267 ElimStorePlain]: Start of recursive call 476: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2018-11-23 01:32:01,195 INFO L267 ElimStorePlain]: Start of recursive call 477: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,277 INFO L478 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 41 treesize of output 45 [2018-11-23 01:32:01,278 INFO L267 ElimStorePlain]: Start of recursive call 478: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-11-23 01:32:01,370 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:01,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-11-23 01:32:01,371 INFO L267 ElimStorePlain]: Start of recursive call 480: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,379 INFO L267 ElimStorePlain]: Start of recursive call 479: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2018-11-23 01:32:01,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-23 01:32:01,477 INFO L267 ElimStorePlain]: Start of recursive call 482: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,506 INFO L478 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 30 treesize of output 22 [2018-11-23 01:32:01,506 INFO L267 ElimStorePlain]: Start of recursive call 483: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 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-23 01:32:01,532 INFO L267 ElimStorePlain]: Start of recursive call 484: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 01:32:01,556 INFO L267 ElimStorePlain]: Start of recursive call 485: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-11-23 01:32:01,577 INFO L267 ElimStorePlain]: Start of recursive call 486: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,586 INFO L267 ElimStorePlain]: Start of recursive call 481: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2018-11-23 01:32:01,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2018-11-23 01:32:01,669 INFO L267 ElimStorePlain]: Start of recursive call 488: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,677 INFO L267 ElimStorePlain]: Start of recursive call 487: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,695 INFO L267 ElimStorePlain]: Start of recursive call 474: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,698 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:01,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 73 [2018-11-23 01:32:01,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-11-23 01:32:01,719 INFO L267 ElimStorePlain]: Start of recursive call 490: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,744 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:01,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 57 [2018-11-23 01:32:01,745 INFO L267 ElimStorePlain]: Start of recursive call 491: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,770 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:01,780 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 49 [2018-11-23 01:32:01,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 01:32:01,783 INFO L267 ElimStorePlain]: Start of recursive call 493: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-23 01:32:01,816 INFO L267 ElimStorePlain]: Start of recursive call 494: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 24 [2018-11-23 01:32:01,843 INFO L267 ElimStorePlain]: Start of recursive call 495: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-23 01:32:01,865 INFO L267 ElimStorePlain]: Start of recursive call 496: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2018-11-23 01:32:01,884 INFO L267 ElimStorePlain]: Start of recursive call 497: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,892 INFO L267 ElimStorePlain]: Start of recursive call 492: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,903 INFO L267 ElimStorePlain]: Start of recursive call 489: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:01,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:01,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 51 treesize of output 80 [2018-11-23 01:32:01,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 62 [2018-11-23 01:32:01,945 INFO L267 ElimStorePlain]: Start of recursive call 499: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:02,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-23 01:32:02,095 INFO L267 ElimStorePlain]: Start of recursive call 500: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:02,222 INFO L478 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 41 treesize of output 45 [2018-11-23 01:32:02,223 INFO L267 ElimStorePlain]: Start of recursive call 501: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:02,323 INFO L478 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 39 treesize of output 43 [2018-11-23 01:32:02,323 INFO L267 ElimStorePlain]: Start of recursive call 502: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:02,442 INFO L478 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 41 treesize of output 41 [2018-11-23 01:32:02,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 27 [2018-11-23 01:32:02,444 INFO L267 ElimStorePlain]: Start of recursive call 504: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:02,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-11-23 01:32:02,465 INFO L267 ElimStorePlain]: Start of recursive call 505: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:02,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 01:32:02,483 INFO L267 ElimStorePlain]: Start of recursive call 506: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:02,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 01:32:02,500 INFO L267 ElimStorePlain]: Start of recursive call 507: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:02,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 01:32:02,513 INFO L267 ElimStorePlain]: Start of recursive call 508: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:02,520 INFO L267 ElimStorePlain]: Start of recursive call 503: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:02,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2018-11-23 01:32:02,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 01:32:02,638 INFO L267 ElimStorePlain]: Start of recursive call 510: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:02,665 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:02,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 01:32:02,666 INFO L267 ElimStorePlain]: Start of recursive call 511: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:02,695 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:02,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 01:32:02,698 INFO L267 ElimStorePlain]: Start of recursive call 512: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:02,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 01:32:02,730 INFO L267 ElimStorePlain]: Start of recursive call 513: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:02,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-23 01:32:02,757 INFO L267 ElimStorePlain]: Start of recursive call 514: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:02,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-23 01:32:02,779 INFO L267 ElimStorePlain]: Start of recursive call 515: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:02,786 INFO L267 ElimStorePlain]: Start of recursive call 509: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:02,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2018-11-23 01:32:02,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 01:32:02,878 INFO L267 ElimStorePlain]: Start of recursive call 517: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:02,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 01:32:02,905 INFO L267 ElimStorePlain]: Start of recursive call 518: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:02,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 01:32:02,925 INFO L267 ElimStorePlain]: Start of recursive call 519: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:02,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 01:32:02,944 INFO L267 ElimStorePlain]: Start of recursive call 520: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:02,979 INFO L267 ElimStorePlain]: Start of recursive call 516: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:32:03,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-23 01:32:03,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:03,046 INFO L267 ElimStorePlain]: Start of recursive call 522: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:03,056 INFO L267 ElimStorePlain]: Start of recursive call 523: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,061 INFO L267 ElimStorePlain]: Start of recursive call 521: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,115 INFO L478 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 53 [2018-11-23 01:32:03,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-11-23 01:32:03,118 INFO L267 ElimStorePlain]: Start of recursive call 525: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-11-23 01:32:03,158 INFO L267 ElimStorePlain]: Start of recursive call 526: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 26 [2018-11-23 01:32:03,197 INFO L267 ElimStorePlain]: Start of recursive call 527: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-11-23 01:32:03,233 INFO L267 ElimStorePlain]: Start of recursive call 528: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-23 01:32:03,276 INFO L267 ElimStorePlain]: Start of recursive call 529: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,287 INFO L267 ElimStorePlain]: Start of recursive call 524: 10 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,298 INFO L478 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 55 [2018-11-23 01:32:03,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-11-23 01:32:03,301 INFO L267 ElimStorePlain]: Start of recursive call 531: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-23 01:32:03,341 INFO L267 ElimStorePlain]: Start of recursive call 532: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-23 01:32:03,380 INFO L267 ElimStorePlain]: Start of recursive call 533: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 01:32:03,406 INFO L267 ElimStorePlain]: Start of recursive call 534: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:03,468 INFO L267 ElimStorePlain]: Start of recursive call 530: 10 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:32:03,487 INFO L267 ElimStorePlain]: Start of recursive call 498: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:03,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 64 [2018-11-23 01:32:03,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-11-23 01:32:03,506 INFO L267 ElimStorePlain]: Start of recursive call 536: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2018-11-23 01:32:03,534 INFO L267 ElimStorePlain]: Start of recursive call 537: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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 39 [2018-11-23 01:32:03,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-11-23 01:32:03,561 INFO L267 ElimStorePlain]: Start of recursive call 539: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:03,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-23 01:32:03,575 INFO L267 ElimStorePlain]: Start of recursive call 540: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,585 INFO L267 ElimStorePlain]: Start of recursive call 538: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:32:03,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-23 01:32:03,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:03,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 8 [2018-11-23 01:32:03,617 INFO L267 ElimStorePlain]: Start of recursive call 542: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,621 INFO L267 ElimStorePlain]: Start of recursive call 541: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,627 INFO L267 ElimStorePlain]: Start of recursive call 535: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,640 INFO L267 ElimStorePlain]: Start of recursive call 472: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:32:03,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 77 [2018-11-23 01:32:03,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 01:32:03,677 INFO L267 ElimStorePlain]: Start of recursive call 544: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,693 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:03,694 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:03,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2018-11-23 01:32:03,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 01:32:03,700 INFO L267 ElimStorePlain]: Start of recursive call 546: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-11-23 01:32:03,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:03,709 INFO L267 ElimStorePlain]: Start of recursive call 548: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:03,712 INFO L267 ElimStorePlain]: Start of recursive call 549: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,713 INFO L267 ElimStorePlain]: Start of recursive call 547: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,716 INFO L267 ElimStorePlain]: Start of recursive call 545: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:03,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 51 treesize of output 66 [2018-11-23 01:32:03,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-11-23 01:32:03,736 INFO L267 ElimStorePlain]: Start of recursive call 551: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-11-23 01:32:03,762 INFO L267 ElimStorePlain]: Start of recursive call 552: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 47 [2018-11-23 01:32:03,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 01:32:03,793 INFO L267 ElimStorePlain]: Start of recursive call 554: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,819 INFO L478 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 21 treesize of output 13 [2018-11-23 01:32:03,819 INFO L267 ElimStorePlain]: Start of recursive call 555: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-23 01:32:03,841 INFO L267 ElimStorePlain]: Start of recursive call 556: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2018-11-23 01:32:03,860 INFO L267 ElimStorePlain]: Start of recursive call 557: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-23 01:32:03,873 INFO L267 ElimStorePlain]: Start of recursive call 558: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,880 INFO L267 ElimStorePlain]: Start of recursive call 553: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,890 INFO L267 ElimStorePlain]: Start of recursive call 550: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:03,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 51 treesize of output 66 [2018-11-23 01:32:03,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-11-23 01:32:03,911 INFO L267 ElimStorePlain]: Start of recursive call 560: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:03,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 40 [2018-11-23 01:32:03,945 INFO L267 ElimStorePlain]: Start of recursive call 561: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:03,988 INFO L478 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 42 treesize of output 48 [2018-11-23 01:32:03,990 INFO L478 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 43 treesize of output 30 [2018-11-23 01:32:03,990 INFO L267 ElimStorePlain]: Start of recursive call 563: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-11-23 01:32:04,007 INFO L267 ElimStorePlain]: Start of recursive call 564: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-23 01:32:04,020 INFO L267 ElimStorePlain]: Start of recursive call 565: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,030 INFO L267 ElimStorePlain]: Start of recursive call 562: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 47 [2018-11-23 01:32:04,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 01:32:04,064 INFO L267 ElimStorePlain]: Start of recursive call 567: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-23 01:32:04,091 INFO L267 ElimStorePlain]: Start of recursive call 568: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 26 [2018-11-23 01:32:04,114 INFO L267 ElimStorePlain]: Start of recursive call 569: End of recursive call: and 4 xjuncts. [2018-11-23 01:32:04,154 INFO L267 ElimStorePlain]: Start of recursive call 566: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:32:04,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-23 01:32:04,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-23 01:32:04,173 INFO L267 ElimStorePlain]: Start of recursive call 571: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:04,177 INFO L267 ElimStorePlain]: Start of recursive call 572: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,180 INFO L267 ElimStorePlain]: Start of recursive call 570: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,185 INFO L267 ElimStorePlain]: Start of recursive call 559: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:04,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 59 [2018-11-23 01:32:04,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-23 01:32:04,196 INFO L267 ElimStorePlain]: Start of recursive call 574: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,203 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:04,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2018-11-23 01:32:04,210 INFO L478 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 42 treesize of output 32 [2018-11-23 01:32:04,210 INFO L267 ElimStorePlain]: Start of recursive call 576: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 01:32:04,224 INFO L267 ElimStorePlain]: Start of recursive call 577: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-23 01:32:04,234 INFO L267 ElimStorePlain]: Start of recursive call 578: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 01:32:04,243 INFO L267 ElimStorePlain]: Start of recursive call 579: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2018-11-23 01:32:04,251 INFO L267 ElimStorePlain]: Start of recursive call 580: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,256 INFO L267 ElimStorePlain]: Start of recursive call 575: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,258 INFO L267 ElimStorePlain]: Start of recursive call 573: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,271 INFO L267 ElimStorePlain]: Start of recursive call 543: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:32:04,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 133 treesize of output 78 [2018-11-23 01:32:04,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-23 01:32:04,311 INFO L267 ElimStorePlain]: Start of recursive call 582: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,328 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:04,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 73 [2018-11-23 01:32:04,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-11-23 01:32:04,346 INFO L267 ElimStorePlain]: Start of recursive call 584: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,369 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:04,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 57 [2018-11-23 01:32:04,370 INFO L267 ElimStorePlain]: Start of recursive call 585: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,393 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:04,398 INFO L478 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2018-11-23 01:32:04,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-11-23 01:32:04,400 INFO L267 ElimStorePlain]: Start of recursive call 587: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-23 01:32:04,415 INFO L267 ElimStorePlain]: Start of recursive call 588: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-23 01:32:04,428 INFO L267 ElimStorePlain]: Start of recursive call 589: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-11-23 01:32:04,439 INFO L267 ElimStorePlain]: Start of recursive call 590: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2018-11-23 01:32:04,451 INFO L267 ElimStorePlain]: Start of recursive call 591: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:04,463 INFO L267 ElimStorePlain]: Start of recursive call 586: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:32:04,490 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:04,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:04,493 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2018-11-23 01:32:04,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2018-11-23 01:32:04,495 INFO L267 ElimStorePlain]: Start of recursive call 593: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 01:32:04,501 INFO L267 ElimStorePlain]: Start of recursive call 594: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,504 INFO L267 ElimStorePlain]: Start of recursive call 592: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,528 INFO L267 ElimStorePlain]: Start of recursive call 583: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:32:04,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:04,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 51 treesize of output 80 [2018-11-23 01:32:04,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 54 treesize of output 53 [2018-11-23 01:32:04,558 INFO L267 ElimStorePlain]: Start of recursive call 596: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 43 [2018-11-23 01:32:04,652 INFO L267 ElimStorePlain]: Start of recursive call 597: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:04,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-11-23 01:32:04,744 INFO L267 ElimStorePlain]: Start of recursive call 598: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:04,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 47 [2018-11-23 01:32:04,841 INFO L267 ElimStorePlain]: Start of recursive call 599: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:04,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:04,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 48 [2018-11-23 01:32:04,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 01:32:04,960 INFO L267 ElimStorePlain]: Start of recursive call 601: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:05,004 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:05,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 29 [2018-11-23 01:32:05,011 INFO L267 ElimStorePlain]: Start of recursive call 602: End of recursive call: and 4 xjuncts. [2018-11-23 01:32:05,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 29 [2018-11-23 01:32:05,067 INFO L267 ElimStorePlain]: Start of recursive call 603: End of recursive call: and 4 xjuncts. [2018-11-23 01:32:05,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 26 [2018-11-23 01:32:05,119 INFO L267 ElimStorePlain]: Start of recursive call 604: End of recursive call: and 4 xjuncts. [2018-11-23 01:32:05,152 INFO L267 ElimStorePlain]: Start of recursive call 600: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-23 01:32:05,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2018-11-23 01:32:05,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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-23 01:32:05,278 INFO L267 ElimStorePlain]: Start of recursive call 606: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:05,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 26 [2018-11-23 01:32:05,304 INFO L267 ElimStorePlain]: Start of recursive call 607: End of recursive call: and 4 xjuncts. [2018-11-23 01:32:05,324 INFO L267 ElimStorePlain]: Start of recursive call 605: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:32:05,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2018-11-23 01:32:05,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-11-23 01:32:05,417 INFO L267 ElimStorePlain]: Start of recursive call 609: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:05,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 30 [2018-11-23 01:32:05,437 INFO L267 ElimStorePlain]: Start of recursive call 610: End of recursive call: and 4 xjuncts. [2018-11-23 01:32:05,463 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:05,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-23 01:32:05,464 INFO L267 ElimStorePlain]: Start of recursive call 611: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:05,480 INFO L267 ElimStorePlain]: Start of recursive call 608: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:32:05,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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 36 [2018-11-23 01:32:05,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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-23 01:32:05,564 INFO L267 ElimStorePlain]: Start of recursive call 613: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:05,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 26 [2018-11-23 01:32:05,585 INFO L267 ElimStorePlain]: Start of recursive call 614: End of recursive call: and 4 xjuncts. [2018-11-23 01:32:05,606 INFO L267 ElimStorePlain]: Start of recursive call 612: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 01:32:05,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2018-11-23 01:32:05,788 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2018-11-23 01:32:05,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 01:32:05,790 INFO L267 ElimStorePlain]: Start of recursive call 616: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:05,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 29 [2018-11-23 01:32:05,856 INFO L267 ElimStorePlain]: Start of recursive call 617: End of recursive call: and 4 xjuncts. [2018-11-23 01:32:05,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 01:32:05,929 INFO L267 ElimStorePlain]: Start of recursive call 618: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:06,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 27 [2018-11-23 01:32:06,032 INFO L267 ElimStorePlain]: Start of recursive call 619: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:06,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 01:32:06,082 INFO L267 ElimStorePlain]: Start of recursive call 620: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 26 [2018-11-23 01:32:06,129 INFO L267 ElimStorePlain]: Start of recursive call 621: End of recursive call: and 4 xjuncts. [2018-11-23 01:32:06,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 01:32:06,174 INFO L267 ElimStorePlain]: Start of recursive call 622: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:06,226 INFO L267 ElimStorePlain]: Start of recursive call 615: 10 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 01:32:06,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-23 01:32:06,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-23 01:32:06,282 INFO L267 ElimStorePlain]: Start of recursive call 624: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,285 INFO L267 ElimStorePlain]: Start of recursive call 623: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,318 INFO L267 ElimStorePlain]: Start of recursive call 595: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:32:06,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:06,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 64 [2018-11-23 01:32:06,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-11-23 01:32:06,334 INFO L267 ElimStorePlain]: Start of recursive call 626: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2018-11-23 01:32:06,360 INFO L267 ElimStorePlain]: Start of recursive call 627: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2018-11-23 01:32:06,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-11-23 01:32:06,387 INFO L267 ElimStorePlain]: Start of recursive call 629: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:06,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-23 01:32:06,400 INFO L267 ElimStorePlain]: Start of recursive call 630: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,410 INFO L267 ElimStorePlain]: Start of recursive call 628: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:32:06,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-23 01:32:06,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:06,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-23 01:32:06,440 INFO L267 ElimStorePlain]: Start of recursive call 632: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,444 INFO L267 ElimStorePlain]: Start of recursive call 631: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,450 INFO L267 ElimStorePlain]: Start of recursive call 625: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:06,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 51 treesize of output 80 [2018-11-23 01:32:06,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 58 [2018-11-23 01:32:06,481 INFO L267 ElimStorePlain]: Start of recursive call 634: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 42 treesize of output 41 [2018-11-23 01:32:06,570 INFO L267 ElimStorePlain]: Start of recursive call 635: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42 [2018-11-23 01:32:06,649 INFO L267 ElimStorePlain]: Start of recursive call 636: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-11-23 01:32:06,728 INFO L267 ElimStorePlain]: Start of recursive call 637: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-11-23 01:32:06,809 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:06,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-23 01:32:06,810 INFO L267 ElimStorePlain]: Start of recursive call 639: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 01:32:06,816 INFO L267 ElimStorePlain]: Start of recursive call 640: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,820 INFO L267 ElimStorePlain]: Start of recursive call 638: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2018-11-23 01:32:06,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2018-11-23 01:32:06,905 INFO L267 ElimStorePlain]: Start of recursive call 642: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:06,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2018-11-23 01:32:06,932 INFO L267 ElimStorePlain]: Start of recursive call 643: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 01:32:06,953 INFO L267 ElimStorePlain]: Start of recursive call 644: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 01:32:06,973 INFO L267 ElimStorePlain]: Start of recursive call 645: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:06,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 01:32:06,993 INFO L267 ElimStorePlain]: Start of recursive call 646: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,017 INFO L267 ElimStorePlain]: Start of recursive call 641: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:32:07,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-11-23 01:32:07,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 01:32:07,070 INFO L267 ElimStorePlain]: Start of recursive call 648: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:07,079 INFO L267 ElimStorePlain]: Start of recursive call 647: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:32:07,149 INFO L267 ElimStorePlain]: Start of recursive call 633: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:32:07,173 INFO L267 ElimStorePlain]: Start of recursive call 581: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 01:32:07,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 133 treesize of output 78 [2018-11-23 01:32:07,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-23 01:32:07,213 INFO L267 ElimStorePlain]: Start of recursive call 650: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,234 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:07,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 59 [2018-11-23 01:32:07,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 01:32:07,244 INFO L267 ElimStorePlain]: Start of recursive call 652: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,253 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:07,258 INFO L478 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 47 [2018-11-23 01:32:07,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-11-23 01:32:07,260 INFO L267 ElimStorePlain]: Start of recursive call 654: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-23 01:32:07,274 INFO L267 ElimStorePlain]: Start of recursive call 655: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 10 [2018-11-23 01:32:07,285 INFO L267 ElimStorePlain]: Start of recursive call 656: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2018-11-23 01:32:07,298 INFO L267 ElimStorePlain]: Start of recursive call 657: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:07,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-23 01:32:07,311 INFO L267 ElimStorePlain]: Start of recursive call 658: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 01:32:07,313 INFO L267 ElimStorePlain]: Start of recursive call 659: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,323 INFO L267 ElimStorePlain]: Start of recursive call 653: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:32:07,333 INFO L267 ElimStorePlain]: Start of recursive call 651: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:32:07,335 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:07,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:07,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2018-11-23 01:32:07,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 01:32:07,343 INFO L267 ElimStorePlain]: Start of recursive call 661: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-11-23 01:32:07,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:07,353 INFO L267 ElimStorePlain]: Start of recursive call 663: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:07,358 INFO L267 ElimStorePlain]: Start of recursive call 664: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,359 INFO L267 ElimStorePlain]: Start of recursive call 662: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,363 INFO L267 ElimStorePlain]: Start of recursive call 660: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:07,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 51 treesize of output 66 [2018-11-23 01:32:07,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-11-23 01:32:07,390 INFO L267 ElimStorePlain]: Start of recursive call 666: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 40 [2018-11-23 01:32:07,429 INFO L267 ElimStorePlain]: Start of recursive call 667: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:07,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-23 01:32:07,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:07,468 INFO L267 ElimStorePlain]: Start of recursive call 669: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:07,476 INFO L267 ElimStorePlain]: Start of recursive call 670: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,481 INFO L267 ElimStorePlain]: Start of recursive call 668: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-11-23 01:32:07,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:07,486 INFO L267 ElimStorePlain]: Start of recursive call 672: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-23 01:32:07,498 INFO L267 ElimStorePlain]: Start of recursive call 673: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:07,504 INFO L267 ElimStorePlain]: Start of recursive call 671: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:32:07,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2018-11-23 01:32:07,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2018-11-23 01:32:07,552 INFO L267 ElimStorePlain]: Start of recursive call 675: End of recursive call: and 8 xjuncts. [2018-11-23 01:32:07,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 01:32:07,622 INFO L267 ElimStorePlain]: Start of recursive call 676: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:07,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-23 01:32:07,673 INFO L267 ElimStorePlain]: Start of recursive call 677: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-23 01:32:07,723 INFO L267 ElimStorePlain]: Start of recursive call 678: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 01:32:07,774 INFO L267 ElimStorePlain]: Start of recursive call 679: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:07,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-11-23 01:32:07,824 INFO L267 ElimStorePlain]: Start of recursive call 680: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 01:32:07,825 INFO L267 ElimStorePlain]: Start of recursive call 681: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 01:32:07,857 INFO L267 ElimStorePlain]: Start of recursive call 682: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 01:32:07,881 INFO L267 ElimStorePlain]: Start of recursive call 683: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,898 INFO L267 ElimStorePlain]: Start of recursive call 674: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 01:32:07,925 INFO L267 ElimStorePlain]: Start of recursive call 665: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:32:07,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:07,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 51 treesize of output 66 [2018-11-23 01:32:07,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-11-23 01:32:07,947 INFO L267 ElimStorePlain]: Start of recursive call 685: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:07,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-11-23 01:32:07,975 INFO L267 ElimStorePlain]: Start of recursive call 686: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 47 [2018-11-23 01:32:08,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2018-11-23 01:32:08,006 INFO L267 ElimStorePlain]: Start of recursive call 688: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 01:32:08,031 INFO L267 ElimStorePlain]: Start of recursive call 689: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 23 [2018-11-23 01:32:08,059 INFO L267 ElimStorePlain]: Start of recursive call 690: End of recursive call: and 4 xjuncts. [2018-11-23 01:32:08,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-23 01:32:08,089 INFO L267 ElimStorePlain]: Start of recursive call 691: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2018-11-23 01:32:08,111 INFO L267 ElimStorePlain]: Start of recursive call 692: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:08,133 INFO L267 ElimStorePlain]: Start of recursive call 687: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:32:08,163 INFO L267 ElimStorePlain]: Start of recursive call 684: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:32:08,187 INFO L267 ElimStorePlain]: Start of recursive call 649: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 01:32:08,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 134 treesize of output 79 [2018-11-23 01:32:08,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 01:32:08,230 INFO L267 ElimStorePlain]: Start of recursive call 694: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:08,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 54 treesize of output 68 [2018-11-23 01:32:08,266 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:08,267 INFO L478 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 56 treesize of output 64 [2018-11-23 01:32:08,267 INFO L267 ElimStorePlain]: Start of recursive call 696: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,297 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:08,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2018-11-23 01:32:08,298 INFO L267 ElimStorePlain]: Start of recursive call 697: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2018-11-23 01:32:08,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 01:32:08,326 INFO L267 ElimStorePlain]: Start of recursive call 699: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-11-23 01:32:08,339 INFO L267 ElimStorePlain]: Start of recursive call 700: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,348 INFO L267 ElimStorePlain]: Start of recursive call 698: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:32:08,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-23 01:32:08,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-23 01:32:08,365 INFO L267 ElimStorePlain]: Start of recursive call 702: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,369 INFO L267 ElimStorePlain]: Start of recursive call 701: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,377 INFO L267 ElimStorePlain]: Start of recursive call 695: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,379 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:08,380 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:08,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 64 [2018-11-23 01:32:08,387 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:08,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 27 [2018-11-23 01:32:08,387 INFO L267 ElimStorePlain]: Start of recursive call 704: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,397 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:08,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2018-11-23 01:32:08,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 01:32:08,400 INFO L267 ElimStorePlain]: Start of recursive call 706: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 01:32:08,406 INFO L267 ElimStorePlain]: Start of recursive call 707: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,409 INFO L267 ElimStorePlain]: Start of recursive call 705: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,412 INFO L267 ElimStorePlain]: Start of recursive call 703: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,413 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 01:32:08,413 INFO L267 ElimStorePlain]: Start of recursive call 708: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:08,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2018-11-23 01:32:08,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-11-23 01:32:08,419 INFO L267 ElimStorePlain]: Start of recursive call 710: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-23 01:32:08,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2018-11-23 01:32:08,429 INFO L267 ElimStorePlain]: Start of recursive call 712: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,431 INFO L267 ElimStorePlain]: Start of recursive call 711: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,434 INFO L267 ElimStorePlain]: Start of recursive call 709: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-11-23 01:32:08,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 01:32:08,439 INFO L267 ElimStorePlain]: Start of recursive call 714: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-23 01:32:08,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 01:32:08,446 INFO L267 ElimStorePlain]: Start of recursive call 716: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,447 INFO L267 ElimStorePlain]: Start of recursive call 715: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,450 INFO L267 ElimStorePlain]: Start of recursive call 713: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:08,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2018-11-23 01:32:08,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 01:32:08,456 INFO L267 ElimStorePlain]: Start of recursive call 718: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:32:08,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2018-11-23 01:32:08,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 01:32:08,466 INFO L267 ElimStorePlain]: Start of recursive call 720: End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,468 INFO L267 ElimStorePlain]: Start of recursive call 719: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,472 INFO L267 ElimStorePlain]: Start of recursive call 717: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:32:08,484 INFO L267 ElimStorePlain]: Start of recursive call 693: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:32:08,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-11-23 01:32:08,599 INFO L202 ElimStorePlain]: Needed 720 recursive calls to eliminate 14 variables, input treesize:541, output treesize:96 [2018-11-23 01:32:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 01:32:08,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:32:08,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 35 [2018-11-23 01:32:08,692 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:32:08,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 01:32:08,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 01:32:08,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1079, Unknown=6, NotChecked=0, Total=1190 [2018-11-23 01:32:08,694 INFO L87 Difference]: Start difference. First operand 124 states and 152 transitions. Second operand 26 states. [2018-11-23 01:32:09,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:09,341 INFO L93 Difference]: Finished difference Result 213 states and 262 transitions. [2018-11-23 01:32:09,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 01:32:09,341 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-11-23 01:32:09,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:09,342 INFO L225 Difference]: With dead ends: 213 [2018-11-23 01:32:09,342 INFO L226 Difference]: Without dead ends: 199 [2018-11-23 01:32:09,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 79 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=127, Invalid=1272, Unknown=7, NotChecked=0, Total=1406 [2018-11-23 01:32:09,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-23 01:32:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 173. [2018-11-23 01:32:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-23 01:32:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 214 transitions. [2018-11-23 01:32:09,356 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 214 transitions. Word has length 55 [2018-11-23 01:32:09,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:09,357 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 214 transitions. [2018-11-23 01:32:09,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 01:32:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 214 transitions. [2018-11-23 01:32:09,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 01:32:09,358 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:09,358 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:32:09,358 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:09,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:09,358 INFO L82 PathProgramCache]: Analyzing trace with hash 542766457, now seen corresponding path program 1 times [2018-11-23 01:32:09,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:32:09,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:09,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:32:09,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:09,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:32:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:09,462 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 01:32:09,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:32:09,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:32:09,463 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-23 01:32:09,463 INFO L202 CegarAbsIntRunner]: [1], [3], [5], [10], [13], [19], [29], [31], [34], [39], [42], [49], [51], [55], [56], [62], [63], [78], [83], [86], [92], [94], [98], [99], [100], [105], [108], [110], [116], [118], [122], [123], [157], [158], [159], [160], [161], [162], [167], [168], [175], [176], [177] [2018-11-23 01:32:09,464 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:32:09,464 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:32:09,535 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:32:09,535 INFO L272 AbstractInterpreter]: Visited 43 different actions 80 times. Merged at 14 different actions 26 times. Widened at 1 different actions 1 times. Performed 603 root evaluator evaluations with a maximum evaluation depth of 4. Performed 603 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 5 different actions. Largest state had 26 variables. [2018-11-23 01:32:09,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:09,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:32:09,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:32:09,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:32:09,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:09,562 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:32:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:09,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:32:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 01:32:09,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:32:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 01:32:09,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:32:09,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2018-11-23 01:32:09,764 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:32:09,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 01:32:09,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 01:32:09,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-11-23 01:32:09,765 INFO L87 Difference]: Start difference. First operand 173 states and 214 transitions. Second operand 14 states. [2018-11-23 01:32:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:09,953 INFO L93 Difference]: Finished difference Result 325 states and 420 transitions. [2018-11-23 01:32:09,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 01:32:09,954 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-11-23 01:32:09,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:09,955 INFO L225 Difference]: With dead ends: 325 [2018-11-23 01:32:09,955 INFO L226 Difference]: Without dead ends: 230 [2018-11-23 01:32:09,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2018-11-23 01:32:09,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-23 01:32:09,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 187. [2018-11-23 01:32:09,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-23 01:32:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 236 transitions. [2018-11-23 01:32:09,971 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 236 transitions. Word has length 57 [2018-11-23 01:32:09,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:09,971 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 236 transitions. [2018-11-23 01:32:09,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 01:32:09,971 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 236 transitions. [2018-11-23 01:32:09,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 01:32:09,972 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:09,973 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:32:09,973 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:09,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:09,973 INFO L82 PathProgramCache]: Analyzing trace with hash 965468283, now seen corresponding path program 1 times [2018-11-23 01:32:09,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:32:09,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:09,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:09,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:09,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:32:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:32:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:32:10,027 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=8, |#NULL.offset|=5, |old(#NULL.base)|=8, |old(#NULL.offset)|=5] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=8, |old(#NULL.offset)|=5] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=8, |old(#NULL.offset)|=5] [?] RET #176#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret24 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret14 := _get_nondet_int(2, 5); VAL [|#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=2, |_get_nondet_int_#in~until|=5] [?] ~from := #in~from;~until := #in~until;~len~1 := ~from; VAL [_get_nondet_int_~from=2, _get_nondet_int_~len~1=2, _get_nondet_int_~until=5, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=2, |_get_nondet_int_#in~until|=5] [?] #t~short12 := ~len~1 < ~until; VAL [_get_nondet_int_~from=2, _get_nondet_int_~len~1=2, _get_nondet_int_~until=5, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=2, |_get_nondet_int_#in~until|=5, |_get_nondet_int_#t~short12|=true] [?] assume #t~short12;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;#t~short12 := 0 != #t~nondet11; VAL [_get_nondet_int_~from=2, _get_nondet_int_~len~1=2, _get_nondet_int_~until=5, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=2, |_get_nondet_int_#in~until|=5, |_get_nondet_int_#t~nondet11|=0, |_get_nondet_int_#t~short12|=false] [?] assume !#t~short12;havoc #t~short12;havoc #t~nondet11; VAL [_get_nondet_int_~from=2, _get_nondet_int_~len~1=2, _get_nondet_int_~until=5, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=2, |_get_nondet_int_#in~until|=5] [?] #res := ~len~1; VAL [_get_nondet_int_~from=2, _get_nondet_int_~len~1=2, _get_nondet_int_~until=5, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=2, |_get_nondet_int_#in~until|=5, |_get_nondet_int_#res|=2] [?] assume true; VAL [_get_nondet_int_~from=2, _get_nondet_int_~len~1=2, _get_nondet_int_~until=5, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=2, |_get_nondet_int_#in~until|=5, |_get_nondet_int_#res|=2] [?] RET #158#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret14|=2] [?] assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~len~2 := #t~ret14;havoc #t~ret14;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); VAL [main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] CALL call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); VAL [|#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2] [?] ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=2, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2] [?] #t~post2 := ~len;~len := #t~post2 - 1; VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=1, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~post2|=2] [?] assume !!(#t~post2 > 0);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=1, sll_create_~new_head~0.base=6, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~malloc3.base|=6, |sll_create_#t~malloc3.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=1, sll_create_~new_head~0.base=6, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~malloc3.base|=6, |sll_create_#t~malloc3.offset|=0] [?] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; VAL [sll_create_~head~0.base=6, sll_create_~head~0.offset=0, sll_create_~len=1, sll_create_~new_head~0.base=6, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~malloc3.base|=6, |sll_create_#t~malloc3.offset|=0] [?] #t~post2 := ~len;~len := #t~post2 - 1; VAL [sll_create_~head~0.base=6, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=6, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~malloc3.base|=6, |sll_create_#t~malloc3.offset|=0, |sll_create_#t~post2|=1] [?] assume !!(#t~post2 > 0);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [sll_create_~head~0.base=6, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=9, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~malloc3.base|=9, |sll_create_#t~malloc3.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [sll_create_~head~0.base=6, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=9, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~malloc3.base|=9, |sll_create_#t~malloc3.offset|=0] [?] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; VAL [sll_create_~head~0.base=9, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=9, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~malloc3.base|=9, |sll_create_#t~malloc3.offset|=0] [?] #t~post2 := ~len;~len := #t~post2 - 1; VAL [sll_create_~head~0.base=9, sll_create_~head~0.offset=0, sll_create_~len=(- 1), sll_create_~new_head~0.base=9, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~malloc3.base|=9, |sll_create_#t~malloc3.offset|=0, |sll_create_#t~post2|=0] [?] assume !(#t~post2 > 0);havoc #t~post2; VAL [sll_create_~head~0.base=9, sll_create_~head~0.offset=0, sll_create_~len=(- 1), sll_create_~new_head~0.base=9, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~malloc3.base|=9, |sll_create_#t~malloc3.offset|=0] [?] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [sll_create_~head~0.base=9, sll_create_~head~0.offset=0, sll_create_~len=(- 1), sll_create_~new_head~0.base=9, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#res.base|=9, |sll_create_#res.offset|=0, |sll_create_#t~malloc3.base|=9, |sll_create_#t~malloc3.offset|=0] [?] assume true; VAL [sll_create_~head~0.base=9, sll_create_~head~0.offset=0, sll_create_~len=(- 1), sll_create_~new_head~0.base=9, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#res.base|=9, |sll_create_#res.offset|=0, |sll_create_#t~malloc3.base|=9, |sll_create_#t~malloc3.offset|=0] [?] RET #160#return; VAL [main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret15.base|=9, |main_#t~ret15.offset|=0, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] call write~init~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret15.base, #t~ret15.offset; VAL [main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] CALL call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1] [?] ~from := #in~from;~until := #in~until;~len~1 := ~from; VAL [_get_nondet_int_~from=0, _get_nondet_int_~len~1=0, _get_nondet_int_~until=1, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1] [?] #t~short12 := ~len~1 < ~until; VAL [_get_nondet_int_~from=0, _get_nondet_int_~len~1=0, _get_nondet_int_~until=1, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1, |_get_nondet_int_#t~short12|=true] [?] assume #t~short12;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;#t~short12 := 0 != #t~nondet11; VAL [_get_nondet_int_~from=0, _get_nondet_int_~len~1=0, _get_nondet_int_~until=1, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1, |_get_nondet_int_#t~nondet11|=1, |_get_nondet_int_#t~short12|=true] [?] assume !!#t~short12;havoc #t~short12;havoc #t~nondet11;#t~post13 := ~len~1;~len~1 := 1 + #t~post13;havoc #t~post13; VAL [_get_nondet_int_~from=0, _get_nondet_int_~len~1=1, _get_nondet_int_~until=1, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1] [?] #t~short12 := ~len~1 < ~until; VAL [_get_nondet_int_~from=0, _get_nondet_int_~len~1=1, _get_nondet_int_~until=1, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1, |_get_nondet_int_#t~short12|=false] [?] assume !#t~short12; VAL [_get_nondet_int_~from=0, _get_nondet_int_~len~1=1, _get_nondet_int_~until=1, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1, |_get_nondet_int_#t~short12|=false] [?] assume !#t~short12;havoc #t~short12;havoc #t~nondet11; VAL [_get_nondet_int_~from=0, _get_nondet_int_~len~1=1, _get_nondet_int_~until=1, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1] [?] #res := ~len~1; VAL [_get_nondet_int_~from=0, _get_nondet_int_~len~1=1, _get_nondet_int_~until=1, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1, |_get_nondet_int_#res|=1] [?] assume true; VAL [_get_nondet_int_~from=0, _get_nondet_int_~len~1=1, _get_nondet_int_~until=1, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1, |_get_nondet_int_#res|=1] [?] RET #162#return; VAL [main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret16|=1, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~k~0 := #t~ret16;havoc #t~ret16;~i~0 := 0; VAL [main_~i~0=0, main_~k~0=1, main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] #t~short18 := ~i~0 < ~k~0; VAL [main_~i~0=0, main_~k~0=1, main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short18|=true, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; VAL [main_~i~0=0, main_~k~0=1, main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~nondet17|=0, |main_#t~short18|=false, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] assume !#t~short18;havoc #t~short18;havoc #t~nondet17; VAL [main_~i~0=0, main_~k~0=1, main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); VAL [main_~i~0=0, main_~k~0=1, main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem21.base|=9, |main_#t~mem21.offset|=0, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] CALL call #t~ret22 := sll_length(#t~mem21.base, #t~mem21.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=9, |sll_length_#in~head.offset|=0] [?] ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; VAL [sll_length_~head.base=9, sll_length_~head.offset=0, sll_length_~len~0=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=9, |sll_length_#in~head.offset|=0] [?] assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; VAL [sll_length_~head.base=6, sll_length_~head.offset=0, sll_length_~len~0=1, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=9, |sll_length_#in~head.offset|=0] [?] assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=2, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=9, |sll_length_#in~head.offset|=0] [?] assume !(~head.base != 0 || ~head.offset != 0); VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=2, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=9, |sll_length_#in~head.offset|=0] [?] #res := ~len~0; VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=2, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=9, |sll_length_#in~head.offset|=0, |sll_length_#res|=2] [?] assume true; VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=2, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=9, |sll_length_#in~head.offset|=0, |sll_length_#res|=2] [?] RET #168#return; VAL [main_~i~0=0, main_~k~0=1, main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem21.base|=9, |main_#t~mem21.offset|=0, |main_#t~ret22|=2, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647; VAL [main_~i~0=0, main_~k~0=1, main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem21.base|=9, |main_#t~mem21.offset|=0, |main_#t~ret22|=2, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] assume ~k~0 + ~len~2 != #t~ret22;havoc #t~ret22;havoc #t~mem21.base, #t~mem21.offset; VAL [main_~i~0=0, main_~k~0=1, main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] assume !false; VAL [main_~i~0=0, main_~k~0=1, main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=8, #NULL.offset=5, old(#NULL.base)=8, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L616] CALL call #t~ret14 := _get_nondet_int(2, 5); VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, ~from=2, ~len~1=2, ~until=5] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, #t~short12=true, ~from=2, ~len~1=2, ~until=5] [L610] assume #t~short12; [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, #t~nondet11=0, #t~short12=false, ~from=2, ~len~1=2, ~until=5] [L610-L612] assume !#t~short12; [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, ~from=2, ~len~1=2, ~until=5] [L613] #res := ~len~1; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, #res=2, ~from=2, ~len~1=2, ~until=5] [L608-L614] ensures true; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, #res=2, ~from=2, ~len~1=2, ~until=5] [L616] RET call #t~ret14 := _get_nondet_int(2, 5); VAL [#NULL.base=0, #NULL.offset=0, #t~ret14=2] [L616] assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; [L616] ~len~2 := #t~ret14; [L616] havoc #t~ret14; [L617] call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~len~2=2] [L617] CALL call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); VAL [#in~len=2, #NULL.base=0, #NULL.offset=0] [L563-L574] ~len := #in~len; [L564] ~head~0.base, ~head~0.offset := 0, 0; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=2] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~post2=2, ~head~0.base=0, ~head~0.offset=0, ~len=1] [L565-L572] assume !!(#t~post2 > 0); [L565] havoc #t~post2; [L566] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=6, #t~malloc3.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=1, ~new_head~0.base=6, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=6, #t~malloc3.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=1, ~new_head~0.base=6, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=6, #t~malloc3.offset=0, ~head~0.base=6, ~head~0.offset=0, ~len=1, ~new_head~0.base=6, ~new_head~0.offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=6, #t~malloc3.offset=0, #t~post2=1, ~head~0.base=6, ~head~0.offset=0, ~len=0, ~new_head~0.base=6, ~new_head~0.offset=0] [L565-L572] assume !!(#t~post2 > 0); [L565] havoc #t~post2; [L566] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=6, ~head~0.offset=0, ~len=0, ~new_head~0.base=9, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=6, ~head~0.offset=0, ~len=0, ~new_head~0.base=9, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=9, ~head~0.offset=0, ~len=0, ~new_head~0.base=9, ~new_head~0.offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, #t~post2=0, ~head~0.base=9, ~head~0.offset=0, ~len=-1, ~new_head~0.base=9, ~new_head~0.offset=0] [L565-L572] assume !(#t~post2 > 0); [L565] havoc #t~post2; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=9, ~head~0.offset=0, ~len=-1, ~new_head~0.base=9, ~new_head~0.offset=0] [L573] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #res.base=9, #res.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=9, ~head~0.offset=0, ~len=-1, ~new_head~0.base=9, ~new_head~0.offset=0] [L563-L574] ensures true; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #res.base=9, #res.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=9, ~head~0.offset=0, ~len=-1, ~new_head~0.base=9, ~new_head~0.offset=0] [L617] RET call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); VAL [#NULL.base=0, #NULL.offset=0, #t~ret15.base=9, #t~ret15.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~len~2=2] [L617] call write~init~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4); [L617] havoc #t~ret15.base, #t~ret15.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~len~2=2] [L618] CALL call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, ~from=0, ~len~1=0, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610] assume #t~short12; [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #t~nondet11=1, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610-L612] assume !!#t~short12; [L610] havoc #t~short12; [L610] havoc #t~nondet11; [L611] #t~post13 := ~len~1; [L611] ~len~1 := 1 + #t~post13; [L611] havoc #t~post13; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, ~from=0, ~len~1=1, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610] assume !#t~short12; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610-L612] assume !#t~short12; [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, ~from=0, ~len~1=1, ~until=1] [L613] #res := ~len~1; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #res=1, ~from=0, ~len~1=1, ~until=1] [L608-L614] ensures true; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #res=1, ~from=0, ~len~1=1, ~until=1] [L618] RET call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#NULL.base=0, #NULL.offset=0, #t~ret16=1, ~#s~0.base=7, ~#s~0.offset=0, ~len~2=2] [L618] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L618] ~k~0 := #t~ret16; [L618] havoc #t~ret16; [L619] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] #t~short18 := ~i~0 < ~k~0; VAL [#NULL.base=0, #NULL.offset=0, #t~short18=true, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] assume #t~short18; [L620] assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; [L620] #t~short18 := 0 != #t~nondet17; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet17=0, #t~short18=false, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620-L624] assume !#t~short18; [L620] havoc #t~short18; [L620] havoc #t~nondet17; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem21.base=9, #t~mem21.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] CALL call #t~ret22 := sll_length(#t~mem21.base, #t~mem21.offset); VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0] [L575-L582] ~head.base, ~head.offset := #in~head.base, #in~head.offset; [L576] ~len~0 := 0; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=9, ~head.offset=0, ~len~0=0] [L577-L580] assume !!(~head.base != 0 || ~head.offset != 0); [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L579] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L579] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=6, ~head.offset=0, ~len~0=1] [L577-L580] assume !!(~head.base != 0 || ~head.offset != 0); [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L579] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L579] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=2] [L577-L580] assume !(~head.base != 0 || ~head.offset != 0); VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=2] [L581] #res := ~len~0; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=2, ~head.base=0, ~head.offset=0, ~len~0=2] [L575-L582] ensures true; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=2, ~head.base=0, ~head.offset=0, ~len~0=2] [L625] RET call #t~ret22 := sll_length(#t~mem21.base, #t~mem21.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~mem21.base=9, #t~mem21.offset=0, #t~ret22=2, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~mem21.base=9, #t~mem21.offset=0, #t~ret22=2, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625-L627] assume ~k~0 + ~len~2 != #t~ret22; [L625] havoc #t~ret22; [L625] havoc #t~mem21.base, #t~mem21.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L630] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=8, #NULL.offset=5, old(#NULL.base)=8, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L616] CALL call #t~ret14 := _get_nondet_int(2, 5); VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, ~from=2, ~len~1=2, ~until=5] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, #t~short12=true, ~from=2, ~len~1=2, ~until=5] [L610] assume #t~short12; [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, #t~nondet11=0, #t~short12=false, ~from=2, ~len~1=2, ~until=5] [L610-L612] assume !#t~short12; [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, ~from=2, ~len~1=2, ~until=5] [L613] #res := ~len~1; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, #res=2, ~from=2, ~len~1=2, ~until=5] [L608-L614] ensures true; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, #res=2, ~from=2, ~len~1=2, ~until=5] [L616] RET call #t~ret14 := _get_nondet_int(2, 5); VAL [#NULL.base=0, #NULL.offset=0, #t~ret14=2] [L616] assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; [L616] ~len~2 := #t~ret14; [L616] havoc #t~ret14; [L617] call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~len~2=2] [L617] CALL call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); VAL [#in~len=2, #NULL.base=0, #NULL.offset=0] [L563-L574] ~len := #in~len; [L564] ~head~0.base, ~head~0.offset := 0, 0; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=2] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~post2=2, ~head~0.base=0, ~head~0.offset=0, ~len=1] [L565-L572] assume !!(#t~post2 > 0); [L565] havoc #t~post2; [L566] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=6, #t~malloc3.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=1, ~new_head~0.base=6, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=6, #t~malloc3.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=1, ~new_head~0.base=6, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=6, #t~malloc3.offset=0, ~head~0.base=6, ~head~0.offset=0, ~len=1, ~new_head~0.base=6, ~new_head~0.offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=6, #t~malloc3.offset=0, #t~post2=1, ~head~0.base=6, ~head~0.offset=0, ~len=0, ~new_head~0.base=6, ~new_head~0.offset=0] [L565-L572] assume !!(#t~post2 > 0); [L565] havoc #t~post2; [L566] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=6, ~head~0.offset=0, ~len=0, ~new_head~0.base=9, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=6, ~head~0.offset=0, ~len=0, ~new_head~0.base=9, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=9, ~head~0.offset=0, ~len=0, ~new_head~0.base=9, ~new_head~0.offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, #t~post2=0, ~head~0.base=9, ~head~0.offset=0, ~len=-1, ~new_head~0.base=9, ~new_head~0.offset=0] [L565-L572] assume !(#t~post2 > 0); [L565] havoc #t~post2; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=9, ~head~0.offset=0, ~len=-1, ~new_head~0.base=9, ~new_head~0.offset=0] [L573] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #res.base=9, #res.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=9, ~head~0.offset=0, ~len=-1, ~new_head~0.base=9, ~new_head~0.offset=0] [L563-L574] ensures true; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #res.base=9, #res.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=9, ~head~0.offset=0, ~len=-1, ~new_head~0.base=9, ~new_head~0.offset=0] [L617] RET call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); VAL [#NULL.base=0, #NULL.offset=0, #t~ret15.base=9, #t~ret15.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~len~2=2] [L617] call write~init~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4); [L617] havoc #t~ret15.base, #t~ret15.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~len~2=2] [L618] CALL call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, ~from=0, ~len~1=0, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610] assume #t~short12; [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #t~nondet11=1, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610-L612] assume !!#t~short12; [L610] havoc #t~short12; [L610] havoc #t~nondet11; [L611] #t~post13 := ~len~1; [L611] ~len~1 := 1 + #t~post13; [L611] havoc #t~post13; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, ~from=0, ~len~1=1, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610] assume !#t~short12; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610-L612] assume !#t~short12; [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, ~from=0, ~len~1=1, ~until=1] [L613] #res := ~len~1; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #res=1, ~from=0, ~len~1=1, ~until=1] [L608-L614] ensures true; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #res=1, ~from=0, ~len~1=1, ~until=1] [L618] RET call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#NULL.base=0, #NULL.offset=0, #t~ret16=1, ~#s~0.base=7, ~#s~0.offset=0, ~len~2=2] [L618] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L618] ~k~0 := #t~ret16; [L618] havoc #t~ret16; [L619] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] #t~short18 := ~i~0 < ~k~0; VAL [#NULL.base=0, #NULL.offset=0, #t~short18=true, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] assume #t~short18; [L620] assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; [L620] #t~short18 := 0 != #t~nondet17; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet17=0, #t~short18=false, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620-L624] assume !#t~short18; [L620] havoc #t~short18; [L620] havoc #t~nondet17; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem21.base=9, #t~mem21.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] CALL call #t~ret22 := sll_length(#t~mem21.base, #t~mem21.offset); VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0] [L575-L582] ~head.base, ~head.offset := #in~head.base, #in~head.offset; [L576] ~len~0 := 0; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=9, ~head.offset=0, ~len~0=0] [L577-L580] assume !!(~head.base != 0 || ~head.offset != 0); [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L579] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L579] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=6, ~head.offset=0, ~len~0=1] [L577-L580] assume !!(~head.base != 0 || ~head.offset != 0); [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L579] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L579] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=2] [L577-L580] assume !(~head.base != 0 || ~head.offset != 0); VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=2] [L581] #res := ~len~0; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=2, ~head.base=0, ~head.offset=0, ~len~0=2] [L575-L582] ensures true; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=2, ~head.base=0, ~head.offset=0, ~len~0=2] [L625] RET call #t~ret22 := sll_length(#t~mem21.base, #t~mem21.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~mem21.base=9, #t~mem21.offset=0, #t~ret22=2, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~mem21.base=9, #t~mem21.offset=0, #t~ret22=2, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625-L627] assume ~k~0 + ~len~2 != #t~ret22; [L625] havoc #t~ret22; [L625] havoc #t~mem21.base, #t~mem21.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L630] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L616] CALL call #t~ret14 := _get_nondet_int(2, 5); VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, ~from=2, ~len~1=2, ~until=5] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #t~short12=true, ~from=2, ~len~1=2, ~until=5] [L610] COND TRUE #t~short12 [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #t~nondet11=0, #t~short12=false, ~from=2, ~len~1=2, ~until=5] [L610-L612] COND TRUE !#t~short12 [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, ~from=2, ~len~1=2, ~until=5] [L613] #res := ~len~1; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #res=2, ~from=2, ~len~1=2, ~until=5] [L616] RET call #t~ret14 := _get_nondet_int(2, 5); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=2] [L616] assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; [L616] ~len~2 := #t~ret14; [L616] havoc #t~ret14; [L617] FCALL call ~#s~0 := #Ultimate.alloc(4); VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L617] CALL call #t~ret15 := sll_create(~len~2); VAL [#in~len=2, #NULL!base=0, #NULL!offset=0] [L563-L574] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=2] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~post2=2, ~head~0!base=0, ~head~0!offset=0, ~len=1] [L565-L572] COND FALSE !(!(#t~post2 > 0)) [L565] havoc #t~post2; [L566] FCALL call #t~malloc3 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc3; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, #t~post2=1, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=6, ~new_head~0!offset=0] [L565-L572] COND FALSE !(!(#t~post2 > 0)) [L565] havoc #t~post2; [L566] FCALL call #t~malloc3 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc3; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, #t~post2=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L565-L572] COND TRUE !(#t~post2 > 0) [L565] havoc #t~post2; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L573] #res := ~head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #res!base=9, #res!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L617] RET call #t~ret15 := sll_create(~len~2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15!base=9, #t~ret15!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L617] FCALL call write~init~$Pointer$(#t~ret15, ~#s~0, 4); [L617] havoc #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L618] CALL call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=0, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610] COND TRUE #t~short12 [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~nondet11=1, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610-L612] COND FALSE !(!#t~short12) [L610] havoc #t~short12; [L610] havoc #t~nondet11; [L611] #t~post13 := ~len~1; [L611] ~len~1 := 1 + #t~post13; [L611] havoc #t~post13; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=1, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610] COND FALSE !(#t~short12) VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610-L612] COND TRUE !#t~short12 [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=1, ~until=1] [L613] #res := ~len~1; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #res=1, ~from=0, ~len~1=1, ~until=1] [L618] RET call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=1, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L618] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L618] ~k~0 := #t~ret16; [L618] havoc #t~ret16; [L619] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] #t~short18 := ~i~0 < ~k~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short18=true, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] COND TRUE #t~short18 [L620] assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; [L620] #t~short18 := 0 != #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet17=0, #t~short18=false, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620-L624] COND TRUE !#t~short18 [L620] havoc #t~short18; [L620] havoc #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] FCALL call #t~mem21 := read~$Pointer$(~#s~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] CALL call #t~ret22 := sll_length(#t~mem21); VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L575-L582] ~head := #in~head; [L576] ~len~0 := 0; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=9, ~head!offset=0, ~len~0=0] [L577-L580] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L579] ~head := #t~mem5; [L579] havoc #t~mem5; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=6, ~head!offset=0, ~len~0=1] [L577-L580] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L579] ~head := #t~mem5; [L579] havoc #t~mem5; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=2] [L577-L580] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=2] [L581] #res := ~len~0; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=2, ~head!base=0, ~head!offset=0, ~len~0=2] [L625] RET call #t~ret22 := sll_length(#t~mem21); VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, #t~ret22=2, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, #t~ret22=2, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] COND TRUE ~k~0 + ~len~2 != #t~ret22 [L625] havoc #t~ret22; [L625] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L630] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L616] CALL call #t~ret14 := _get_nondet_int(2, 5); VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, ~from=2, ~len~1=2, ~until=5] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #t~short12=true, ~from=2, ~len~1=2, ~until=5] [L610] COND TRUE #t~short12 [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #t~nondet11=0, #t~short12=false, ~from=2, ~len~1=2, ~until=5] [L610-L612] COND TRUE !#t~short12 [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, ~from=2, ~len~1=2, ~until=5] [L613] #res := ~len~1; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #res=2, ~from=2, ~len~1=2, ~until=5] [L616] RET call #t~ret14 := _get_nondet_int(2, 5); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=2] [L616] assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; [L616] ~len~2 := #t~ret14; [L616] havoc #t~ret14; [L617] FCALL call ~#s~0 := #Ultimate.alloc(4); VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L617] CALL call #t~ret15 := sll_create(~len~2); VAL [#in~len=2, #NULL!base=0, #NULL!offset=0] [L563-L574] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=2] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~post2=2, ~head~0!base=0, ~head~0!offset=0, ~len=1] [L565-L572] COND FALSE !(!(#t~post2 > 0)) [L565] havoc #t~post2; [L566] FCALL call #t~malloc3 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc3; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, #t~post2=1, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=6, ~new_head~0!offset=0] [L565-L572] COND FALSE !(!(#t~post2 > 0)) [L565] havoc #t~post2; [L566] FCALL call #t~malloc3 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc3; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, #t~post2=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L565-L572] COND TRUE !(#t~post2 > 0) [L565] havoc #t~post2; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L573] #res := ~head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #res!base=9, #res!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L617] RET call #t~ret15 := sll_create(~len~2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15!base=9, #t~ret15!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L617] FCALL call write~init~$Pointer$(#t~ret15, ~#s~0, 4); [L617] havoc #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L618] CALL call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=0, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610] COND TRUE #t~short12 [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~nondet11=1, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610-L612] COND FALSE !(!#t~short12) [L610] havoc #t~short12; [L610] havoc #t~nondet11; [L611] #t~post13 := ~len~1; [L611] ~len~1 := 1 + #t~post13; [L611] havoc #t~post13; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=1, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610] COND FALSE !(#t~short12) VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610-L612] COND TRUE !#t~short12 [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=1, ~until=1] [L613] #res := ~len~1; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #res=1, ~from=0, ~len~1=1, ~until=1] [L618] RET call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=1, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L618] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L618] ~k~0 := #t~ret16; [L618] havoc #t~ret16; [L619] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] #t~short18 := ~i~0 < ~k~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short18=true, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] COND TRUE #t~short18 [L620] assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; [L620] #t~short18 := 0 != #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet17=0, #t~short18=false, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620-L624] COND TRUE !#t~short18 [L620] havoc #t~short18; [L620] havoc #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] FCALL call #t~mem21 := read~$Pointer$(~#s~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] CALL call #t~ret22 := sll_length(#t~mem21); VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L575-L582] ~head := #in~head; [L576] ~len~0 := 0; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=9, ~head!offset=0, ~len~0=0] [L577-L580] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L579] ~head := #t~mem5; [L579] havoc #t~mem5; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=6, ~head!offset=0, ~len~0=1] [L577-L580] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L579] ~head := #t~mem5; [L579] havoc #t~mem5; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=2] [L577-L580] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=2] [L581] #res := ~len~0; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=2, ~head!base=0, ~head!offset=0, ~len~0=2] [L625] RET call #t~ret22 := sll_length(#t~mem21); VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, #t~ret22=2, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, #t~ret22=2, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] COND TRUE ~k~0 + ~len~2 != #t~ret22 [L625] havoc #t~ret22; [L625] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L630] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L616] CALL call #t~ret14 := _get_nondet_int(2, 5); VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, ~from=2, ~len~1=2, ~until=5] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #t~short12=true, ~from=2, ~len~1=2, ~until=5] [L610] COND TRUE #t~short12 [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #t~nondet11=0, #t~short12=false, ~from=2, ~len~1=2, ~until=5] [L610-L612] COND TRUE !#t~short12 [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, ~from=2, ~len~1=2, ~until=5] [L613] #res := ~len~1; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #res=2, ~from=2, ~len~1=2, ~until=5] [L616] RET call #t~ret14 := _get_nondet_int(2, 5); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=2] [L616] assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; [L616] ~len~2 := #t~ret14; [L616] havoc #t~ret14; [L617] FCALL call ~#s~0 := #Ultimate.alloc(4); VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L617] CALL call #t~ret15 := sll_create(~len~2); VAL [#in~len=2, #NULL!base=0, #NULL!offset=0] [L563-L574] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=2] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~post2=2, ~head~0!base=0, ~head~0!offset=0, ~len=1] [L565-L572] COND FALSE !(!(#t~post2 > 0)) [L565] havoc #t~post2; [L566] FCALL call #t~malloc3 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc3; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, #t~post2=1, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=6, ~new_head~0!offset=0] [L565-L572] COND FALSE !(!(#t~post2 > 0)) [L565] havoc #t~post2; [L566] FCALL call #t~malloc3 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc3; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, #t~post2=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L565-L572] COND TRUE !(#t~post2 > 0) [L565] havoc #t~post2; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L573] #res := ~head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #res!base=9, #res!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L617] RET call #t~ret15 := sll_create(~len~2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15!base=9, #t~ret15!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L617] FCALL call write~init~$Pointer$(#t~ret15, ~#s~0, 4); [L617] havoc #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L618] CALL call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=0, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610] COND TRUE #t~short12 [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~nondet11=1, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610-L612] COND FALSE !(!#t~short12) [L610] havoc #t~short12; [L610] havoc #t~nondet11; [L611] #t~post13 := ~len~1; [L611] ~len~1 := 1 + #t~post13; [L611] havoc #t~post13; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=1, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610] COND FALSE !(#t~short12) VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610-L612] COND TRUE !#t~short12 [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=1, ~until=1] [L613] #res := ~len~1; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #res=1, ~from=0, ~len~1=1, ~until=1] [L618] RET call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=1, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L618] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L618] ~k~0 := #t~ret16; [L618] havoc #t~ret16; [L619] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] #t~short18 := ~i~0 < ~k~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short18=true, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] COND TRUE #t~short18 [L620] assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; [L620] #t~short18 := 0 != #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet17=0, #t~short18=false, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620-L624] COND TRUE !#t~short18 [L620] havoc #t~short18; [L620] havoc #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] FCALL call #t~mem21 := read~$Pointer$(~#s~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] CALL call #t~ret22 := sll_length(#t~mem21); VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L575-L582] ~head := #in~head; [L576] ~len~0 := 0; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=9, ~head!offset=0, ~len~0=0] [L577-L580] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L579] ~head := #t~mem5; [L579] havoc #t~mem5; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=6, ~head!offset=0, ~len~0=1] [L577-L580] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L579] ~head := #t~mem5; [L579] havoc #t~mem5; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=2] [L577-L580] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=2] [L581] #res := ~len~0; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=2, ~head!base=0, ~head!offset=0, ~len~0=2] [L625] RET call #t~ret22 := sll_length(#t~mem21); VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, #t~ret22=2, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, #t~ret22=2, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] COND TRUE ~k~0 + ~len~2 != #t~ret22 [L625] havoc #t~ret22; [L625] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L630] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L616] CALL call #t~ret14 := _get_nondet_int(2, 5); VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, ~from=2, ~len~1=2, ~until=5] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #t~short12=true, ~from=2, ~len~1=2, ~until=5] [L610] COND TRUE #t~short12 [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #t~nondet11=0, #t~short12=false, ~from=2, ~len~1=2, ~until=5] [L610-L612] COND TRUE !#t~short12 [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, ~from=2, ~len~1=2, ~until=5] [L613] #res := ~len~1; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #res=2, ~from=2, ~len~1=2, ~until=5] [L616] RET call #t~ret14 := _get_nondet_int(2, 5); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=2] [L616] assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; [L616] ~len~2 := #t~ret14; [L616] havoc #t~ret14; [L617] FCALL call ~#s~0 := #Ultimate.alloc(4); VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L617] CALL call #t~ret15 := sll_create(~len~2); VAL [#in~len=2, #NULL!base=0, #NULL!offset=0] [L563-L574] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=2] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~post2=2, ~head~0!base=0, ~head~0!offset=0, ~len=1] [L565-L572] COND FALSE !(!(#t~post2 > 0)) [L565] havoc #t~post2; [L566] FCALL call #t~malloc3 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc3; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, #t~post2=1, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=6, ~new_head~0!offset=0] [L565-L572] COND FALSE !(!(#t~post2 > 0)) [L565] havoc #t~post2; [L566] FCALL call #t~malloc3 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc3; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, #t~post2=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L565-L572] COND TRUE !(#t~post2 > 0) [L565] havoc #t~post2; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L573] #res := ~head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #res!base=9, #res!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L617] RET call #t~ret15 := sll_create(~len~2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15!base=9, #t~ret15!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L617] FCALL call write~init~$Pointer$(#t~ret15, ~#s~0, 4); [L617] havoc #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L618] CALL call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=0, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610] COND TRUE #t~short12 [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~nondet11=1, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610-L612] COND FALSE !(!#t~short12) [L610] havoc #t~short12; [L610] havoc #t~nondet11; [L611] #t~post13 := ~len~1; [L611] ~len~1 := 1 + #t~post13; [L611] havoc #t~post13; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=1, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610] COND FALSE !(#t~short12) VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610-L612] COND TRUE !#t~short12 [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=1, ~until=1] [L613] #res := ~len~1; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #res=1, ~from=0, ~len~1=1, ~until=1] [L618] RET call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=1, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L618] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L618] ~k~0 := #t~ret16; [L618] havoc #t~ret16; [L619] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] #t~short18 := ~i~0 < ~k~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short18=true, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] COND TRUE #t~short18 [L620] assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; [L620] #t~short18 := 0 != #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet17=0, #t~short18=false, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620-L624] COND TRUE !#t~short18 [L620] havoc #t~short18; [L620] havoc #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] FCALL call #t~mem21 := read~$Pointer$(~#s~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] CALL call #t~ret22 := sll_length(#t~mem21); VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L575-L582] ~head := #in~head; [L576] ~len~0 := 0; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=9, ~head!offset=0, ~len~0=0] [L577-L580] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L579] ~head := #t~mem5; [L579] havoc #t~mem5; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=6, ~head!offset=0, ~len~0=1] [L577-L580] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L579] ~head := #t~mem5; [L579] havoc #t~mem5; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=2] [L577-L580] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=2] [L581] #res := ~len~0; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=2, ~head!base=0, ~head!offset=0, ~len~0=2] [L625] RET call #t~ret22 := sll_length(#t~mem21); VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, #t~ret22=2, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, #t~ret22=2, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] COND TRUE ~k~0 + ~len~2 != #t~ret22 [L625] havoc #t~ret22; [L625] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L630] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L616] CALL, EXPR _get_nondet_int(2, 5) VAL [\old(from)=2, \old(until)=5] [L609] int len = from; VAL [\old(from)=2, \old(until)=5, from=2, len=2, until=5] [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() VAL [\old(from)=2, \old(until)=5, __VERIFIER_nondet_int()=0, from=2, len=2, len < until && __VERIFIER_nondet_int()=0, until=5] [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; VAL [\old(from)=2, \old(until)=5, \result=2, from=2, len=2, until=5] [L616] RET, EXPR _get_nondet_int(2, 5) VAL [_get_nondet_int(2, 5)=2] [L616] const int len = _get_nondet_int(2, 5); [L617] SLL s = sll_create(len); VAL [len=2, s={7:0}] [L617] CALL, EXPR sll_create(len) VAL [\old(len)=2] [L564] SLL head = ((void *)0); VAL [\old(len)=2, head={0:0}, len=2] [L565] EXPR len-- VAL [\old(len)=2, head={0:0}, len=1, len--=2] [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=2, head={0:0}, len=1, malloc(sizeof(struct node))={6:0}, new_head={6:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=2, head={0:0}, len=1, malloc(sizeof(struct node))={6:0}, new_head={6:0}] [L570] new_head->next = head [L571] head = new_head VAL [\old(len)=2, head={6:0}, len=1, malloc(sizeof(struct node))={6:0}, new_head={6:0}] [L565] EXPR len-- VAL [\old(len)=2, head={6:0}, len=0, len--=1, malloc(sizeof(struct node))={6:0}, new_head={6:0}] [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=2, head={6:0}, len=0, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=2, head={6:0}, len=0, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L570] new_head->next = head [L571] head = new_head VAL [\old(len)=2, head={9:0}, len=0, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L565] EXPR len-- VAL [\old(len)=2, head={9:0}, len=-1, len--=0, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L565] COND FALSE !(len-- > 0) [L573] return head; VAL [\old(len)=2, \result={9:0}, head={9:0}, len=-1, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L617] RET, EXPR sll_create(len) VAL [len=2, s={7:0}, sll_create(len)={9:0}] [L617] SLL s = sll_create(len); [L618] CALL, EXPR _get_nondet_int(0, len - 1) VAL [\old(from)=0, \old(until)=1] [L609] int len = from; VAL [\old(from)=0, \old(until)=1, from=0, len=0, until=1] [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, __VERIFIER_nondet_int()=1, from=0, len=0, len < until && __VERIFIER_nondet_int()=1, until=1] [L610] COND TRUE len < until && __VERIFIER_nondet_int() [L611] len++ VAL [\old(from)=0, \old(until)=1, from=0, len=1, until=1] [L610] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, from=0, len=1, len < until && __VERIFIER_nondet_int()=0, until=1] [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; VAL [\old(from)=0, \old(until)=1, \result=1, from=0, len=1, until=1] [L618] RET, EXPR _get_nondet_int(0, len - 1) VAL [_get_nondet_int(0, len - 1)=1, len=2, s={7:0}] [L618] const int k = _get_nondet_int(0, len - 1); [L619] int i = 0; VAL [i=0, k=1, len=2, s={7:0}] [L620] i < k && __VERIFIER_nondet_int() [L620] i < k && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=0, i < k && __VERIFIER_nondet_int()=0, k=1, len=2, s={7:0}] [L620] COND FALSE !(i < k && __VERIFIER_nondet_int()) [L625] EXPR \read(s) VAL [\read(s)={9:0}, i=0, k=1, len=2, s={7:0}] [L625] CALL, EXPR sll_length(s) VAL [head={9:0}] [L576] int len = 0; VAL [head={9:0}, head={9:0}, len=0] [L577] COND TRUE \read(head) [L578] len++ [L579] EXPR head->next [L579] head = head->next [L577] COND TRUE \read(head) [L578] len++ [L579] EXPR head->next [L579] head = head->next [L577] COND FALSE !(\read(head)) VAL [head={9:0}, head={0:0}, len=2] [L581] return len; VAL [\result=2, head={0:0}, head={9:0}, len=2] [L625] RET, EXPR sll_length(s) VAL [\read(s)={9:0}, i=0, k=1, len=2, s={7:0}, sll_length(s)=2] [L625] COND TRUE k + len != sll_length(s) [L630] __VERIFIER_error() VAL [i=0, k=1, len=2, s={7:0}] ----- [2018-11-23 01:32:10,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:32:10 BoogieIcfgContainer [2018-11-23 01:32:10,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 01:32:10,464 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:32:10,464 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:32:10,466 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:32:10,467 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:31:08" (3/4) ... [2018-11-23 01:32:10,469 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=8, |#NULL.offset|=5, |old(#NULL.base)|=8, |old(#NULL.offset)|=5] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=8, |old(#NULL.offset)|=5] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=8, |old(#NULL.offset)|=5] [?] RET #176#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret24 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret14 := _get_nondet_int(2, 5); VAL [|#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=2, |_get_nondet_int_#in~until|=5] [?] ~from := #in~from;~until := #in~until;~len~1 := ~from; VAL [_get_nondet_int_~from=2, _get_nondet_int_~len~1=2, _get_nondet_int_~until=5, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=2, |_get_nondet_int_#in~until|=5] [?] #t~short12 := ~len~1 < ~until; VAL [_get_nondet_int_~from=2, _get_nondet_int_~len~1=2, _get_nondet_int_~until=5, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=2, |_get_nondet_int_#in~until|=5, |_get_nondet_int_#t~short12|=true] [?] assume #t~short12;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;#t~short12 := 0 != #t~nondet11; VAL [_get_nondet_int_~from=2, _get_nondet_int_~len~1=2, _get_nondet_int_~until=5, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=2, |_get_nondet_int_#in~until|=5, |_get_nondet_int_#t~nondet11|=0, |_get_nondet_int_#t~short12|=false] [?] assume !#t~short12;havoc #t~short12;havoc #t~nondet11; VAL [_get_nondet_int_~from=2, _get_nondet_int_~len~1=2, _get_nondet_int_~until=5, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=2, |_get_nondet_int_#in~until|=5] [?] #res := ~len~1; VAL [_get_nondet_int_~from=2, _get_nondet_int_~len~1=2, _get_nondet_int_~until=5, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=2, |_get_nondet_int_#in~until|=5, |_get_nondet_int_#res|=2] [?] assume true; VAL [_get_nondet_int_~from=2, _get_nondet_int_~len~1=2, _get_nondet_int_~until=5, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=2, |_get_nondet_int_#in~until|=5, |_get_nondet_int_#res|=2] [?] RET #158#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret14|=2] [?] assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~len~2 := #t~ret14;havoc #t~ret14;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); VAL [main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] CALL call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); VAL [|#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2] [?] ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=2, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2] [?] #t~post2 := ~len;~len := #t~post2 - 1; VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=1, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~post2|=2] [?] assume !!(#t~post2 > 0);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=1, sll_create_~new_head~0.base=6, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~malloc3.base|=6, |sll_create_#t~malloc3.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=1, sll_create_~new_head~0.base=6, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~malloc3.base|=6, |sll_create_#t~malloc3.offset|=0] [?] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; VAL [sll_create_~head~0.base=6, sll_create_~head~0.offset=0, sll_create_~len=1, sll_create_~new_head~0.base=6, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~malloc3.base|=6, |sll_create_#t~malloc3.offset|=0] [?] #t~post2 := ~len;~len := #t~post2 - 1; VAL [sll_create_~head~0.base=6, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=6, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~malloc3.base|=6, |sll_create_#t~malloc3.offset|=0, |sll_create_#t~post2|=1] [?] assume !!(#t~post2 > 0);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [sll_create_~head~0.base=6, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=9, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~malloc3.base|=9, |sll_create_#t~malloc3.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [sll_create_~head~0.base=6, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=9, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~malloc3.base|=9, |sll_create_#t~malloc3.offset|=0] [?] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; VAL [sll_create_~head~0.base=9, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=9, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~malloc3.base|=9, |sll_create_#t~malloc3.offset|=0] [?] #t~post2 := ~len;~len := #t~post2 - 1; VAL [sll_create_~head~0.base=9, sll_create_~head~0.offset=0, sll_create_~len=(- 1), sll_create_~new_head~0.base=9, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~malloc3.base|=9, |sll_create_#t~malloc3.offset|=0, |sll_create_#t~post2|=0] [?] assume !(#t~post2 > 0);havoc #t~post2; VAL [sll_create_~head~0.base=9, sll_create_~head~0.offset=0, sll_create_~len=(- 1), sll_create_~new_head~0.base=9, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#t~malloc3.base|=9, |sll_create_#t~malloc3.offset|=0] [?] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [sll_create_~head~0.base=9, sll_create_~head~0.offset=0, sll_create_~len=(- 1), sll_create_~new_head~0.base=9, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#res.base|=9, |sll_create_#res.offset|=0, |sll_create_#t~malloc3.base|=9, |sll_create_#t~malloc3.offset|=0] [?] assume true; VAL [sll_create_~head~0.base=9, sll_create_~head~0.offset=0, sll_create_~len=(- 1), sll_create_~new_head~0.base=9, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=2, |sll_create_#res.base|=9, |sll_create_#res.offset|=0, |sll_create_#t~malloc3.base|=9, |sll_create_#t~malloc3.offset|=0] [?] RET #160#return; VAL [main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret15.base|=9, |main_#t~ret15.offset|=0, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] call write~init~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret15.base, #t~ret15.offset; VAL [main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] CALL call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1] [?] ~from := #in~from;~until := #in~until;~len~1 := ~from; VAL [_get_nondet_int_~from=0, _get_nondet_int_~len~1=0, _get_nondet_int_~until=1, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1] [?] #t~short12 := ~len~1 < ~until; VAL [_get_nondet_int_~from=0, _get_nondet_int_~len~1=0, _get_nondet_int_~until=1, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1, |_get_nondet_int_#t~short12|=true] [?] assume #t~short12;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;#t~short12 := 0 != #t~nondet11; VAL [_get_nondet_int_~from=0, _get_nondet_int_~len~1=0, _get_nondet_int_~until=1, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1, |_get_nondet_int_#t~nondet11|=1, |_get_nondet_int_#t~short12|=true] [?] assume !!#t~short12;havoc #t~short12;havoc #t~nondet11;#t~post13 := ~len~1;~len~1 := 1 + #t~post13;havoc #t~post13; VAL [_get_nondet_int_~from=0, _get_nondet_int_~len~1=1, _get_nondet_int_~until=1, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1] [?] #t~short12 := ~len~1 < ~until; VAL [_get_nondet_int_~from=0, _get_nondet_int_~len~1=1, _get_nondet_int_~until=1, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1, |_get_nondet_int_#t~short12|=false] [?] assume !#t~short12; VAL [_get_nondet_int_~from=0, _get_nondet_int_~len~1=1, _get_nondet_int_~until=1, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1, |_get_nondet_int_#t~short12|=false] [?] assume !#t~short12;havoc #t~short12;havoc #t~nondet11; VAL [_get_nondet_int_~from=0, _get_nondet_int_~len~1=1, _get_nondet_int_~until=1, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1] [?] #res := ~len~1; VAL [_get_nondet_int_~from=0, _get_nondet_int_~len~1=1, _get_nondet_int_~until=1, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1, |_get_nondet_int_#res|=1] [?] assume true; VAL [_get_nondet_int_~from=0, _get_nondet_int_~len~1=1, _get_nondet_int_~until=1, |#NULL.base|=0, |#NULL.offset|=0, |_get_nondet_int_#in~from|=0, |_get_nondet_int_#in~until|=1, |_get_nondet_int_#res|=1] [?] RET #162#return; VAL [main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret16|=1, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~k~0 := #t~ret16;havoc #t~ret16;~i~0 := 0; VAL [main_~i~0=0, main_~k~0=1, main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] #t~short18 := ~i~0 < ~k~0; VAL [main_~i~0=0, main_~k~0=1, main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short18|=true, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; VAL [main_~i~0=0, main_~k~0=1, main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~nondet17|=0, |main_#t~short18|=false, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] assume !#t~short18;havoc #t~short18;havoc #t~nondet17; VAL [main_~i~0=0, main_~k~0=1, main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); VAL [main_~i~0=0, main_~k~0=1, main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem21.base|=9, |main_#t~mem21.offset|=0, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] CALL call #t~ret22 := sll_length(#t~mem21.base, #t~mem21.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=9, |sll_length_#in~head.offset|=0] [?] ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; VAL [sll_length_~head.base=9, sll_length_~head.offset=0, sll_length_~len~0=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=9, |sll_length_#in~head.offset|=0] [?] assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; VAL [sll_length_~head.base=6, sll_length_~head.offset=0, sll_length_~len~0=1, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=9, |sll_length_#in~head.offset|=0] [?] assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=2, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=9, |sll_length_#in~head.offset|=0] [?] assume !(~head.base != 0 || ~head.offset != 0); VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=2, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=9, |sll_length_#in~head.offset|=0] [?] #res := ~len~0; VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=2, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=9, |sll_length_#in~head.offset|=0, |sll_length_#res|=2] [?] assume true; VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=2, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=9, |sll_length_#in~head.offset|=0, |sll_length_#res|=2] [?] RET #168#return; VAL [main_~i~0=0, main_~k~0=1, main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem21.base|=9, |main_#t~mem21.offset|=0, |main_#t~ret22|=2, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647; VAL [main_~i~0=0, main_~k~0=1, main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem21.base|=9, |main_#t~mem21.offset|=0, |main_#t~ret22|=2, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] assume ~k~0 + ~len~2 != #t~ret22;havoc #t~ret22;havoc #t~mem21.base, #t~mem21.offset; VAL [main_~i~0=0, main_~k~0=1, main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] assume !false; VAL [main_~i~0=0, main_~k~0=1, main_~len~2=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#s~0.base|=7, |main_~#s~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=8, #NULL.offset=5, old(#NULL.base)=8, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L616] CALL call #t~ret14 := _get_nondet_int(2, 5); VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, ~from=2, ~len~1=2, ~until=5] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, #t~short12=true, ~from=2, ~len~1=2, ~until=5] [L610] assume #t~short12; [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, #t~nondet11=0, #t~short12=false, ~from=2, ~len~1=2, ~until=5] [L610-L612] assume !#t~short12; [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, ~from=2, ~len~1=2, ~until=5] [L613] #res := ~len~1; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, #res=2, ~from=2, ~len~1=2, ~until=5] [L608-L614] ensures true; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, #res=2, ~from=2, ~len~1=2, ~until=5] [L616] RET call #t~ret14 := _get_nondet_int(2, 5); VAL [#NULL.base=0, #NULL.offset=0, #t~ret14=2] [L616] assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; [L616] ~len~2 := #t~ret14; [L616] havoc #t~ret14; [L617] call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~len~2=2] [L617] CALL call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); VAL [#in~len=2, #NULL.base=0, #NULL.offset=0] [L563-L574] ~len := #in~len; [L564] ~head~0.base, ~head~0.offset := 0, 0; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=2] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~post2=2, ~head~0.base=0, ~head~0.offset=0, ~len=1] [L565-L572] assume !!(#t~post2 > 0); [L565] havoc #t~post2; [L566] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=6, #t~malloc3.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=1, ~new_head~0.base=6, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=6, #t~malloc3.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=1, ~new_head~0.base=6, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=6, #t~malloc3.offset=0, ~head~0.base=6, ~head~0.offset=0, ~len=1, ~new_head~0.base=6, ~new_head~0.offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=6, #t~malloc3.offset=0, #t~post2=1, ~head~0.base=6, ~head~0.offset=0, ~len=0, ~new_head~0.base=6, ~new_head~0.offset=0] [L565-L572] assume !!(#t~post2 > 0); [L565] havoc #t~post2; [L566] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=6, ~head~0.offset=0, ~len=0, ~new_head~0.base=9, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=6, ~head~0.offset=0, ~len=0, ~new_head~0.base=9, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=9, ~head~0.offset=0, ~len=0, ~new_head~0.base=9, ~new_head~0.offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, #t~post2=0, ~head~0.base=9, ~head~0.offset=0, ~len=-1, ~new_head~0.base=9, ~new_head~0.offset=0] [L565-L572] assume !(#t~post2 > 0); [L565] havoc #t~post2; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=9, ~head~0.offset=0, ~len=-1, ~new_head~0.base=9, ~new_head~0.offset=0] [L573] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #res.base=9, #res.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=9, ~head~0.offset=0, ~len=-1, ~new_head~0.base=9, ~new_head~0.offset=0] [L563-L574] ensures true; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #res.base=9, #res.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=9, ~head~0.offset=0, ~len=-1, ~new_head~0.base=9, ~new_head~0.offset=0] [L617] RET call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); VAL [#NULL.base=0, #NULL.offset=0, #t~ret15.base=9, #t~ret15.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~len~2=2] [L617] call write~init~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4); [L617] havoc #t~ret15.base, #t~ret15.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~len~2=2] [L618] CALL call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, ~from=0, ~len~1=0, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610] assume #t~short12; [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #t~nondet11=1, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610-L612] assume !!#t~short12; [L610] havoc #t~short12; [L610] havoc #t~nondet11; [L611] #t~post13 := ~len~1; [L611] ~len~1 := 1 + #t~post13; [L611] havoc #t~post13; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, ~from=0, ~len~1=1, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610] assume !#t~short12; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610-L612] assume !#t~short12; [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, ~from=0, ~len~1=1, ~until=1] [L613] #res := ~len~1; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #res=1, ~from=0, ~len~1=1, ~until=1] [L608-L614] ensures true; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #res=1, ~from=0, ~len~1=1, ~until=1] [L618] RET call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#NULL.base=0, #NULL.offset=0, #t~ret16=1, ~#s~0.base=7, ~#s~0.offset=0, ~len~2=2] [L618] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L618] ~k~0 := #t~ret16; [L618] havoc #t~ret16; [L619] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] #t~short18 := ~i~0 < ~k~0; VAL [#NULL.base=0, #NULL.offset=0, #t~short18=true, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] assume #t~short18; [L620] assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; [L620] #t~short18 := 0 != #t~nondet17; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet17=0, #t~short18=false, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620-L624] assume !#t~short18; [L620] havoc #t~short18; [L620] havoc #t~nondet17; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem21.base=9, #t~mem21.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] CALL call #t~ret22 := sll_length(#t~mem21.base, #t~mem21.offset); VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0] [L575-L582] ~head.base, ~head.offset := #in~head.base, #in~head.offset; [L576] ~len~0 := 0; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=9, ~head.offset=0, ~len~0=0] [L577-L580] assume !!(~head.base != 0 || ~head.offset != 0); [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L579] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L579] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=6, ~head.offset=0, ~len~0=1] [L577-L580] assume !!(~head.base != 0 || ~head.offset != 0); [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L579] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L579] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=2] [L577-L580] assume !(~head.base != 0 || ~head.offset != 0); VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=2] [L581] #res := ~len~0; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=2, ~head.base=0, ~head.offset=0, ~len~0=2] [L575-L582] ensures true; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=2, ~head.base=0, ~head.offset=0, ~len~0=2] [L625] RET call #t~ret22 := sll_length(#t~mem21.base, #t~mem21.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~mem21.base=9, #t~mem21.offset=0, #t~ret22=2, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~mem21.base=9, #t~mem21.offset=0, #t~ret22=2, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625-L627] assume ~k~0 + ~len~2 != #t~ret22; [L625] havoc #t~ret22; [L625] havoc #t~mem21.base, #t~mem21.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L630] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=8, #NULL.offset=5, old(#NULL.base)=8, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L616] CALL call #t~ret14 := _get_nondet_int(2, 5); VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, ~from=2, ~len~1=2, ~until=5] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, #t~short12=true, ~from=2, ~len~1=2, ~until=5] [L610] assume #t~short12; [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, #t~nondet11=0, #t~short12=false, ~from=2, ~len~1=2, ~until=5] [L610-L612] assume !#t~short12; [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, ~from=2, ~len~1=2, ~until=5] [L613] #res := ~len~1; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, #res=2, ~from=2, ~len~1=2, ~until=5] [L608-L614] ensures true; VAL [#in~from=2, #in~until=5, #NULL.base=0, #NULL.offset=0, #res=2, ~from=2, ~len~1=2, ~until=5] [L616] RET call #t~ret14 := _get_nondet_int(2, 5); VAL [#NULL.base=0, #NULL.offset=0, #t~ret14=2] [L616] assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; [L616] ~len~2 := #t~ret14; [L616] havoc #t~ret14; [L617] call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~len~2=2] [L617] CALL call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); VAL [#in~len=2, #NULL.base=0, #NULL.offset=0] [L563-L574] ~len := #in~len; [L564] ~head~0.base, ~head~0.offset := 0, 0; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=2] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~post2=2, ~head~0.base=0, ~head~0.offset=0, ~len=1] [L565-L572] assume !!(#t~post2 > 0); [L565] havoc #t~post2; [L566] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=6, #t~malloc3.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=1, ~new_head~0.base=6, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=6, #t~malloc3.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=1, ~new_head~0.base=6, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=6, #t~malloc3.offset=0, ~head~0.base=6, ~head~0.offset=0, ~len=1, ~new_head~0.base=6, ~new_head~0.offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=6, #t~malloc3.offset=0, #t~post2=1, ~head~0.base=6, ~head~0.offset=0, ~len=0, ~new_head~0.base=6, ~new_head~0.offset=0] [L565-L572] assume !!(#t~post2 > 0); [L565] havoc #t~post2; [L566] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=6, ~head~0.offset=0, ~len=0, ~new_head~0.base=9, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=6, ~head~0.offset=0, ~len=0, ~new_head~0.base=9, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=9, ~head~0.offset=0, ~len=0, ~new_head~0.base=9, ~new_head~0.offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, #t~post2=0, ~head~0.base=9, ~head~0.offset=0, ~len=-1, ~new_head~0.base=9, ~new_head~0.offset=0] [L565-L572] assume !(#t~post2 > 0); [L565] havoc #t~post2; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=9, ~head~0.offset=0, ~len=-1, ~new_head~0.base=9, ~new_head~0.offset=0] [L573] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #res.base=9, #res.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=9, ~head~0.offset=0, ~len=-1, ~new_head~0.base=9, ~new_head~0.offset=0] [L563-L574] ensures true; VAL [#in~len=2, #NULL.base=0, #NULL.offset=0, #res.base=9, #res.offset=0, #t~malloc3.base=9, #t~malloc3.offset=0, ~head~0.base=9, ~head~0.offset=0, ~len=-1, ~new_head~0.base=9, ~new_head~0.offset=0] [L617] RET call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); VAL [#NULL.base=0, #NULL.offset=0, #t~ret15.base=9, #t~ret15.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~len~2=2] [L617] call write~init~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4); [L617] havoc #t~ret15.base, #t~ret15.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~len~2=2] [L618] CALL call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, ~from=0, ~len~1=0, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610] assume #t~short12; [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #t~nondet11=1, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610-L612] assume !!#t~short12; [L610] havoc #t~short12; [L610] havoc #t~nondet11; [L611] #t~post13 := ~len~1; [L611] ~len~1 := 1 + #t~post13; [L611] havoc #t~post13; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, ~from=0, ~len~1=1, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610] assume !#t~short12; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610-L612] assume !#t~short12; [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, ~from=0, ~len~1=1, ~until=1] [L613] #res := ~len~1; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #res=1, ~from=0, ~len~1=1, ~until=1] [L608-L614] ensures true; VAL [#in~from=0, #in~until=1, #NULL.base=0, #NULL.offset=0, #res=1, ~from=0, ~len~1=1, ~until=1] [L618] RET call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#NULL.base=0, #NULL.offset=0, #t~ret16=1, ~#s~0.base=7, ~#s~0.offset=0, ~len~2=2] [L618] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L618] ~k~0 := #t~ret16; [L618] havoc #t~ret16; [L619] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] #t~short18 := ~i~0 < ~k~0; VAL [#NULL.base=0, #NULL.offset=0, #t~short18=true, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] assume #t~short18; [L620] assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; [L620] #t~short18 := 0 != #t~nondet17; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet17=0, #t~short18=false, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620-L624] assume !#t~short18; [L620] havoc #t~short18; [L620] havoc #t~nondet17; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem21.base=9, #t~mem21.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] CALL call #t~ret22 := sll_length(#t~mem21.base, #t~mem21.offset); VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0] [L575-L582] ~head.base, ~head.offset := #in~head.base, #in~head.offset; [L576] ~len~0 := 0; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=9, ~head.offset=0, ~len~0=0] [L577-L580] assume !!(~head.base != 0 || ~head.offset != 0); [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L579] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L579] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=6, ~head.offset=0, ~len~0=1] [L577-L580] assume !!(~head.base != 0 || ~head.offset != 0); [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L579] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L579] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=2] [L577-L580] assume !(~head.base != 0 || ~head.offset != 0); VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=2] [L581] #res := ~len~0; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=2, ~head.base=0, ~head.offset=0, ~len~0=2] [L575-L582] ensures true; VAL [#in~head.base=9, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=2, ~head.base=0, ~head.offset=0, ~len~0=2] [L625] RET call #t~ret22 := sll_length(#t~mem21.base, #t~mem21.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~mem21.base=9, #t~mem21.offset=0, #t~ret22=2, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~mem21.base=9, #t~mem21.offset=0, #t~ret22=2, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625-L627] assume ~k~0 + ~len~2 != #t~ret22; [L625] havoc #t~ret22; [L625] havoc #t~mem21.base, #t~mem21.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L630] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#s~0.base=7, ~#s~0.offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L616] CALL call #t~ret14 := _get_nondet_int(2, 5); VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, ~from=2, ~len~1=2, ~until=5] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #t~short12=true, ~from=2, ~len~1=2, ~until=5] [L610] COND TRUE #t~short12 [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #t~nondet11=0, #t~short12=false, ~from=2, ~len~1=2, ~until=5] [L610-L612] COND TRUE !#t~short12 [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, ~from=2, ~len~1=2, ~until=5] [L613] #res := ~len~1; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #res=2, ~from=2, ~len~1=2, ~until=5] [L616] RET call #t~ret14 := _get_nondet_int(2, 5); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=2] [L616] assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; [L616] ~len~2 := #t~ret14; [L616] havoc #t~ret14; [L617] FCALL call ~#s~0 := #Ultimate.alloc(4); VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L617] CALL call #t~ret15 := sll_create(~len~2); VAL [#in~len=2, #NULL!base=0, #NULL!offset=0] [L563-L574] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=2] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~post2=2, ~head~0!base=0, ~head~0!offset=0, ~len=1] [L565-L572] COND FALSE !(!(#t~post2 > 0)) [L565] havoc #t~post2; [L566] FCALL call #t~malloc3 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc3; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, #t~post2=1, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=6, ~new_head~0!offset=0] [L565-L572] COND FALSE !(!(#t~post2 > 0)) [L565] havoc #t~post2; [L566] FCALL call #t~malloc3 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc3; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, #t~post2=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L565-L572] COND TRUE !(#t~post2 > 0) [L565] havoc #t~post2; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L573] #res := ~head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #res!base=9, #res!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L617] RET call #t~ret15 := sll_create(~len~2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15!base=9, #t~ret15!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L617] FCALL call write~init~$Pointer$(#t~ret15, ~#s~0, 4); [L617] havoc #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L618] CALL call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=0, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610] COND TRUE #t~short12 [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~nondet11=1, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610-L612] COND FALSE !(!#t~short12) [L610] havoc #t~short12; [L610] havoc #t~nondet11; [L611] #t~post13 := ~len~1; [L611] ~len~1 := 1 + #t~post13; [L611] havoc #t~post13; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=1, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610] COND FALSE !(#t~short12) VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610-L612] COND TRUE !#t~short12 [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=1, ~until=1] [L613] #res := ~len~1; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #res=1, ~from=0, ~len~1=1, ~until=1] [L618] RET call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=1, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L618] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L618] ~k~0 := #t~ret16; [L618] havoc #t~ret16; [L619] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] #t~short18 := ~i~0 < ~k~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short18=true, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] COND TRUE #t~short18 [L620] assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; [L620] #t~short18 := 0 != #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet17=0, #t~short18=false, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620-L624] COND TRUE !#t~short18 [L620] havoc #t~short18; [L620] havoc #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] FCALL call #t~mem21 := read~$Pointer$(~#s~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] CALL call #t~ret22 := sll_length(#t~mem21); VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L575-L582] ~head := #in~head; [L576] ~len~0 := 0; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=9, ~head!offset=0, ~len~0=0] [L577-L580] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L579] ~head := #t~mem5; [L579] havoc #t~mem5; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=6, ~head!offset=0, ~len~0=1] [L577-L580] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L579] ~head := #t~mem5; [L579] havoc #t~mem5; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=2] [L577-L580] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=2] [L581] #res := ~len~0; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=2, ~head!base=0, ~head!offset=0, ~len~0=2] [L625] RET call #t~ret22 := sll_length(#t~mem21); VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, #t~ret22=2, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, #t~ret22=2, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] COND TRUE ~k~0 + ~len~2 != #t~ret22 [L625] havoc #t~ret22; [L625] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L630] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L616] CALL call #t~ret14 := _get_nondet_int(2, 5); VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, ~from=2, ~len~1=2, ~until=5] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #t~short12=true, ~from=2, ~len~1=2, ~until=5] [L610] COND TRUE #t~short12 [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #t~nondet11=0, #t~short12=false, ~from=2, ~len~1=2, ~until=5] [L610-L612] COND TRUE !#t~short12 [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, ~from=2, ~len~1=2, ~until=5] [L613] #res := ~len~1; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #res=2, ~from=2, ~len~1=2, ~until=5] [L616] RET call #t~ret14 := _get_nondet_int(2, 5); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=2] [L616] assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; [L616] ~len~2 := #t~ret14; [L616] havoc #t~ret14; [L617] FCALL call ~#s~0 := #Ultimate.alloc(4); VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L617] CALL call #t~ret15 := sll_create(~len~2); VAL [#in~len=2, #NULL!base=0, #NULL!offset=0] [L563-L574] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=2] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~post2=2, ~head~0!base=0, ~head~0!offset=0, ~len=1] [L565-L572] COND FALSE !(!(#t~post2 > 0)) [L565] havoc #t~post2; [L566] FCALL call #t~malloc3 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc3; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, #t~post2=1, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=6, ~new_head~0!offset=0] [L565-L572] COND FALSE !(!(#t~post2 > 0)) [L565] havoc #t~post2; [L566] FCALL call #t~malloc3 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc3; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, #t~post2=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L565-L572] COND TRUE !(#t~post2 > 0) [L565] havoc #t~post2; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L573] #res := ~head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #res!base=9, #res!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L617] RET call #t~ret15 := sll_create(~len~2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15!base=9, #t~ret15!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L617] FCALL call write~init~$Pointer$(#t~ret15, ~#s~0, 4); [L617] havoc #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L618] CALL call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=0, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610] COND TRUE #t~short12 [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~nondet11=1, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610-L612] COND FALSE !(!#t~short12) [L610] havoc #t~short12; [L610] havoc #t~nondet11; [L611] #t~post13 := ~len~1; [L611] ~len~1 := 1 + #t~post13; [L611] havoc #t~post13; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=1, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610] COND FALSE !(#t~short12) VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610-L612] COND TRUE !#t~short12 [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=1, ~until=1] [L613] #res := ~len~1; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #res=1, ~from=0, ~len~1=1, ~until=1] [L618] RET call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=1, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L618] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L618] ~k~0 := #t~ret16; [L618] havoc #t~ret16; [L619] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] #t~short18 := ~i~0 < ~k~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short18=true, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] COND TRUE #t~short18 [L620] assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; [L620] #t~short18 := 0 != #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet17=0, #t~short18=false, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620-L624] COND TRUE !#t~short18 [L620] havoc #t~short18; [L620] havoc #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] FCALL call #t~mem21 := read~$Pointer$(~#s~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] CALL call #t~ret22 := sll_length(#t~mem21); VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L575-L582] ~head := #in~head; [L576] ~len~0 := 0; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=9, ~head!offset=0, ~len~0=0] [L577-L580] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L579] ~head := #t~mem5; [L579] havoc #t~mem5; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=6, ~head!offset=0, ~len~0=1] [L577-L580] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L579] ~head := #t~mem5; [L579] havoc #t~mem5; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=2] [L577-L580] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=2] [L581] #res := ~len~0; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=2, ~head!base=0, ~head!offset=0, ~len~0=2] [L625] RET call #t~ret22 := sll_length(#t~mem21); VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, #t~ret22=2, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, #t~ret22=2, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] COND TRUE ~k~0 + ~len~2 != #t~ret22 [L625] havoc #t~ret22; [L625] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L630] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L616] CALL call #t~ret14 := _get_nondet_int(2, 5); VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, ~from=2, ~len~1=2, ~until=5] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #t~short12=true, ~from=2, ~len~1=2, ~until=5] [L610] COND TRUE #t~short12 [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #t~nondet11=0, #t~short12=false, ~from=2, ~len~1=2, ~until=5] [L610-L612] COND TRUE !#t~short12 [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, ~from=2, ~len~1=2, ~until=5] [L613] #res := ~len~1; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #res=2, ~from=2, ~len~1=2, ~until=5] [L616] RET call #t~ret14 := _get_nondet_int(2, 5); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=2] [L616] assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; [L616] ~len~2 := #t~ret14; [L616] havoc #t~ret14; [L617] FCALL call ~#s~0 := #Ultimate.alloc(4); VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L617] CALL call #t~ret15 := sll_create(~len~2); VAL [#in~len=2, #NULL!base=0, #NULL!offset=0] [L563-L574] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=2] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~post2=2, ~head~0!base=0, ~head~0!offset=0, ~len=1] [L565-L572] COND FALSE !(!(#t~post2 > 0)) [L565] havoc #t~post2; [L566] FCALL call #t~malloc3 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc3; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, #t~post2=1, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=6, ~new_head~0!offset=0] [L565-L572] COND FALSE !(!(#t~post2 > 0)) [L565] havoc #t~post2; [L566] FCALL call #t~malloc3 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc3; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, #t~post2=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L565-L572] COND TRUE !(#t~post2 > 0) [L565] havoc #t~post2; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L573] #res := ~head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #res!base=9, #res!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L617] RET call #t~ret15 := sll_create(~len~2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15!base=9, #t~ret15!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L617] FCALL call write~init~$Pointer$(#t~ret15, ~#s~0, 4); [L617] havoc #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L618] CALL call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=0, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610] COND TRUE #t~short12 [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~nondet11=1, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610-L612] COND FALSE !(!#t~short12) [L610] havoc #t~short12; [L610] havoc #t~nondet11; [L611] #t~post13 := ~len~1; [L611] ~len~1 := 1 + #t~post13; [L611] havoc #t~post13; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=1, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610] COND FALSE !(#t~short12) VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610-L612] COND TRUE !#t~short12 [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=1, ~until=1] [L613] #res := ~len~1; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #res=1, ~from=0, ~len~1=1, ~until=1] [L618] RET call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=1, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L618] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L618] ~k~0 := #t~ret16; [L618] havoc #t~ret16; [L619] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] #t~short18 := ~i~0 < ~k~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short18=true, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] COND TRUE #t~short18 [L620] assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; [L620] #t~short18 := 0 != #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet17=0, #t~short18=false, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620-L624] COND TRUE !#t~short18 [L620] havoc #t~short18; [L620] havoc #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] FCALL call #t~mem21 := read~$Pointer$(~#s~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] CALL call #t~ret22 := sll_length(#t~mem21); VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L575-L582] ~head := #in~head; [L576] ~len~0 := 0; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=9, ~head!offset=0, ~len~0=0] [L577-L580] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L579] ~head := #t~mem5; [L579] havoc #t~mem5; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=6, ~head!offset=0, ~len~0=1] [L577-L580] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L579] ~head := #t~mem5; [L579] havoc #t~mem5; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=2] [L577-L580] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=2] [L581] #res := ~len~0; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=2, ~head!base=0, ~head!offset=0, ~len~0=2] [L625] RET call #t~ret22 := sll_length(#t~mem21); VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, #t~ret22=2, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, #t~ret22=2, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] COND TRUE ~k~0 + ~len~2 != #t~ret22 [L625] havoc #t~ret22; [L625] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L630] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L616] CALL call #t~ret14 := _get_nondet_int(2, 5); VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, ~from=2, ~len~1=2, ~until=5] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #t~short12=true, ~from=2, ~len~1=2, ~until=5] [L610] COND TRUE #t~short12 [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #t~nondet11=0, #t~short12=false, ~from=2, ~len~1=2, ~until=5] [L610-L612] COND TRUE !#t~short12 [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, ~from=2, ~len~1=2, ~until=5] [L613] #res := ~len~1; VAL [#in~from=2, #in~until=5, #NULL!base=0, #NULL!offset=0, #res=2, ~from=2, ~len~1=2, ~until=5] [L616] RET call #t~ret14 := _get_nondet_int(2, 5); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=2] [L616] assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; [L616] ~len~2 := #t~ret14; [L616] havoc #t~ret14; [L617] FCALL call ~#s~0 := #Ultimate.alloc(4); VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L617] CALL call #t~ret15 := sll_create(~len~2); VAL [#in~len=2, #NULL!base=0, #NULL!offset=0] [L563-L574] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=2] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~post2=2, ~head~0!base=0, ~head~0!offset=0, ~len=1] [L565-L572] COND FALSE !(!(#t~post2 > 0)) [L565] havoc #t~post2; [L566] FCALL call #t~malloc3 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc3; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=1, ~new_head~0!base=6, ~new_head~0!offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=6, #t~malloc3!offset=0, #t~post2=1, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=6, ~new_head~0!offset=0] [L565-L572] COND FALSE !(!(#t~post2 > 0)) [L565] havoc #t~post2; [L566] FCALL call #t~malloc3 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc3; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=6, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=0, ~new_head~0!base=9, ~new_head~0!offset=0] [L565] #t~post2 := ~len; [L565] ~len := #t~post2 - 1; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, #t~post2=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L565-L572] COND TRUE !(#t~post2 > 0) [L565] havoc #t~post2; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L573] #res := ~head~0; VAL [#in~len=2, #NULL!base=0, #NULL!offset=0, #res!base=9, #res!offset=0, #t~malloc3!base=9, #t~malloc3!offset=0, ~head~0!base=9, ~head~0!offset=0, ~len=-1, ~new_head~0!base=9, ~new_head~0!offset=0] [L617] RET call #t~ret15 := sll_create(~len~2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15!base=9, #t~ret15!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L617] FCALL call write~init~$Pointer$(#t~ret15, ~#s~0, 4); [L617] havoc #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L618] CALL call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0] [L608-L614] ~from := #in~from; [L608-L614] ~until := #in~until; [L609] ~len~1 := ~from; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=0, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610] COND TRUE #t~short12 [L610] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L610] #t~short12 := 0 != #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~nondet11=1, #t~short12=true, ~from=0, ~len~1=0, ~until=1] [L610-L612] COND FALSE !(!#t~short12) [L610] havoc #t~short12; [L610] havoc #t~nondet11; [L611] #t~post13 := ~len~1; [L611] ~len~1 := 1 + #t~post13; [L611] havoc #t~post13; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=1, ~until=1] [L610] #t~short12 := ~len~1 < ~until; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610] COND FALSE !(#t~short12) VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #t~short12=false, ~from=0, ~len~1=1, ~until=1] [L610-L612] COND TRUE !#t~short12 [L610] havoc #t~short12; [L610] havoc #t~nondet11; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, ~from=0, ~len~1=1, ~until=1] [L613] #res := ~len~1; VAL [#in~from=0, #in~until=1, #NULL!base=0, #NULL!offset=0, #res=1, ~from=0, ~len~1=1, ~until=1] [L618] RET call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=1, ~#s~0!base=7, ~#s~0!offset=0, ~len~2=2] [L618] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L618] ~k~0 := #t~ret16; [L618] havoc #t~ret16; [L619] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] #t~short18 := ~i~0 < ~k~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short18=true, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620] COND TRUE #t~short18 [L620] assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; [L620] #t~short18 := 0 != #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet17=0, #t~short18=false, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L620-L624] COND TRUE !#t~short18 [L620] havoc #t~short18; [L620] havoc #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] FCALL call #t~mem21 := read~$Pointer$(~#s~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] CALL call #t~ret22 := sll_length(#t~mem21); VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L575-L582] ~head := #in~head; [L576] ~len~0 := 0; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=9, ~head!offset=0, ~len~0=0] [L577-L580] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L579] ~head := #t~mem5; [L579] havoc #t~mem5; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=6, ~head!offset=0, ~len~0=1] [L577-L580] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L578] #t~post4 := ~len~0; [L578] ~len~0 := 1 + #t~post4; [L578] havoc #t~post4; [L579] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L579] ~head := #t~mem5; [L579] havoc #t~mem5; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=2] [L577-L580] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=2] [L581] #res := ~len~0; VAL [#in~head!base=9, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=2, ~head!base=0, ~head!offset=0, ~len~0=2] [L625] RET call #t~ret22 := sll_length(#t~mem21); VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, #t~ret22=2, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~mem21!base=9, #t~mem21!offset=0, #t~ret22=2, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L625] COND TRUE ~k~0 + ~len~2 != #t~ret22 [L625] havoc #t~ret22; [L625] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L630] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#s~0!base=7, ~#s~0!offset=0, ~i~0=0, ~k~0=1, ~len~2=2] [L616] CALL, EXPR _get_nondet_int(2, 5) VAL [\old(from)=2, \old(until)=5] [L609] int len = from; VAL [\old(from)=2, \old(until)=5, from=2, len=2, until=5] [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() VAL [\old(from)=2, \old(until)=5, __VERIFIER_nondet_int()=0, from=2, len=2, len < until && __VERIFIER_nondet_int()=0, until=5] [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; VAL [\old(from)=2, \old(until)=5, \result=2, from=2, len=2, until=5] [L616] RET, EXPR _get_nondet_int(2, 5) VAL [_get_nondet_int(2, 5)=2] [L616] const int len = _get_nondet_int(2, 5); [L617] SLL s = sll_create(len); VAL [len=2, s={7:0}] [L617] CALL, EXPR sll_create(len) VAL [\old(len)=2] [L564] SLL head = ((void *)0); VAL [\old(len)=2, head={0:0}, len=2] [L565] EXPR len-- VAL [\old(len)=2, head={0:0}, len=1, len--=2] [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=2, head={0:0}, len=1, malloc(sizeof(struct node))={6:0}, new_head={6:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=2, head={0:0}, len=1, malloc(sizeof(struct node))={6:0}, new_head={6:0}] [L570] new_head->next = head [L571] head = new_head VAL [\old(len)=2, head={6:0}, len=1, malloc(sizeof(struct node))={6:0}, new_head={6:0}] [L565] EXPR len-- VAL [\old(len)=2, head={6:0}, len=0, len--=1, malloc(sizeof(struct node))={6:0}, new_head={6:0}] [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=2, head={6:0}, len=0, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=2, head={6:0}, len=0, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L570] new_head->next = head [L571] head = new_head VAL [\old(len)=2, head={9:0}, len=0, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L565] EXPR len-- VAL [\old(len)=2, head={9:0}, len=-1, len--=0, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L565] COND FALSE !(len-- > 0) [L573] return head; VAL [\old(len)=2, \result={9:0}, head={9:0}, len=-1, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L617] RET, EXPR sll_create(len) VAL [len=2, s={7:0}, sll_create(len)={9:0}] [L617] SLL s = sll_create(len); [L618] CALL, EXPR _get_nondet_int(0, len - 1) VAL [\old(from)=0, \old(until)=1] [L609] int len = from; VAL [\old(from)=0, \old(until)=1, from=0, len=0, until=1] [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, __VERIFIER_nondet_int()=1, from=0, len=0, len < until && __VERIFIER_nondet_int()=1, until=1] [L610] COND TRUE len < until && __VERIFIER_nondet_int() [L611] len++ VAL [\old(from)=0, \old(until)=1, from=0, len=1, until=1] [L610] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, from=0, len=1, len < until && __VERIFIER_nondet_int()=0, until=1] [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; VAL [\old(from)=0, \old(until)=1, \result=1, from=0, len=1, until=1] [L618] RET, EXPR _get_nondet_int(0, len - 1) VAL [_get_nondet_int(0, len - 1)=1, len=2, s={7:0}] [L618] const int k = _get_nondet_int(0, len - 1); [L619] int i = 0; VAL [i=0, k=1, len=2, s={7:0}] [L620] i < k && __VERIFIER_nondet_int() [L620] i < k && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=0, i < k && __VERIFIER_nondet_int()=0, k=1, len=2, s={7:0}] [L620] COND FALSE !(i < k && __VERIFIER_nondet_int()) [L625] EXPR \read(s) VAL [\read(s)={9:0}, i=0, k=1, len=2, s={7:0}] [L625] CALL, EXPR sll_length(s) VAL [head={9:0}] [L576] int len = 0; VAL [head={9:0}, head={9:0}, len=0] [L577] COND TRUE \read(head) [L578] len++ [L579] EXPR head->next [L579] head = head->next [L577] COND TRUE \read(head) [L578] len++ [L579] EXPR head->next [L579] head = head->next [L577] COND FALSE !(\read(head)) VAL [head={9:0}, head={0:0}, len=2] [L581] return len; VAL [\result=2, head={9:0}, head={0:0}, len=2] [L625] RET, EXPR sll_length(s) VAL [\read(s)={9:0}, i=0, k=1, len=2, s={7:0}, sll_length(s)=2] [L625] COND TRUE k + len != sll_length(s) [L630] __VERIFIER_error() VAL [i=0, k=1, len=2, s={7:0}] ----- [2018-11-23 01:32:11,437 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b3abe367-8628-4bcf-abdf-f143abbd63f3/bin-2019/utaipan/witness.graphml [2018-11-23 01:32:11,437 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:32:11,438 INFO L168 Benchmark]: Toolchain (without parser) took 63525.31 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 359.1 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -216.6 MB). Peak memory consumption was 142.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:32:11,439 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:32:11,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2018-11-23 01:32:11,439 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.88 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-23 01:32:11,439 INFO L168 Benchmark]: Boogie Preprocessor took 21.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:32:11,439 INFO L168 Benchmark]: RCFGBuilder took 307.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2018-11-23 01:32:11,440 INFO L168 Benchmark]: TraceAbstraction took 61841.52 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.8 MB). Peak memory consumption was 126.3 MB. Max. memory is 11.5 GB. [2018-11-23 01:32:11,440 INFO L168 Benchmark]: Witness Printer took 973.13 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:32:11,441 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 356.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 307.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 61841.52 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.8 MB). Peak memory consumption was 126.3 MB. Max. memory is 11.5 GB. * Witness Printer took 973.13 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 630]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L616] CALL, EXPR _get_nondet_int(2, 5) VAL [\old(from)=2, \old(until)=5] [L609] int len = from; VAL [\old(from)=2, \old(until)=5, from=2, len=2, until=5] [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() VAL [\old(from)=2, \old(until)=5, __VERIFIER_nondet_int()=0, from=2, len=2, len < until && __VERIFIER_nondet_int()=0, until=5] [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; VAL [\old(from)=2, \old(until)=5, \result=2, from=2, len=2, until=5] [L616] RET, EXPR _get_nondet_int(2, 5) VAL [_get_nondet_int(2, 5)=2] [L616] const int len = _get_nondet_int(2, 5); [L617] SLL s = sll_create(len); VAL [len=2, s={7:0}] [L617] CALL, EXPR sll_create(len) VAL [\old(len)=2] [L564] SLL head = ((void *)0); VAL [\old(len)=2, head={0:0}, len=2] [L565] EXPR len-- VAL [\old(len)=2, head={0:0}, len=1, len--=2] [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=2, head={0:0}, len=1, malloc(sizeof(struct node))={6:0}, new_head={6:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=2, head={0:0}, len=1, malloc(sizeof(struct node))={6:0}, new_head={6:0}] [L570] new_head->next = head [L571] head = new_head VAL [\old(len)=2, head={6:0}, len=1, malloc(sizeof(struct node))={6:0}, new_head={6:0}] [L565] EXPR len-- VAL [\old(len)=2, head={6:0}, len=0, len--=1, malloc(sizeof(struct node))={6:0}, new_head={6:0}] [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=2, head={6:0}, len=0, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=2, head={6:0}, len=0, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L570] new_head->next = head [L571] head = new_head VAL [\old(len)=2, head={9:0}, len=0, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L565] EXPR len-- VAL [\old(len)=2, head={9:0}, len=-1, len--=0, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L565] COND FALSE !(len-- > 0) [L573] return head; VAL [\old(len)=2, \result={9:0}, head={9:0}, len=-1, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L617] RET, EXPR sll_create(len) VAL [len=2, s={7:0}, sll_create(len)={9:0}] [L617] SLL s = sll_create(len); [L618] CALL, EXPR _get_nondet_int(0, len - 1) VAL [\old(from)=0, \old(until)=1] [L609] int len = from; VAL [\old(from)=0, \old(until)=1, from=0, len=0, until=1] [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, __VERIFIER_nondet_int()=1, from=0, len=0, len < until && __VERIFIER_nondet_int()=1, until=1] [L610] COND TRUE len < until && __VERIFIER_nondet_int() [L611] len++ VAL [\old(from)=0, \old(until)=1, from=0, len=1, until=1] [L610] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, from=0, len=1, len < until && __VERIFIER_nondet_int()=0, until=1] [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; VAL [\old(from)=0, \old(until)=1, \result=1, from=0, len=1, until=1] [L618] RET, EXPR _get_nondet_int(0, len - 1) VAL [_get_nondet_int(0, len - 1)=1, len=2, s={7:0}] [L618] const int k = _get_nondet_int(0, len - 1); [L619] int i = 0; VAL [i=0, k=1, len=2, s={7:0}] [L620] i < k && __VERIFIER_nondet_int() [L620] i < k && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=0, i < k && __VERIFIER_nondet_int()=0, k=1, len=2, s={7:0}] [L620] COND FALSE !(i < k && __VERIFIER_nondet_int()) [L625] EXPR \read(s) VAL [\read(s)={9:0}, i=0, k=1, len=2, s={7:0}] [L625] CALL, EXPR sll_length(s) VAL [head={9:0}] [L576] int len = 0; VAL [head={9:0}, head={9:0}, len=0] [L577] COND TRUE \read(head) [L578] len++ [L579] EXPR head->next [L579] head = head->next [L577] COND TRUE \read(head) [L578] len++ [L579] EXPR head->next [L579] head = head->next [L577] COND FALSE !(\read(head)) VAL [head={9:0}, head={0:0}, len=2] [L581] return len; VAL [\result=2, head={0:0}, head={9:0}, len=2] [L625] RET, EXPR sll_length(s) VAL [\read(s)={9:0}, i=0, k=1, len=2, s={7:0}, sll_length(s)=2] [L625] COND TRUE k + len != sll_length(s) [L630] __VERIFIER_error() VAL [i=0, k=1, len=2, s={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 69 locations, 1 error locations. UNSAFE Result, 61.8s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 27.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 548 SDtfs, 300 SDslu, 4476 SDs, 0 SdLazy, 1736 SolverSat, 50 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 885 GetRequests, 663 SyntacticMatches, 47 SemanticMatches, 175 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 21.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 5 AbstIntIterations, 1 AbstIntStrong, 0.9722222222222222 AbsIntWeakeningRatio, 1.1111111111111112 AbsIntAvgWeakeningVarsNumRemoved, 0.4722222222222222 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 163 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 32.0s InterpolantComputationTime, 872 NumberOfCodeBlocks, 851 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1157 ConstructedInterpolants, 48 QuantifiedInterpolants, 504040 SizeOfPredicates, 66 NumberOfNonLiveVariables, 1330 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 23 InterpolantComputations, 4 PerfectInterpolantSequences, 210/350 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...