./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/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 51c8aa06605a84d150023e13a78c11a7b0faebf4 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/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 51c8aa06605a84d150023e13a78c11a7b0faebf4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:31:20,394 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:31:20,395 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:31:20,404 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:31:20,404 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:31:20,405 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:31:20,406 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:31:20,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:31:20,408 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:31:20,409 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:31:20,410 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:31:20,410 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:31:20,410 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:31:20,411 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:31:20,412 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:31:20,413 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:31:20,414 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:31:20,415 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:31:20,416 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:31:20,417 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:31:20,418 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:31:20,419 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:31:20,421 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:31:20,421 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:31:20,421 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:31:20,422 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:31:20,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:31:20,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:31:20,424 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:31:20,425 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:31:20,425 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:31:20,426 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:31:20,426 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:31:20,426 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:31:20,426 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:31:20,427 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:31:20,427 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 19:31:20,442 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:31:20,443 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:31:20,443 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:31:20,443 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 19:31:20,444 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 19:31:20,444 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 19:31:20,444 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 19:31:20,444 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 19:31:20,444 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 19:31:20,444 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 19:31:20,444 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 19:31:20,445 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:31:20,445 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:31:20,445 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:31:20,445 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:31:20,445 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:31:20,446 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:31:20,446 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:31:20,446 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:31:20,446 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:31:20,446 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:31:20,446 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:31:20,446 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:31:20,447 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:31:20,447 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:31:20,447 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:31:20,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:31:20,447 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:31:20,447 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:31:20,447 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:31:20,448 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 19:31:20,448 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:31:20,448 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:31:20,448 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:31:20,448 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_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/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 -> 51c8aa06605a84d150023e13a78c11a7b0faebf4 [2018-10-26 19:31:20,487 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:31:20,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:31:20,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:31:20,504 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:31:20,504 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:31:20,505 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-10-26 19:31:20,543 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/data/f35880030/7d087225a8464e858eab6953e44e6385/FLAG592c955a6 [2018-10-26 19:31:20,963 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:31:20,963 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-10-26 19:31:20,973 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/data/f35880030/7d087225a8464e858eab6953e44e6385/FLAG592c955a6 [2018-10-26 19:31:20,986 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/data/f35880030/7d087225a8464e858eab6953e44e6385 [2018-10-26 19:31:20,990 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:31:20,991 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 19:31:20,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:31:20,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:31:20,995 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:31:20,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:31:20" (1/1) ... [2018-10-26 19:31:20,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3498a54e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:31:20, skipping insertion in model container [2018-10-26 19:31:20,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:31:20" (1/1) ... [2018-10-26 19:31:21,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:31:21,040 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:31:21,289 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:31:21,296 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:31:21,335 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:31:21,378 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:31:21,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:31:21 WrapperNode [2018-10-26 19:31:21,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:31:21,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:31:21,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:31:21,379 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:31:21,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:31:21" (1/1) ... [2018-10-26 19:31:21,402 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:31:21" (1/1) ... [2018-10-26 19:31:21,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:31:21,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:31:21,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:31:21,485 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:31:21,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:31:21" (1/1) ... [2018-10-26 19:31:21,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:31:21" (1/1) ... [2018-10-26 19:31:21,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:31:21" (1/1) ... [2018-10-26 19:31:21,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:31:21" (1/1) ... [2018-10-26 19:31:21,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:31:21" (1/1) ... [2018-10-26 19:31:21,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:31:21" (1/1) ... [2018-10-26 19:31:21,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:31:21" (1/1) ... [2018-10-26 19:31:21,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:31:21,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:31:21,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:31:21,516 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:31:21,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:31:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/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-10-26 19:31:21,585 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-10-26 19:31:21,585 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-10-26 19:31:21,585 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:31:21,585 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-10-26 19:31:21,585 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-10-26 19:31:21,585 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-10-26 19:31:21,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:31:21,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:31:21,586 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:31:21,586 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:31:21,586 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_remove_last [2018-10-26 19:31:21,586 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_remove_last [2018-10-26 19:31:21,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:31:21,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:31:22,131 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:31:22,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:31:22 BoogieIcfgContainer [2018-10-26 19:31:22,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:31:22,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:31:22,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:31:22,136 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:31:22,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:31:20" (1/3) ... [2018-10-26 19:31:22,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd9a448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:31:22, skipping insertion in model container [2018-10-26 19:31:22,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:31:21" (2/3) ... [2018-10-26 19:31:22,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd9a448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:31:22, skipping insertion in model container [2018-10-26 19:31:22,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:31:22" (3/3) ... [2018-10-26 19:31:22,139 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-10-26 19:31:22,148 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:31:22,155 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:31:22,168 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:31:22,193 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:31:22,193 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:31:22,193 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:31:22,193 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:31:22,193 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:31:22,194 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:31:22,194 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:31:22,194 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:31:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-10-26 19:31:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 19:31:22,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:31:22,213 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:31:22,215 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:31:22,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:31:22,223 INFO L82 PathProgramCache]: Analyzing trace with hash -613250840, now seen corresponding path program 1 times [2018-10-26 19:31:22,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:31:22,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:31:22,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:31:22,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:31:22,269 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:31:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:31:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:31:22,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:31:22,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:31:22,372 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:31:22,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 19:31:22,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 19:31:22,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 19:31:22,393 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-10-26 19:31:22,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:31:22,413 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-10-26 19:31:22,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 19:31:22,414 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-10-26 19:31:22,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:31:22,423 INFO L225 Difference]: With dead ends: 64 [2018-10-26 19:31:22,423 INFO L226 Difference]: Without dead ends: 37 [2018-10-26 19:31:22,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 19:31:22,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-26 19:31:22,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-26 19:31:22,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-26 19:31:22,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-10-26 19:31:22,464 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 24 [2018-10-26 19:31:22,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:31:22,466 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-10-26 19:31:22,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 19:31:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-10-26 19:31:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 19:31:22,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:31:22,468 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:31:22,468 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:31:22,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:31:22,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1120811875, now seen corresponding path program 1 times [2018-10-26 19:31:22,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:31:22,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:31:22,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:31:22,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:31:22,471 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:31:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:31:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:31:22,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:31:22,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 19:31:22,630 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:31:22,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:31:22,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:31:22,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:31:22,632 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2018-10-26 19:31:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:31:22,722 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-10-26 19:31:22,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:31:22,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-10-26 19:31:22,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:31:22,724 INFO L225 Difference]: With dead ends: 59 [2018-10-26 19:31:22,724 INFO L226 Difference]: Without dead ends: 43 [2018-10-26 19:31:22,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:31:22,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-26 19:31:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-10-26 19:31:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-26 19:31:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-10-26 19:31:22,733 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2018-10-26 19:31:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:31:22,733 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-10-26 19:31:22,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:31:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-10-26 19:31:22,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 19:31:22,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:31:22,735 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:31:22,735 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:31:22,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:31:22,736 INFO L82 PathProgramCache]: Analyzing trace with hash -10678655, now seen corresponding path program 1 times [2018-10-26 19:31:22,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:31:22,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:31:22,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:31:22,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:31:22,738 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:31:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:31:22,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:31:22,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:31:22,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:31:22,867 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:31:22,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:31:22,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:31:22,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:31:22,868 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2018-10-26 19:31:22,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:31:22,910 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-10-26 19:31:22,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:31:22,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-10-26 19:31:22,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:31:22,912 INFO L225 Difference]: With dead ends: 47 [2018-10-26 19:31:22,912 INFO L226 Difference]: Without dead ends: 43 [2018-10-26 19:31:22,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:31:22,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-26 19:31:22,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-10-26 19:31:22,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-26 19:31:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-10-26 19:31:22,918 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 37 [2018-10-26 19:31:22,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:31:22,919 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-10-26 19:31:22,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:31:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-10-26 19:31:22,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 19:31:22,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:31:22,920 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:31:22,921 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:31:22,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:31:22,922 INFO L82 PathProgramCache]: Analyzing trace with hash 204905672, now seen corresponding path program 1 times [2018-10-26 19:31:22,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:31:22,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:31:22,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:31:22,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:31:22,923 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:31:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:31:23,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:31:23,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:31:23,073 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:31:23,074 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-10-26 19:31:23,075 INFO L202 CegarAbsIntRunner]: [0], [3], [7], [12], [13], [17], [19], [23], [26], [28], [31], [35], [38], [41], [44], [46], [50], [54], [56], [58], [61], [65], [69], [70], [71], [77], [79], [80], [81], [82], [83], [85], [86], [87], [88], [89], [90], [91], [92] [2018-10-26 19:31:23,119 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:31:23,120 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:31:23,860 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:31:23,861 INFO L272 AbstractInterpreter]: Visited 39 different actions 70 times. Merged at 10 different actions 16 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 44 variables. [2018-10-26 19:31:23,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:31:23,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:31:23,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:31:23,918 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/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-10-26 19:31:23,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:31:23,931 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:31:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:31:24,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:31:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:31:24,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:31:24,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:31:24,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 19:31:24,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-10-26 19:31:24,556 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 19:31:24,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 19:31:24,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 19:31:24,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-26 19:31:24,557 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2018-10-26 19:31:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:31:24,652 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-10-26 19:31:24,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 19:31:24,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-10-26 19:31:24,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:31:24,654 INFO L225 Difference]: With dead ends: 51 [2018-10-26 19:31:24,654 INFO L226 Difference]: Without dead ends: 47 [2018-10-26 19:31:24,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-10-26 19:31:24,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-26 19:31:24,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-10-26 19:31:24,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-26 19:31:24,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-10-26 19:31:24,659 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 45 [2018-10-26 19:31:24,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:31:24,659 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-10-26 19:31:24,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 19:31:24,660 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-10-26 19:31:24,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-26 19:31:24,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:31:24,662 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:31:24,662 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:31:24,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:31:24,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1151136783, now seen corresponding path program 2 times [2018-10-26 19:31:24,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:31:24,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:31:24,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:31:24,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:31:24,664 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:31:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:31:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 19:31:24,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:31:24,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 19:31:24,923 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:31:24,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:31:24,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:31:24,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:31:24,924 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 6 states. [2018-10-26 19:31:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:31:25,166 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-10-26 19:31:25,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 19:31:25,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-10-26 19:31:25,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:31:25,168 INFO L225 Difference]: With dead ends: 60 [2018-10-26 19:31:25,169 INFO L226 Difference]: Without dead ends: 56 [2018-10-26 19:31:25,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-26 19:31:25,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-26 19:31:25,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2018-10-26 19:31:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-26 19:31:25,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-10-26 19:31:25,177 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 53 [2018-10-26 19:31:25,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:31:25,178 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-10-26 19:31:25,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:31:25,178 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-10-26 19:31:25,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-26 19:31:25,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:31:25,179 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:31:25,179 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:31:25,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:31:25,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1831195153, now seen corresponding path program 1 times [2018-10-26 19:31:25,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:31:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:31:25,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 19:31:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:31:25,183 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:31:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:31:25,537 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:31:25,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:31:25,537 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:31:25,538 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-10-26 19:31:25,538 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [12], [13], [17], [19], [23], [26], [28], [31], [35], [38], [41], [44], [46], [50], [54], [56], [58], [61], [65], [69], [70], [71], [77], [79], [80], [81], [82], [83], [85], [86], [87], [88], [89], [90], [91], [92] [2018-10-26 19:31:25,542 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:31:25,542 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:31:25,949 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:31:25,949 INFO L272 AbstractInterpreter]: Visited 40 different actions 79 times. Merged at 12 different actions 22 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 52 variables. [2018-10-26 19:31:25,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:31:25,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:31:25,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:31:25,962 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/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-10-26 19:31:25,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:31:25,972 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:31:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:31:26,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:31:26,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:31:26,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:31:26,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:26,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:26,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:31:26,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:31:26,279 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:26,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:26,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:26,289 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-10-26 19:31:26,357 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_circular_remove_last_write~$Pointer$_#ptr.base| Int) (dll_circular_remove_last_~snd_to_last~0.base Int) (dll_circular_remove_last_~snd_to_last~0.offset Int) (|dll_circular_remove_last_write~$Pointer$_#ptr.offset| Int)) (let ((.cse1 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|)) (.cse2 (+ (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) 4))) (and (= |c_#memory_$Pointer$.offset| (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| .cse1 (store (select |c_old(#memory_$Pointer$.offset)| .cse1) .cse2 dll_circular_remove_last_~snd_to_last~0.offset)))) (store .cse0 |dll_circular_remove_last_write~$Pointer$_#ptr.base| (store (select .cse0 |dll_circular_remove_last_write~$Pointer$_#ptr.base|) |dll_circular_remove_last_write~$Pointer$_#ptr.offset| (select (select .cse0 |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))))) (= (let ((.cse3 (store |c_old(#memory_$Pointer$.base)| .cse1 (store (select |c_old(#memory_$Pointer$.base)| .cse1) .cse2 dll_circular_remove_last_~snd_to_last~0.base)))) (store .cse3 |dll_circular_remove_last_write~$Pointer$_#ptr.base| (store (select .cse3 |dll_circular_remove_last_write~$Pointer$_#ptr.base|) |dll_circular_remove_last_write~$Pointer$_#ptr.offset| (select (select .cse3 |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|)))) |c_#memory_$Pointer$.base|)))) is different from true [2018-10-26 19:31:26,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 104 [2018-10-26 19:31:26,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-26 19:31:26,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:26,550 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:26,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 122 [2018-10-26 19:31:26,594 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-26 19:31:26,595 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:26,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 95 [2018-10-26 19:31:26,805 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:26,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 108 [2018-10-26 19:31:26,927 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:26,955 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:31:26,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:31:27,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 84 [2018-10-26 19:31:27,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-26 19:31:27,053 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:27,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2018-10-26 19:31:27,117 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-26 19:31:27,117 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:27,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2018-10-26 19:31:27,185 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:27,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 62 [2018-10-26 19:31:27,323 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:27,359 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:31:27,378 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:31:27,387 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:27,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 83 [2018-10-26 19:31:27,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-26 19:31:27,394 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:27,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 55 [2018-10-26 19:31:27,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-10-26 19:31:27,420 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:27,426 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:27,435 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:27,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-26 19:31:27,480 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:185, output treesize:99 [2018-10-26 19:31:27,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-10-26 19:31:27,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-26 19:31:27,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:27,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:27,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 19:31:27,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 19:31:27,564 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:27,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:27,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:27,569 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-10-26 19:31:27,579 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2018-10-26 19:31:27,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:31:28,321 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-10-26 19:31:28,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 53 [2018-10-26 19:31:28,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-26 19:31:28,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:28,479 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:28,480 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:28,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2018-10-26 19:31:28,507 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:28,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-26 19:31:28,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:28,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-10-26 19:31:28,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-26 19:31:28,515 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:28,517 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:28,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:28,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:28,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 53 [2018-10-26 19:31:28,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-26 19:31:28,548 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:28,556 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:28,557 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:28,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2018-10-26 19:31:28,588 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:28,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-26 19:31:28,589 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:28,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-10-26 19:31:28,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-26 19:31:28,598 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:28,600 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:28,601 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:28,604 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:28,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:28,612 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:183, output treesize:4 [2018-10-26 19:31:28,770 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 61 [2018-10-26 19:31:28,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 101 [2018-10-26 19:31:28,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-26 19:31:28,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:28,978 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 82 [2018-10-26 19:31:29,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-10-26 19:31:29,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:29,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 57 [2018-10-26 19:31:29,083 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:29,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2018-10-26 19:31:29,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-10-26 19:31:29,123 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:29,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-10-26 19:31:29,150 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:29,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-10-26 19:31:29,163 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:31:29,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2018-10-26 19:31:29,179 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:29,191 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:31:29,201 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:29,207 INFO L477 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 86 treesize of output 60 [2018-10-26 19:31:29,228 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:29,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2018-10-26 19:31:29,230 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:29,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-10-26 19:31:29,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-26 19:31:29,250 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:29,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-26 19:31:29,254 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:29,256 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:29,260 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:29,323 INFO L477 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 105 [2018-10-26 19:31:29,560 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 137 [2018-10-26 19:31:29,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 73 [2018-10-26 19:31:29,571 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:29,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2018-10-26 19:31:29,700 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:29,828 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:29,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 67 [2018-10-26 19:31:29,830 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:29,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2018-10-26 19:31:29,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-10-26 19:31:29,982 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:29,986 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:30,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 44 [2018-10-26 19:31:30,069 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:30,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-10-26 19:31:30,071 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:30,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-26 19:31:30,145 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:30,146 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:30,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 57 [2018-10-26 19:31:30,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-10-26 19:31:30,275 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:31:30,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2018-10-26 19:31:30,315 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:30,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-10-26 19:31:30,352 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:30,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-10-26 19:31:30,389 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:30,459 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:30,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 26 [2018-10-26 19:31:30,464 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:30,501 INFO L267 ElimStorePlain]: Start of recursive call 26: 7 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:31:30,504 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:30,533 INFO L477 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 113 [2018-10-26 19:31:30,791 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 143 [2018-10-26 19:31:30,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 72 [2018-10-26 19:31:30,842 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:30,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 69 [2018-10-26 19:31:30,851 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:30,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 69 [2018-10-26 19:31:30,862 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:31,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-10-26 19:31:31,350 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:31,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-10-26 19:31:31,353 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:31,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-10-26 19:31:31,355 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:31,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 60 [2018-10-26 19:31:31,689 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:31,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 60 [2018-10-26 19:31:31,698 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:31,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 60 [2018-10-26 19:31:31,708 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:32,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 48 [2018-10-26 19:31:32,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-10-26 19:31:32,076 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:32,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-10-26 19:31:32,149 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:32,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-10-26 19:31:32,162 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:31:32,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2018-10-26 19:31:32,179 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:32,194 INFO L267 ElimStorePlain]: Start of recursive call 42: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:31:32,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 48 [2018-10-26 19:31:32,203 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:32,204 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:32,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2018-10-26 19:31:32,205 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:32,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-10-26 19:31:32,223 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:32,233 INFO L267 ElimStorePlain]: Start of recursive call 47: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:32,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 48 [2018-10-26 19:31:32,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-10-26 19:31:32,245 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:32,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-10-26 19:31:32,262 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:32,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-10-26 19:31:32,276 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:31:32,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2018-10-26 19:31:32,293 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:32,309 INFO L267 ElimStorePlain]: Start of recursive call 50: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:31:32,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 53 [2018-10-26 19:31:32,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-10-26 19:31:32,863 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:32,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-26 19:31:32,893 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:33,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-10-26 19:31:33,154 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:33,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-10-26 19:31:33,176 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:33,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-10-26 19:31:33,201 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:33,217 INFO L267 ElimStorePlain]: Start of recursive call 55: 6 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:31:33,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 53 [2018-10-26 19:31:33,508 WARN L179 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-10-26 19:31:33,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2018-10-26 19:31:33,522 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 3 xjuncts. [2018-10-26 19:31:33,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-10-26 19:31:33,571 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:33,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-10-26 19:31:33,594 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:33,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2018-10-26 19:31:33,645 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:33,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10-26 19:31:33,667 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:33,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-10-26 19:31:33,683 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:33,693 INFO L267 ElimStorePlain]: Start of recursive call 61: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:31:33,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 53 [2018-10-26 19:31:33,881 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2018-10-26 19:31:33,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-10-26 19:31:33,887 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:33,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-10-26 19:31:33,947 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:33,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-10-26 19:31:33,984 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:34,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-26 19:31:34,022 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:34,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-26 19:31:34,041 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:34,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-10-26 19:31:34,091 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:34,129 INFO L267 ElimStorePlain]: Start of recursive call 68: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:31:34,193 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, 8 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:31:34,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:34,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 114 [2018-10-26 19:31:34,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 96 [2018-10-26 19:31:34,307 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:34,310 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:34,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 96 [2018-10-26 19:31:34,310 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:34,314 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:34,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 98 [2018-10-26 19:31:34,315 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:34,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 141 [2018-10-26 19:31:34,319 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:34,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 88 [2018-10-26 19:31:34,485 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:34,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 95 [2018-10-26 19:31:34,488 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:34,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 90 [2018-10-26 19:31:34,491 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:34,650 INFO L477 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 111 [2018-10-26 19:31:34,951 WARN L179 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 143 [2018-10-26 19:31:34,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 79 [2018-10-26 19:31:34,961 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:35,126 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:35,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 76 [2018-10-26 19:31:35,128 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:35,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 66 [2018-10-26 19:31:35,272 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:35,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2018-10-26 19:31:35,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 12 [2018-10-26 19:31:35,425 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:35,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-10-26 19:31:35,438 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:35,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 19:31:35,441 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:35,446 INFO L267 ElimStorePlain]: Start of recursive call 87: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:35,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 49 [2018-10-26 19:31:35,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 1 [2018-10-26 19:31:35,450 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:35,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-10-26 19:31:35,476 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:35,482 INFO L267 ElimStorePlain]: Start of recursive call 91: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:35,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 53 [2018-10-26 19:31:35,583 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:35,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-10-26 19:31:35,586 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:35,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10-26 19:31:35,594 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:35,598 INFO L267 ElimStorePlain]: Start of recursive call 94: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:35,670 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:35,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 64 [2018-10-26 19:31:35,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-10-26 19:31:35,687 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,109 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:36,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2018-10-26 19:31:36,115 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:36,143 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:36,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 32 [2018-10-26 19:31:36,148 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:36,424 INFO L267 ElimStorePlain]: Start of recursive call 97: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,452 INFO L267 ElimStorePlain]: Start of recursive call 83: 3 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,469 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 88 [2018-10-26 19:31:36,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2018-10-26 19:31:36,541 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 70 [2018-10-26 19:31:36,586 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:36,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2018-10-26 19:31:36,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 1 [2018-10-26 19:31:36,639 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-26 19:31:36,648 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10-26 19:31:36,656 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,661 INFO L267 ElimStorePlain]: Start of recursive call 104: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2018-10-26 19:31:36,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2018-10-26 19:31:36,707 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-26 19:31:36,715 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,721 INFO L267 ElimStorePlain]: Start of recursive call 108: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2018-10-26 19:31:36,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 12 [2018-10-26 19:31:36,729 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 2 xjuncts. [2018-10-26 19:31:36,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-26 19:31:36,740 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-10-26 19:31:36,746 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,750 INFO L267 ElimStorePlain]: Start of recursive call 111: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,774 INFO L267 ElimStorePlain]: Start of recursive call 101: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,781 INFO L477 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 95 treesize of output 66 [2018-10-26 19:31:36,807 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:36,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2018-10-26 19:31:36,809 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-10-26 19:31:36,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-26 19:31:36,866 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-26 19:31:36,871 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,872 INFO L267 ElimStorePlain]: Start of recursive call 117: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,878 INFO L267 ElimStorePlain]: Start of recursive call 115: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-10-26 19:31:36,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-10-26 19:31:36,959 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,963 INFO L267 ElimStorePlain]: Start of recursive call 120: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-10-26 19:31:36,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-10-26 19:31:36,967 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,970 INFO L267 ElimStorePlain]: Start of recursive call 122: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:36,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 88 [2018-10-26 19:31:37,119 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2018-10-26 19:31:37,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2018-10-26 19:31:37,121 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:37,159 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:37,160 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:37,161 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:37,163 INFO L477 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 61 treesize of output 65 [2018-10-26 19:31:37,163 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:37,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 54 [2018-10-26 19:31:37,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-10-26 19:31:37,225 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:37,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-10-26 19:31:37,233 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:37,239 INFO L267 ElimStorePlain]: Start of recursive call 127: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:37,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2018-10-26 19:31:37,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-10-26 19:31:37,316 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:37,320 INFO L267 ElimStorePlain]: Start of recursive call 130: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:37,333 INFO L267 ElimStorePlain]: Start of recursive call 124: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:37,351 INFO L267 ElimStorePlain]: Start of recursive call 75: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:37,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:31:37,378 INFO L202 ElimStorePlain]: Needed 131 recursive calls to eliminate 10 variables, input treesize:419, output treesize:15 [2018-10-26 19:31:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:31:37,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 19:31:37,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 18 [2018-10-26 19:31:37,435 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 19:31:37,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 19:31:37,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 19:31:37,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=224, Unknown=1, NotChecked=30, Total=306 [2018-10-26 19:31:37,436 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 13 states. [2018-10-26 19:31:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:31:37,718 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-10-26 19:31:37,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 19:31:37,719 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-10-26 19:31:37,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:31:37,720 INFO L225 Difference]: With dead ends: 62 [2018-10-26 19:31:37,720 INFO L226 Difference]: Without dead ends: 45 [2018-10-26 19:31:37,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 92 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=100, Invalid=407, Unknown=3, NotChecked=42, Total=552 [2018-10-26 19:31:37,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-26 19:31:37,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-26 19:31:37,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-26 19:31:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-10-26 19:31:37,726 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 53 [2018-10-26 19:31:37,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:31:37,726 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-10-26 19:31:37,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 19:31:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-10-26 19:31:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-26 19:31:37,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:31:37,727 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:31:37,727 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:31:37,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:31:37,727 INFO L82 PathProgramCache]: Analyzing trace with hash 242847251, now seen corresponding path program 1 times [2018-10-26 19:31:37,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:31:37,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:31:37,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:31:37,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:31:37,729 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:31:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:31:38,526 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-10-26 19:31:39,106 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2018-10-26 19:31:39,684 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 19:31:39,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:31:39,684 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:31:39,684 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-10-26 19:31:39,684 INFO L202 CegarAbsIntRunner]: [0], [5], [7], [12], [13], [17], [19], [23], [26], [28], [31], [35], [38], [41], [44], [46], [50], [54], [56], [58], [61], [65], [69], [70], [71], [77], [79], [80], [81], [82], [83], [85], [86], [87], [88], [89], [90], [91], [92] [2018-10-26 19:31:39,688 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:31:39,688 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:31:39,954 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:31:39,954 INFO L272 AbstractInterpreter]: Visited 39 different actions 70 times. Merged at 10 different actions 16 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 50 variables. [2018-10-26 19:31:39,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:31:39,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:31:39,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:31:39,971 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/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-10-26 19:31:39,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:31:39,978 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:31:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:31:40,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:31:40,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-26 19:31:40,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 19:31:40,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 19:31:40,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 19:31:40,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:34 [2018-10-26 19:31:40,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:31:40,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:31:40,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:31:40,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:31:40,454 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,457 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,465 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-10-26 19:31:40,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2018-10-26 19:31:40,505 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:40,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 25 [2018-10-26 19:31:40,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,517 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:40,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 43 [2018-10-26 19:31:40,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-10-26 19:31:40,520 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-10-26 19:31:40,550 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:40,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-26 19:31:40,551 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 54 [2018-10-26 19:31:40,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-26 19:31:40,563 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,569 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,573 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,585 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:96, output treesize:107 [2018-10-26 19:31:40,630 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:40,631 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:40,632 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:40,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-10-26 19:31:40,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:112, output treesize:105 [2018-10-26 19:31:40,694 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:40,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 97 [2018-10-26 19:31:40,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:31:40,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,730 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 85 [2018-10-26 19:31:40,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:31:40,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,752 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:108, output treesize:137 [2018-10-26 19:31:40,861 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse2 (exists ((|dll_circular_remove_last_write~$Pointer$_#value.base| Int)) (= |c_#memory_$Pointer$.base| (let ((.cse17 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse18 (select |c_old(#memory_$Pointer$.base)| .cse17)) (.cse19 (+ (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) 4))) (let ((.cse15 (select .cse18 .cse19)) (.cse16 (+ (select (select |c_old(#memory_$Pointer$.offset)| .cse17) .cse19) 4))) (let ((.cse14 (select (select |c_old(#memory_$Pointer$.base)| .cse15) .cse16))) (let ((.cse13 (store |c_old(#memory_$Pointer$.base)| .cse17 (store .cse18 .cse19 .cse14)))) (store .cse13 .cse14 (store (select .cse13 .cse14) (select (select |c_old(#memory_$Pointer$.offset)| .cse15) .cse16) |dll_circular_remove_last_write~$Pointer$_#value.base|)))))))))) (.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|)) (.cse1 (+ .cse4 4)) (.cse3 (exists ((|dll_circular_remove_last_write~$Pointer$_#value.offset| Int)) (= (let ((.cse10 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse11 (select |c_old(#memory_$Pointer$.offset)| .cse10)) (.cse12 (+ (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) 4))) (let ((.cse8 (select (select |c_old(#memory_$Pointer$.base)| .cse10) .cse12)) (.cse9 (+ (select .cse11 .cse12) 4))) (let ((.cse7 (select (select |c_old(#memory_$Pointer$.offset)| .cse8) .cse9))) (let ((.cse5 (store |c_old(#memory_$Pointer$.offset)| .cse10 (store .cse11 .cse12 .cse7))) (.cse6 (select (select |c_old(#memory_$Pointer$.base)| .cse8) .cse9))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 |dll_circular_remove_last_write~$Pointer$_#value.offset|))))))) |c_#memory_$Pointer$.offset|)))) (or (and (not (= .cse0 (select (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1))) .cse2 .cse3) (and .cse2 (not (= (select (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1) .cse4)) .cse3)))) is different from true [2018-10-26 19:31:40,867 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse32 (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|)) (.cse1 (+ .cse32 4))) (or (and (not (= .cse0 (select (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1))) (exists ((|dll_circular_remove_last_write~$Pointer$_#value.base| Int)) (= |c_#memory_$Pointer$.base| (let ((.cse6 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse7 (select |c_old(#memory_$Pointer$.base)| .cse6)) (.cse8 (+ (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) 4))) (let ((.cse4 (select .cse7 .cse8)) (.cse5 (+ (select (select |c_old(#memory_$Pointer$.offset)| .cse6) .cse8) 4))) (let ((.cse3 (select (select |c_old(#memory_$Pointer$.base)| .cse4) .cse5))) (let ((.cse2 (store |c_old(#memory_$Pointer$.base)| .cse6 (store .cse7 .cse8 .cse3)))) (store .cse2 .cse3 (store (select .cse2 .cse3) (select (select |c_old(#memory_$Pointer$.offset)| .cse4) .cse5) |dll_circular_remove_last_write~$Pointer$_#value.base|))))))))) (exists ((|dll_circular_remove_last_write~$Pointer$_#value.offset| Int)) (= (let ((.cse14 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse15 (select |c_old(#memory_$Pointer$.offset)| .cse14)) (.cse16 (+ (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) 4))) (let ((.cse12 (select (select |c_old(#memory_$Pointer$.base)| .cse14) .cse16)) (.cse13 (+ (select .cse15 .cse16) 4))) (let ((.cse11 (select (select |c_old(#memory_$Pointer$.offset)| .cse12) .cse13))) (let ((.cse9 (store |c_old(#memory_$Pointer$.offset)| .cse14 (store .cse15 .cse16 .cse11))) (.cse10 (select (select |c_old(#memory_$Pointer$.base)| .cse12) .cse13))) (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 |dll_circular_remove_last_write~$Pointer$_#value.offset|))))))) |c_#memory_$Pointer$.offset|))) (and (exists ((v_prenex_80 Int)) (= |c_#memory_$Pointer$.base| (let ((.cse21 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse22 (select |c_old(#memory_$Pointer$.base)| .cse21)) (.cse23 (+ (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) 4))) (let ((.cse19 (select .cse22 .cse23)) (.cse20 (+ (select (select |c_old(#memory_$Pointer$.offset)| .cse21) .cse23) 4))) (let ((.cse18 (select (select |c_old(#memory_$Pointer$.base)| .cse19) .cse20))) (let ((.cse17 (store |c_old(#memory_$Pointer$.base)| .cse21 (store .cse22 .cse23 .cse18)))) (store .cse17 .cse18 (store (select .cse17 .cse18) (select (select |c_old(#memory_$Pointer$.offset)| .cse19) .cse20) v_prenex_80))))))))) (exists ((v_prenex_81 Int)) (= (let ((.cse29 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse30 (select |c_old(#memory_$Pointer$.offset)| .cse29)) (.cse31 (+ (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) 4))) (let ((.cse27 (select (select |c_old(#memory_$Pointer$.base)| .cse29) .cse31)) (.cse28 (+ (select .cse30 .cse31) 4))) (let ((.cse26 (select (select |c_old(#memory_$Pointer$.offset)| .cse27) .cse28))) (let ((.cse24 (store |c_old(#memory_$Pointer$.offset)| .cse29 (store .cse30 .cse31 .cse26))) (.cse25 (select (select |c_old(#memory_$Pointer$.base)| .cse27) .cse28))) (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 v_prenex_81))))))) |c_#memory_$Pointer$.offset|)) (not (= (select (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1) .cse32)))))) is different from true [2018-10-26 19:31:40,880 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:40,891 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:40,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 609 treesize of output 569 [2018-10-26 19:31:40,910 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:40,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 365 treesize of output 260 [2018-10-26 19:31:40,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,944 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:40,945 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:40,954 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 320 [2018-10-26 19:31:40,974 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:40,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 91 [2018-10-26 19:31:40,976 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:40,992 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:41,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:41,049 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:41,050 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:41,051 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:41,052 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:41,054 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:41,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 233 [2018-10-26 19:31:41,064 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:41,078 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 291 treesize of output 203 [2018-10-26 19:31:41,082 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-10-26 19:31:41,216 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:41,225 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:41,233 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 152 [2018-10-26 19:31:41,236 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:41,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2018-10-26 19:31:41,237 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 19:31:41,254 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:31:41,292 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:41,320 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:41,355 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:41,365 INFO L303 Elim1Store]: Index analysis took 109 ms [2018-10-26 19:31:41,365 INFO L477 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 0 case distinctions, treesize of input 263 treesize of output 183 [2018-10-26 19:31:41,413 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:41,414 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:41,415 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:41,419 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:41,471 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 183 treesize of output 240 [2018-10-26 19:31:41,479 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:31:41,749 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:31:41,931 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:31:42,086 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:31:42,242 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:31:42,414 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:31:42,594 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:31:42,773 INFO L267 ElimStorePlain]: Start of recursive call 11: 6 dim-0 vars, 7 dim-1 vars, End of recursive call: 13 dim-0 vars, and 7 xjuncts. [2018-10-26 19:31:42,933 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 13 dim-0 vars, and 7 xjuncts. [2018-10-26 19:31:42,989 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:42,990 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:42,991 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:31:42,992 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:42,998 INFO L477 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 151 treesize of output 168 [2018-10-26 19:31:43,001 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:43,004 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:43,004 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:31:43,023 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 163 [2018-10-26 19:31:43,026 INFO L267 ElimStorePlain]: Start of recursive call 20: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-10-26 19:31:43,081 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:31:43,369 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 21 dim-0 vars, and 10 xjuncts. [2018-10-26 19:31:44,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 21 dim-0 vars, and 10 xjuncts. [2018-10-26 19:31:44,198 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 8 variables, input treesize:1219, output treesize:1471 [2018-10-26 19:31:45,413 WARN L179 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 43 [2018-10-26 19:31:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-10-26 19:31:45,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:31:45,965 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-10-26 19:31:50,776 WARN L179 SmtUtils]: Spent 4.36 s on a formula simplification that was a NOOP. DAG size: 62 [2018-10-26 19:31:57,616 WARN L179 SmtUtils]: Spent 5.53 s on a formula simplification that was a NOOP. DAG size: 112 [2018-10-26 19:31:57,622 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-26 19:31:57,626 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-10-26 19:32:09,969 WARN L179 SmtUtils]: Spent 11.75 s on a formula simplification that was a NOOP. DAG size: 158 [2018-10-26 19:32:09,972 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-26 19:32:09,976 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-10-26 19:32:24,822 WARN L179 SmtUtils]: Spent 14.40 s on a formula simplification that was a NOOP. DAG size: 154 [2018-10-26 19:32:41,891 WARN L179 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 158 [2018-10-26 19:32:42,235 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-10-26 19:32:48,403 WARN L179 SmtUtils]: Spent 6.02 s on a formula simplification. DAG size of input: 626 DAG size of output: 130 [2018-10-26 19:32:48,418 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:48,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3909 treesize of output 3264 [2018-10-26 19:32:48,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-10-26 19:32:48,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-10-26 19:32:48,446 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:48,458 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:48,494 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:48,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3250 treesize of output 2782 [2018-10-26 19:32:48,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-26 19:32:48,607 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:48,626 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:48,627 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:48,628 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:48,630 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:48,647 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 2618 treesize of output 2731 [2018-10-26 19:32:48,651 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:48,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 2501 treesize of output 2533 [2018-10-26 19:32:48,652 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:48,681 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:48,684 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:48,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2646 treesize of output 2658 [2018-10-26 19:32:48,751 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:48,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 2269 treesize of output 2173 [2018-10-26 19:32:48,752 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:48,772 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:48,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2224 treesize of output 1961 [2018-10-26 19:32:48,776 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:48,777 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:48,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 1902 treesize of output 1889 [2018-10-26 19:32:48,798 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:48,809 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:48,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 1884 treesize of output 1873 [2018-10-26 19:32:48,810 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:48,815 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:48,820 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:48,828 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:48,835 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:48,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:48,935 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:48,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1889 treesize of output 1112 [2018-10-26 19:32:48,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-10-26 19:32:49,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-10-26 19:32:49,013 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:49,026 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:49,040 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,042 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 910 treesize of output 574 [2018-10-26 19:32:49,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 405 treesize of output 380 [2018-10-26 19:32:49,103 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:49,129 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,130 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,131 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:49,131 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,133 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,133 INFO L477 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 396 treesize of output 230 [2018-10-26 19:32:49,188 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,191 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,207 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 192 [2018-10-26 19:32:49,208 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-26 19:32:49,210 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 19:32:49,210 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:49,214 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,217 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,227 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 285 treesize of output 301 [2018-10-26 19:32:49,228 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-26 19:32:49,263 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,264 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,265 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 147 [2018-10-26 19:32:49,339 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,339 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,340 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:49,341 INFO L477 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 83 treesize of output 93 [2018-10-26 19:32:49,341 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:49,342 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 19:32:49,343 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:49,344 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,345 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,346 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:49,346 INFO L477 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 111 treesize of output 114 [2018-10-26 19:32:49,346 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:49,368 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,369 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:49,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 84 [2018-10-26 19:32:49,385 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-10-26 19:32:49,387 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:49,398 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 55 [2018-10-26 19:32:49,409 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:49,410 INFO L477 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 45 treesize of output 40 [2018-10-26 19:32:49,410 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:49,445 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,446 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-10-26 19:32:49,447 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:49,474 INFO L477 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 0 case distinctions, treesize of input 26 treesize of output 25 [2018-10-26 19:32:49,475 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:49,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 24 [2018-10-26 19:32:49,509 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-10-26 19:32:49,552 INFO L267 ElimStorePlain]: Start of recursive call 29: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:32:49,556 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:32:49,560 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:32:49,565 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:32:49,569 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:32:49,578 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:32:49,656 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3909 treesize of output 3000 [2018-10-26 19:32:49,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-10-26 19:32:49,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-10-26 19:32:49,705 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:49,717 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:49,747 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2986 treesize of output 2326 [2018-10-26 19:32:49,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-26 19:32:49,855 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:49,874 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,875 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,878 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:49,880 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:49,901 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 2162 treesize of output 2137 [2018-10-26 19:32:49,904 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 1957 treesize of output 1981 [2018-10-26 19:32:49,905 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:49,931 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:49,934 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:49,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2094 treesize of output 1895 [2018-10-26 19:32:50,064 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2018-10-26 19:32:50,073 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 2080 treesize of output 1984 [2018-10-26 19:32:50,075 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:50,077 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 1628 treesize of output 1536 [2018-10-26 19:32:50,078 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:50,302 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,304 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:50,335 INFO L477 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 5 case distinctions, treesize of input 1485 treesize of output 1496 [2018-10-26 19:32:50,348 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,372 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,401 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,402 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 1375 treesize of output 1766 [2018-10-26 19:32:50,403 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:50,492 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,493 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,495 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:50,498 INFO L477 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 1833 treesize of output 2112 [2018-10-26 19:32:50,498 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:50,572 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,573 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,574 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:50,577 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,577 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 3146 treesize of output 1544 [2018-10-26 19:32:50,696 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 70 [2018-10-26 19:32:50,698 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,699 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,699 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,702 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:50,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1506 treesize of output 1507 [2018-10-26 19:32:50,703 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:50,739 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,740 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:50,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 1329 treesize of output 1316 [2018-10-26 19:32:50,741 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:50,767 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,768 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,768 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,771 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:50,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 654 treesize of output 648 [2018-10-26 19:32:50,772 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:50,787 INFO L267 ElimStorePlain]: Start of recursive call 47: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:50,835 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,837 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,838 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:50,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 1930 treesize of output 2252 [2018-10-26 19:32:50,854 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:50,855 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 2243 treesize of output 2230 [2018-10-26 19:32:50,857 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:50,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1331 treesize of output 1327 [2018-10-26 19:32:50,924 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:50,954 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:50,955 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:50,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 1324 treesize of output 1311 [2018-10-26 19:32:50,957 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,008 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,019 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:51,020 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 678 treesize of output 676 [2018-10-26 19:32:51,021 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,047 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,048 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,049 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,051 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:51,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 654 treesize of output 648 [2018-10-26 19:32:51,052 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,074 INFO L267 ElimStorePlain]: Start of recursive call 51: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:32:51,108 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,109 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:51,110 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 570 treesize of output 210 [2018-10-26 19:32:51,116 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,117 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,122 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2018-10-26 19:32:51,123 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-26 19:32:51,137 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,137 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,139 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,139 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2018-10-26 19:32:51,139 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,145 INFO L267 ElimStorePlain]: Start of recursive call 57: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,163 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:32:51,166 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,169 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,170 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:51,187 INFO L477 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 1 case distinctions, treesize of input 1873 treesize of output 2610 [2018-10-26 19:32:51,190 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,191 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,192 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:51,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 515 [2018-10-26 19:32:51,195 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,220 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,222 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,223 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:51,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 1861 treesize of output 2237 [2018-10-26 19:32:51,239 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,240 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,241 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:51,241 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 1551 treesize of output 1554 [2018-10-26 19:32:51,242 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,275 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,276 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,278 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:51,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 743 treesize of output 751 [2018-10-26 19:32:51,284 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 2 xjuncts. [2018-10-26 19:32:51,310 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:51,310 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,313 INFO L477 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 1442 treesize of output 1435 [2018-10-26 19:32:51,314 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,343 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,344 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:51,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 1420 treesize of output 1411 [2018-10-26 19:32:51,345 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1406 treesize of output 1402 [2018-10-26 19:32:51,360 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,371 INFO L267 ElimStorePlain]: Start of recursive call 62: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:32:51,385 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:32:51,410 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:32:51,433 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:32:51,460 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:32:51,490 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:32:51,553 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1320 treesize of output 785 [2018-10-26 19:32:51,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-10-26 19:32:51,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-10-26 19:32:51,595 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,599 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,614 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,616 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 630 treesize of output 407 [2018-10-26 19:32:51,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 292 treesize of output 273 [2018-10-26 19:32:51,669 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:51,681 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,682 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,682 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,684 INFO L477 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 274 treesize of output 175 [2018-10-26 19:32:51,725 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,726 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 111 [2018-10-26 19:32:51,727 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,739 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,740 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,742 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2018-10-26 19:32:51,789 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 19:32:51,790 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,794 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,797 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,800 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,802 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:51,811 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 107 [2018-10-26 19:32:51,812 INFO L267 ElimStorePlain]: Start of recursive call 77: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-26 19:32:51,869 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 50 [2018-10-26 19:32:51,891 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,892 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:51,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-10-26 19:32:51,893 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,907 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,908 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:51,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 8 [2018-10-26 19:32:51,909 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,914 INFO L267 ElimStorePlain]: Start of recursive call 78: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,917 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,922 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,925 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,932 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,935 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 748 treesize of output 455 [2018-10-26 19:32:51,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-10-26 19:32:51,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-10-26 19:32:51,945 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,951 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:51,970 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,972 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:51,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 434 treesize of output 230 [2018-10-26 19:32:51,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-10-26 19:32:51,997 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:52,007 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:52,008 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:52,009 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:52,010 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:52,011 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:52,011 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:52,014 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 124 [2018-10-26 19:32:52,018 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:52,025 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 47 [2018-10-26 19:32:52,026 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-26 19:32:52,045 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:52,045 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:52,047 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:52,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 96 [2018-10-26 19:32:52,085 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:52,086 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:52,087 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:52,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 56 [2018-10-26 19:32:52,088 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:52,102 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:52,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-10-26 19:32:52,105 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:32:52,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2018-10-26 19:32:52,106 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:52,126 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:32:52,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-10-26 19:32:52,127 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-10-26 19:32:52,129 INFO L267 ElimStorePlain]: Start of recursive call 90: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:52,130 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:52,133 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:52,136 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:52,142 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:32:52,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-26 19:32:52,184 INFO L202 ElimStorePlain]: Needed 92 recursive calls to eliminate 28 variables, input treesize:22625, output treesize:33 [2018-10-26 19:32:52,265 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 81 [2018-10-26 19:33:51,884 WARN L179 SmtUtils]: Spent 8.06 s on a formula simplification that was a NOOP. DAG size: 202 [2018-10-26 19:33:51,892 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 81 [2018-10-26 19:33:51,979 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 81 [2018-10-26 19:34:03,167 WARN L179 SmtUtils]: Spent 8.08 s on a formula simplification that was a NOOP. DAG size: 216 [2018-10-26 19:34:03,178 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 81 [2018-10-26 19:34:03,293 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 81 [2018-10-26 19:34:03,398 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 81 [2018-10-26 19:34:16,696 WARN L179 SmtUtils]: Spent 6.13 s on a formula simplification that was a NOOP. DAG size: 216 [2018-10-26 19:34:16,709 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 81 [2018-10-26 19:34:16,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11298 treesize of output 8509 [2018-10-26 19:34:16,996 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:34:16,997 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:223) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-26 19:34:17,000 INFO L168 Benchmark]: Toolchain (without parser) took 176009.61 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 416.8 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -216.5 MB). Peak memory consumption was 200.3 MB. Max. memory is 11.5 GB. [2018-10-26 19:34:17,003 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:34:17,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.80 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 930.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-26 19:34:17,003 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 930.8 MB in the beginning and 1.2 GB in the end (delta: -224.7 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-26 19:34:17,004 INFO L168 Benchmark]: Boogie Preprocessor took 30.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 19:34:17,004 INFO L168 Benchmark]: RCFGBuilder took 616.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2018-10-26 19:34:17,004 INFO L168 Benchmark]: TraceAbstraction took 174866.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 260.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -59.8 MB). Peak memory consumption was 200.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:34:17,005 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 386.80 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 930.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 105.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 930.8 MB in the beginning and 1.2 GB in the end (delta: -224.7 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 616.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 174866.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 260.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -59.8 MB). Peak memory consumption was 200.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:34:18,823 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:34:18,825 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:34:18,836 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:34:18,839 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:34:18,840 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:34:18,841 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:34:18,842 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:34:18,843 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:34:18,844 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:34:18,846 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:34:18,847 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:34:18,848 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:34:18,848 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:34:18,849 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:34:18,850 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:34:18,850 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:34:18,851 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:34:18,859 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:34:18,861 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:34:18,864 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:34:18,866 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:34:18,870 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:34:18,871 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:34:18,872 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:34:18,872 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:34:18,873 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:34:18,873 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:34:18,874 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:34:18,875 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:34:18,875 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:34:18,875 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:34:18,875 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:34:18,875 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:34:18,876 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:34:18,879 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:34:18,880 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 19:34:18,897 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:34:18,898 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:34:18,899 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:34:18,899 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 19:34:18,899 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 19:34:18,899 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 19:34:18,900 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 19:34:18,900 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 19:34:18,901 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:34:18,902 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:34:18,902 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:34:18,902 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:34:18,902 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:34:18,902 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:34:18,902 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:34:18,903 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 19:34:18,903 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 19:34:18,903 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:34:18,903 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:34:18,903 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:34:18,903 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:34:18,904 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:34:18,904 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:34:18,904 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:34:18,904 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:34:18,904 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:34:18,904 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:34:18,904 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:34:18,905 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 19:34:18,905 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:34:18,905 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 19:34:18,905 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 19:34:18,905 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/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 -> 51c8aa06605a84d150023e13a78c11a7b0faebf4 [2018-10-26 19:34:18,950 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:34:18,962 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:34:18,968 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:34:18,969 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:34:18,969 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:34:18,970 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-10-26 19:34:19,015 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/data/cdd621db0/81f55e55d9de48579d930da50005bda0/FLAGccdd737c4 [2018-10-26 19:34:19,446 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:34:19,446 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-10-26 19:34:19,456 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/data/cdd621db0/81f55e55d9de48579d930da50005bda0/FLAGccdd737c4 [2018-10-26 19:34:19,467 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/data/cdd621db0/81f55e55d9de48579d930da50005bda0 [2018-10-26 19:34:19,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:34:19,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 19:34:19,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:34:19,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:34:19,475 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:34:19,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:34:19" (1/1) ... [2018-10-26 19:34:19,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab0f08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:19, skipping insertion in model container [2018-10-26 19:34:19,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:34:19" (1/1) ... [2018-10-26 19:34:19,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:34:19,522 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:34:19,801 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:34:19,812 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:34:19,848 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:34:19,889 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:34:19,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:19 WrapperNode [2018-10-26 19:34:19,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:34:19,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:34:19,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:34:19,891 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:34:19,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:19" (1/1) ... [2018-10-26 19:34:19,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:19" (1/1) ... [2018-10-26 19:34:19,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:34:19,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:34:19,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:34:19,938 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:34:19,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:19" (1/1) ... [2018-10-26 19:34:19,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:19" (1/1) ... [2018-10-26 19:34:19,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:19" (1/1) ... [2018-10-26 19:34:19,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:19" (1/1) ... [2018-10-26 19:34:20,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:19" (1/1) ... [2018-10-26 19:34:20,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:19" (1/1) ... [2018-10-26 19:34:20,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:19" (1/1) ... [2018-10-26 19:34:20,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:34:20,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:34:20,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:34:20,051 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:34:20,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/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-10-26 19:34:20,106 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-10-26 19:34:20,106 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-10-26 19:34:20,106 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:34:20,107 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-10-26 19:34:20,107 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-10-26 19:34:20,107 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-10-26 19:34:20,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:34:20,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:34:20,107 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:34:20,107 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:34:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_remove_last [2018-10-26 19:34:20,108 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_remove_last [2018-10-26 19:34:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:34:20,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:34:20,706 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:34:20,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:34:20 BoogieIcfgContainer [2018-10-26 19:34:20,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:34:20,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:34:20,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:34:20,711 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:34:20,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:34:19" (1/3) ... [2018-10-26 19:34:20,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23973315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:34:20, skipping insertion in model container [2018-10-26 19:34:20,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:19" (2/3) ... [2018-10-26 19:34:20,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23973315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:34:20, skipping insertion in model container [2018-10-26 19:34:20,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:34:20" (3/3) ... [2018-10-26 19:34:20,714 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-10-26 19:34:20,723 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:34:20,732 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:34:20,746 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:34:20,774 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:34:20,775 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:34:20,775 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:34:20,775 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:34:20,775 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:34:20,775 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:34:20,775 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:34:20,775 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:34:20,776 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:34:20,787 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-10-26 19:34:20,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 19:34:20,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:34:20,793 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:34:20,795 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:34:20,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:34:20,799 INFO L82 PathProgramCache]: Analyzing trace with hash -613250840, now seen corresponding path program 1 times [2018-10-26 19:34:20,802 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:34:20,802 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:34:20,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:34:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:34:20,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:34:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:34:20,914 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 19:34:20,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:34:20,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:34:20,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 19:34:20,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 19:34:20,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 19:34:20,935 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-10-26 19:34:20,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:34:20,953 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-10-26 19:34:20,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 19:34:20,955 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-10-26 19:34:20,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:34:20,962 INFO L225 Difference]: With dead ends: 64 [2018-10-26 19:34:20,965 INFO L226 Difference]: Without dead ends: 37 [2018-10-26 19:34:20,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 19:34:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-26 19:34:21,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-26 19:34:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-26 19:34:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-10-26 19:34:21,030 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 24 [2018-10-26 19:34:21,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:34:21,031 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-10-26 19:34:21,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 19:34:21,032 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-10-26 19:34:21,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 19:34:21,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:34:21,034 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:34:21,034 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:34:21,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:34:21,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1120811875, now seen corresponding path program 1 times [2018-10-26 19:34:21,035 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:34:21,035 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:34:21,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:34:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:34:21,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:34:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:34:21,230 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 19:34:21,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:34:21,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 19:34:21,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:34:21,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:34:21,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:34:21,239 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2018-10-26 19:34:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:34:21,323 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-10-26 19:34:21,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:34:21,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-10-26 19:34:21,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:34:21,324 INFO L225 Difference]: With dead ends: 59 [2018-10-26 19:34:21,325 INFO L226 Difference]: Without dead ends: 43 [2018-10-26 19:34:21,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:34:21,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-26 19:34:21,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-10-26 19:34:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-26 19:34:21,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-10-26 19:34:21,334 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2018-10-26 19:34:21,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:34:21,334 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-10-26 19:34:21,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:34:21,334 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-10-26 19:34:21,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 19:34:21,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:34:21,335 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:34:21,335 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:34:21,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:34:21,336 INFO L82 PathProgramCache]: Analyzing trace with hash -10678655, now seen corresponding path program 1 times [2018-10-26 19:34:21,337 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:34:21,338 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:34:21,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:34:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:34:21,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:34:21,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:34:21,547 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 19:34:21,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:34:21,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:34:21,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:34:21,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:34:21,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:34:21,554 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2018-10-26 19:34:21,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:34:21,604 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-10-26 19:34:21,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:34:21,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-10-26 19:34:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:34:21,606 INFO L225 Difference]: With dead ends: 47 [2018-10-26 19:34:21,606 INFO L226 Difference]: Without dead ends: 43 [2018-10-26 19:34:21,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:34:21,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-26 19:34:21,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-10-26 19:34:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-26 19:34:21,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-10-26 19:34:21,613 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 37 [2018-10-26 19:34:21,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:34:21,614 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-10-26 19:34:21,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:34:21,614 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-10-26 19:34:21,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 19:34:21,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:34:21,615 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:34:21,616 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:34:21,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:34:21,616 INFO L82 PathProgramCache]: Analyzing trace with hash 204905672, now seen corresponding path program 1 times [2018-10-26 19:34:21,618 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:34:21,618 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:34:21,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:34:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:34:21,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:34:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:34:22,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:34:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:34:22,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:34:22,329 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/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-10-26 19:34:22,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:34:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:34:22,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:34:22,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:34:22,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:34:22,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:22,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:22,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:34:22,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:34:22,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:22,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:22,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:22,688 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-10-26 19:34:22,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 19:34:22,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 19:34:22,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:22,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:22,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 19:34:22,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 19:34:22,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:22,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:22,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:22,855 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-10-26 19:34:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:34:22,905 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 19:34:22,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:34:22,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 5] total 12 [2018-10-26 19:34:22,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 19:34:22,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 19:34:22,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-10-26 19:34:22,932 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 12 states. [2018-10-26 19:34:23,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:34:23,699 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2018-10-26 19:34:23,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 19:34:23,700 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-10-26 19:34:23,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:34:23,703 INFO L225 Difference]: With dead ends: 66 [2018-10-26 19:34:23,703 INFO L226 Difference]: Without dead ends: 60 [2018-10-26 19:34:23,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-10-26 19:34:23,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-26 19:34:23,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 47. [2018-10-26 19:34:23,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-26 19:34:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-10-26 19:34:23,713 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 45 [2018-10-26 19:34:23,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:34:23,713 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-10-26 19:34:23,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 19:34:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-10-26 19:34:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-26 19:34:23,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:34:23,715 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:34:23,715 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:34:23,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:34:23,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1831195153, now seen corresponding path program 1 times [2018-10-26 19:34:23,716 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:34:23,716 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:34:23,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:34:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:34:24,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:34:24,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-26 19:34:24,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:24,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:24,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 19:34:24,198 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:24,199 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:24,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-10-26 19:34:24,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:24,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:24,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-10-26 19:34:24,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 19:34:24,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 19:34:24,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:24,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:24,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:24,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-10-26 19:34:24,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:34:24,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:34:24,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:24,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:24,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 32 [2018-10-26 19:34:24,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-10-26 19:34:24,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:24,651 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:24,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:24,661 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-26 19:34:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 19:34:24,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:34:25,664 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-10-26 19:34:25,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-10-26 19:34:25,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:25,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-10-26 19:34:25,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-26 19:34:25,872 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:25,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-10-26 19:34:25,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-26 19:34:25,886 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:25,888 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:25,892 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:25,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:25,898 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:42, output treesize:6 [2018-10-26 19:34:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 19:34:26,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:34:26,440 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/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-10-26 19:34:26,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:34:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:34:26,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:34:26,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:34:26,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:34:26,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:26,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:26,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:34:26,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:34:26,799 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:26,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:26,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:26,805 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-10-26 19:34:27,004 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_circular_remove_last_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|dll_circular_remove_last_write~$Pointer$_#ptr.base| (_ BitVec 32)) (dll_circular_remove_last_~snd_to_last~0.base (_ BitVec 32)) (dll_circular_remove_last_~snd_to_last~0.offset (_ BitVec 32))) (let ((.cse1 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|)) (.cse2 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| .cse1 (store (select |c_old(#memory_$Pointer$.base)| .cse1) .cse2 dll_circular_remove_last_~snd_to_last~0.base)))) (store .cse0 |dll_circular_remove_last_write~$Pointer$_#ptr.base| (store (select .cse0 |dll_circular_remove_last_write~$Pointer$_#ptr.base|) |dll_circular_remove_last_write~$Pointer$_#ptr.offset| (select (select .cse0 |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))))) (= (let ((.cse3 (store |c_old(#memory_$Pointer$.offset)| .cse1 (store (select |c_old(#memory_$Pointer$.offset)| .cse1) .cse2 dll_circular_remove_last_~snd_to_last~0.offset)))) (store .cse3 |dll_circular_remove_last_write~$Pointer$_#ptr.base| (store (select .cse3 |dll_circular_remove_last_write~$Pointer$_#ptr.base|) |dll_circular_remove_last_write~$Pointer$_#ptr.offset| (select (select .cse3 |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|)))) |c_#memory_$Pointer$.offset|)))) is different from true [2018-10-26 19:34:27,444 WARN L179 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2018-10-26 19:34:27,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 104 [2018-10-26 19:34:27,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-26 19:34:27,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:27,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 116 [2018-10-26 19:34:27,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 103 [2018-10-26 19:34:27,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:28,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 104 [2018-10-26 19:34:28,480 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-26 19:34:28,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:34:28,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:34:28,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 79 [2018-10-26 19:34:28,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-26 19:34:28,858 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:28,897 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:34:28,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 59 [2018-10-26 19:34:28,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-10-26 19:34:28,920 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:28,929 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:28,942 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:28,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 80 [2018-10-26 19:34:28,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-26 19:34:28,981 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:29,106 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:29,161 INFO L477 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 6 case distinctions, treesize of input 53 treesize of output 90 [2018-10-26 19:34:29,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-10-26 19:34:29,190 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:29,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 62 [2018-10-26 19:34:29,595 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-10-26 19:34:29,663 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:34:29,709 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:34:29,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-26 19:34:29,773 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:181, output treesize:99 [2018-10-26 19:34:29,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 19:34:29,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 19:34:29,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:29,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:29,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 19:34:29,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 19:34:29,927 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:29,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:29,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:29,937 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7 [2018-10-26 19:34:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2018-10-26 19:34:29,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:34:30,303 WARN L179 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-26 19:34:30,538 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-26 19:34:30,901 WARN L179 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-10-26 19:34:31,320 WARN L179 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-10-26 19:34:31,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 19:34:31,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 10] total 34 [2018-10-26 19:34:31,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-26 19:34:31,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-26 19:34:31,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1096, Unknown=8, NotChecked=66, Total=1260 [2018-10-26 19:34:31,553 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 34 states. [2018-10-26 19:34:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:34:37,012 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2018-10-26 19:34:37,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-26 19:34:37,012 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 53 [2018-10-26 19:34:37,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:34:37,013 INFO L225 Difference]: With dead ends: 81 [2018-10-26 19:34:37,013 INFO L226 Difference]: Without dead ends: 49 [2018-10-26 19:34:37,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 129 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=267, Invalid=2867, Unknown=62, NotChecked=110, Total=3306 [2018-10-26 19:34:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-26 19:34:37,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-10-26 19:34:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-26 19:34:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-10-26 19:34:37,023 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 53 [2018-10-26 19:34:37,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:34:37,023 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-10-26 19:34:37,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-26 19:34:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-10-26 19:34:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-26 19:34:37,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:34:37,027 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:34:37,027 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:34:37,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:34:37,028 INFO L82 PathProgramCache]: Analyzing trace with hash 242847251, now seen corresponding path program 1 times [2018-10-26 19:34:37,028 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:34:37,028 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:34:37,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:34:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:34:37,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:34:37,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-26 19:34:37,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:37,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:37,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 19:34:37,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:34:37,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:34:37,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:37,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:37,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:34:37,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:34:37,861 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:37,866 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:37,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:37,877 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-10-26 19:34:37,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-10-26 19:34:38,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-10-26 19:34:38,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:38,064 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:38,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-10-26 19:34:38,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-26 19:34:38,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:38,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:38,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:38,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2018-10-26 19:34:38,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-10-26 19:34:38,156 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:38,170 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:38,174 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:38,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-10-26 19:34:38,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-10-26 19:34:38,181 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:38,193 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:38,203 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:38,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:38,226 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:89, output treesize:100 [2018-10-26 19:34:38,360 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:38,361 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:38,362 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:38,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-10-26 19:34:38,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:38,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:38,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:92, output treesize:86 [2018-10-26 19:34:38,494 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 82 [2018-10-26 19:34:38,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:34:38,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:38,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:38,552 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:38,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 91 [2018-10-26 19:34:38,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:34:38,585 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:38,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:38,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:38,914 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:138 [2018-10-26 19:34:39,165 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse0 (exists ((|dll_circular_remove_last_write~$Pointer$_#value.base| (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (let ((.cse17 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse18 (select |c_old(#memory_$Pointer$.base)| .cse17)) (.cse19 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (let ((.cse15 (select .cse18 .cse19)) (.cse16 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| .cse17) .cse19) (_ bv4 32)))) (let ((.cse14 (select (select |c_old(#memory_$Pointer$.base)| .cse15) .cse16))) (let ((.cse13 (store |c_old(#memory_$Pointer$.base)| .cse17 (store .cse18 .cse19 .cse14)))) (store .cse13 .cse14 (store (select .cse13 .cse14) (select (select |c_old(#memory_$Pointer$.offset)| .cse15) .cse16) |dll_circular_remove_last_write~$Pointer$_#value.base|)))))))))) (.cse2 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|)) (.cse3 (bvadd .cse4 (_ bv4 32))) (.cse1 (exists ((|dll_circular_remove_last_write~$Pointer$_#value.offset| (_ BitVec 32))) (= (let ((.cse10 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse11 (select |c_old(#memory_$Pointer$.offset)| .cse10)) (.cse12 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (let ((.cse8 (select (select |c_old(#memory_$Pointer$.base)| .cse10) .cse12)) (.cse9 (bvadd (select .cse11 .cse12) (_ bv4 32)))) (let ((.cse7 (select (select |c_old(#memory_$Pointer$.offset)| .cse8) .cse9))) (let ((.cse5 (store |c_old(#memory_$Pointer$.offset)| .cse10 (store .cse11 .cse12 .cse7))) (.cse6 (select (select |c_old(#memory_$Pointer$.base)| .cse8) .cse9))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 |dll_circular_remove_last_write~$Pointer$_#value.offset|))))))) |c_#memory_$Pointer$.offset|)))) (or (and .cse0 .cse1 (not (= (select (select |c_old(#memory_$Pointer$.offset)| .cse2) .cse3) .cse4))) (and .cse0 (not (= .cse2 (select (select |c_old(#memory_$Pointer$.base)| .cse2) .cse3))) .cse1)))) is different from true [2018-10-26 19:34:39,221 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse32 (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse7 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|)) (.cse8 (bvadd .cse32 (_ bv4 32)))) (or (and (exists ((v_prenex_7 (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (let ((.cse4 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse5 (select |c_old(#memory_$Pointer$.base)| .cse4)) (.cse6 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (let ((.cse2 (select .cse5 .cse6)) (.cse3 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| .cse4) .cse6) (_ bv4 32)))) (let ((.cse1 (select (select |c_old(#memory_$Pointer$.base)| .cse2) .cse3))) (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| .cse4 (store .cse5 .cse6 .cse1)))) (store .cse0 .cse1 (store (select .cse0 .cse1) (select (select |c_old(#memory_$Pointer$.offset)| .cse2) .cse3) v_prenex_7))))))))) (not (= .cse7 (select (select |c_old(#memory_$Pointer$.base)| .cse7) .cse8))) (exists ((v_prenex_6 (_ BitVec 32))) (= (let ((.cse14 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse15 (select |c_old(#memory_$Pointer$.offset)| .cse14)) (.cse16 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (let ((.cse12 (select (select |c_old(#memory_$Pointer$.base)| .cse14) .cse16)) (.cse13 (bvadd (select .cse15 .cse16) (_ bv4 32)))) (let ((.cse11 (select (select |c_old(#memory_$Pointer$.offset)| .cse12) .cse13))) (let ((.cse9 (store |c_old(#memory_$Pointer$.offset)| .cse14 (store .cse15 .cse16 .cse11))) (.cse10 (select (select |c_old(#memory_$Pointer$.base)| .cse12) .cse13))) (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 v_prenex_6))))))) |c_#memory_$Pointer$.offset|))) (and (exists ((|dll_circular_remove_last_write~$Pointer$_#value.base| (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (let ((.cse21 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse22 (select |c_old(#memory_$Pointer$.base)| .cse21)) (.cse23 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (let ((.cse19 (select .cse22 .cse23)) (.cse20 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| .cse21) .cse23) (_ bv4 32)))) (let ((.cse18 (select (select |c_old(#memory_$Pointer$.base)| .cse19) .cse20))) (let ((.cse17 (store |c_old(#memory_$Pointer$.base)| .cse21 (store .cse22 .cse23 .cse18)))) (store .cse17 .cse18 (store (select .cse17 .cse18) (select (select |c_old(#memory_$Pointer$.offset)| .cse19) .cse20) |dll_circular_remove_last_write~$Pointer$_#value.base|))))))))) (exists ((|dll_circular_remove_last_write~$Pointer$_#value.offset| (_ BitVec 32))) (= (let ((.cse29 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse30 (select |c_old(#memory_$Pointer$.offset)| .cse29)) (.cse31 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (let ((.cse27 (select (select |c_old(#memory_$Pointer$.base)| .cse29) .cse31)) (.cse28 (bvadd (select .cse30 .cse31) (_ bv4 32)))) (let ((.cse26 (select (select |c_old(#memory_$Pointer$.offset)| .cse27) .cse28))) (let ((.cse24 (store |c_old(#memory_$Pointer$.offset)| .cse29 (store .cse30 .cse31 .cse26))) (.cse25 (select (select |c_old(#memory_$Pointer$.base)| .cse27) .cse28))) (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 |dll_circular_remove_last_write~$Pointer$_#value.offset|))))))) |c_#memory_$Pointer$.offset|)) (not (= (select (select |c_old(#memory_$Pointer$.offset)| .cse7) .cse8) .cse32)))))) is different from true [2018-10-26 19:34:39,242 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-26 19:34:39,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:39,612 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:39,612 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:34:39,738 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:34:39,860 INFO L303 Elim1Store]: Index analysis took 266 ms [2018-10-26 19:34:39,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 507 treesize of output 498 [2018-10-26 19:34:39,867 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:34:39,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 365 treesize of output 260 [2018-10-26 19:34:39,868 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:39,953 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:39,956 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:39,959 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:39,960 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:34:40,011 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 353 [2018-10-26 19:34:40,019 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:40,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 91 [2018-10-26 19:34:40,023 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:40,100 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:40,159 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:40,281 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:34:40,284 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:40,290 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:40,318 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:40,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 316 treesize of output 201 [2018-10-26 19:34:40,349 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:34:40,422 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 251 treesize of output 189 [2018-10-26 19:34:40,426 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-10-26 19:34:41,237 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:41,241 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:41,284 INFO L477 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 0 case distinctions, treesize of input 257 treesize of output 162 [2018-10-26 19:34:41,291 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:41,303 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:41,307 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:41,313 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:41,382 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 160 treesize of output 223 [2018-10-26 19:34:41,390 INFO L267 ElimStorePlain]: Start of recursive call 10: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-10-26 19:34:41,808 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-10-26 19:34:41,825 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:41,828 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:41,862 INFO L477 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 145 treesize of output 151 [2018-10-26 19:34:41,871 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:41,878 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:41,880 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:41,949 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 163 [2018-10-26 19:34:41,953 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-10-26 19:34:42,074 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:34:42,326 INFO L303 Elim1Store]: Index analysis took 251 ms [2018-10-26 19:34:42,327 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 127 [2018-10-26 19:34:42,366 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:34:42,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2018-10-26 19:34:42,389 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-26 19:34:42,487 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:34:43,241 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 7 xjuncts. [2018-10-26 19:34:44,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 9 dim-0 vars, and 7 xjuncts. [2018-10-26 19:34:44,647 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:1221, output treesize:954 [2018-10-26 19:34:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-10-26 19:34:45,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:34:46,815 WARN L179 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-10-26 19:34:47,194 WARN L179 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-10-26 19:34:47,687 WARN L179 SmtUtils]: Spent 492.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-10-26 19:34:48,209 WARN L179 SmtUtils]: Spent 520.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-10-26 19:35:06,477 WARN L179 SmtUtils]: Spent 16.00 s on a formula simplification that was a NOOP. DAG size: 62 [2018-10-26 19:35:06,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:35:06,479 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:35:06,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:35:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:35:06,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:35:06,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-26 19:35:06,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:35:06,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:35:06,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 19:35:06,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:35:06,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:35:06,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:35:06,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:35:06,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:35:06,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:35:06,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:35:06,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:35:06,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:35:06,643 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-10-26 19:35:06,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-10-26 19:35:06,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-10-26 19:35:06,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:35:06,742 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:06,764 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:06,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2018-10-26 19:35:06,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-10-26 19:35:06,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:35:06,789 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:35:06,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:35:06,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-10-26 19:35:06,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-10-26 19:35:06,874 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:35:06,937 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:06,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 51 [2018-10-26 19:35:06,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-26 19:35:06,950 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 19:35:06,961 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:35:06,970 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:35:06,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:35:06,995 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:89, output treesize:100 [2018-10-26 19:35:07,033 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:07,034 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:07,035 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:07,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-26 19:35:07,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:35:07,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:35:07,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:94, output treesize:86 [2018-10-26 19:35:07,092 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 82 [2018-10-26 19:35:07,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:35:07,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:35:07,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:35:07,156 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:07,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 91 [2018-10-26 19:35:07,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:35:07,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:35:07,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:35:07,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:35:07,228 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:138 [2018-10-26 19:35:07,248 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse32 (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse15 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|)) (.cse16 (bvadd .cse32 (_ bv4 32)))) (or (and (exists ((v_prenex_26 (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (let ((.cse4 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse5 (select |c_old(#memory_$Pointer$.base)| .cse4)) (.cse6 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (let ((.cse2 (select .cse5 .cse6)) (.cse3 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| .cse4) .cse6) (_ bv4 32)))) (let ((.cse1 (select (select |c_old(#memory_$Pointer$.base)| .cse2) .cse3))) (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| .cse4 (store .cse5 .cse6 .cse1)))) (store .cse0 .cse1 (store (select .cse0 .cse1) (select (select |c_old(#memory_$Pointer$.offset)| .cse2) .cse3) v_prenex_26))))))))) (exists ((v_prenex_25 (_ BitVec 32))) (= (let ((.cse12 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse13 (select |c_old(#memory_$Pointer$.offset)| .cse12)) (.cse14 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (let ((.cse10 (select (select |c_old(#memory_$Pointer$.base)| .cse12) .cse14)) (.cse11 (bvadd (select .cse13 .cse14) (_ bv4 32)))) (let ((.cse9 (select (select |c_old(#memory_$Pointer$.offset)| .cse10) .cse11))) (let ((.cse7 (store |c_old(#memory_$Pointer$.offset)| .cse12 (store .cse13 .cse14 .cse9))) (.cse8 (select (select |c_old(#memory_$Pointer$.base)| .cse10) .cse11))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 v_prenex_25))))))) |c_#memory_$Pointer$.offset|)) (not (= .cse15 (select (select |c_old(#memory_$Pointer$.base)| .cse15) .cse16)))) (and (exists ((|dll_circular_remove_last_write~$Pointer$_#value.base| (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (let ((.cse21 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse22 (select |c_old(#memory_$Pointer$.base)| .cse21)) (.cse23 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (let ((.cse19 (select .cse22 .cse23)) (.cse20 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| .cse21) .cse23) (_ bv4 32)))) (let ((.cse18 (select (select |c_old(#memory_$Pointer$.base)| .cse19) .cse20))) (let ((.cse17 (store |c_old(#memory_$Pointer$.base)| .cse21 (store .cse22 .cse23 .cse18)))) (store .cse17 .cse18 (store (select .cse17 .cse18) (select (select |c_old(#memory_$Pointer$.offset)| .cse19) .cse20) |dll_circular_remove_last_write~$Pointer$_#value.base|))))))))) (exists ((|dll_circular_remove_last_write~$Pointer$_#value.offset| (_ BitVec 32))) (= (let ((.cse29 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse30 (select |c_old(#memory_$Pointer$.offset)| .cse29)) (.cse31 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (let ((.cse27 (select (select |c_old(#memory_$Pointer$.base)| .cse29) .cse31)) (.cse28 (bvadd (select .cse30 .cse31) (_ bv4 32)))) (let ((.cse26 (select (select |c_old(#memory_$Pointer$.offset)| .cse27) .cse28))) (let ((.cse24 (store |c_old(#memory_$Pointer$.offset)| .cse29 (store .cse30 .cse31 .cse26))) (.cse25 (select (select |c_old(#memory_$Pointer$.base)| .cse27) .cse28))) (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 |dll_circular_remove_last_write~$Pointer$_#value.offset|))))))) |c_#memory_$Pointer$.offset|)) (not (= (select (select |c_old(#memory_$Pointer$.offset)| .cse15) .cse16) .cse32)))))) is different from true [2018-10-26 19:35:07,273 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:35:07,464 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:35:07,501 INFO L303 Elim1Store]: Index analysis took 245 ms [2018-10-26 19:35:07,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 610 treesize of output 567 [2018-10-26 19:35:07,510 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:35:07,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 357 treesize of output 252 [2018-10-26 19:35:07,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:35:07,698 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:07,706 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:07,706 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:35:07,823 INFO L303 Elim1Store]: Index analysis took 133 ms [2018-10-26 19:35:07,824 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 317 [2018-10-26 19:35:07,830 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:07,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 75 [2018-10-26 19:35:07,834 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:35:07,892 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:35:07,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:35:09,235 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:35:09,239 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:09,246 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:09,290 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:09,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 300 treesize of output 213 [2018-10-26 19:35:09,315 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:35:09,385 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 211 treesize of output 189 [2018-10-26 19:35:09,388 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-10-26 19:35:10,249 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:10,278 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 149 [2018-10-26 19:35:10,285 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:10,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2018-10-26 19:35:10,290 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 19:35:10,330 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:35:10,336 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:10,337 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:10,365 INFO L477 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 0 case distinctions, treesize of input 241 treesize of output 162 [2018-10-26 19:35:10,385 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:10,387 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:10,390 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:10,401 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:10,468 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 156 treesize of output 265 [2018-10-26 19:35:10,474 INFO L267 ElimStorePlain]: Start of recursive call 11: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-10-26 19:35:10,915 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-10-26 19:35:10,935 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:10,938 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:10,963 INFO L477 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 145 treesize of output 151 [2018-10-26 19:35:10,989 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:10,992 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:10,996 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:35:11,101 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 163 [2018-10-26 19:35:11,104 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-10-26 19:35:11,237 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:35:11,957 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 7 xjuncts. [2018-10-26 19:35:14,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 9 dim-0 vars, and 7 xjuncts. [2018-10-26 19:35:14,427 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:1221, output treesize:956 [2018-10-26 19:35:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-10-26 19:35:14,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:35:15,066 WARN L179 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-26 19:35:15,281 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-26 19:35:15,621 WARN L179 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-26 19:35:15,926 WARN L179 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-10-26 19:35:16,869 WARN L179 SmtUtils]: Spent 938.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-10-26 19:35:17,270 WARN L179 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-10-26 19:35:17,867 WARN L179 SmtUtils]: Spent 596.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-10-26 19:35:18,468 WARN L179 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-10-26 19:35:18,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:35:18,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-10-26 19:35:18,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-26 19:35:18,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-26 19:35:18,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=588, Unknown=5, NotChecked=150, Total=812 [2018-10-26 19:35:18,729 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 25 states. [2018-10-26 19:35:20,035 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-10-26 19:35:21,436 WARN L179 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-10-26 19:35:22,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:35:22,174 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2018-10-26 19:35:22,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-26 19:35:22,174 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 53 [2018-10-26 19:35:22,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:35:22,175 INFO L225 Difference]: With dead ends: 78 [2018-10-26 19:35:22,175 INFO L226 Difference]: Without dead ends: 53 [2018-10-26 19:35:22,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=139, Invalid=1197, Unknown=8, NotChecked=216, Total=1560 [2018-10-26 19:35:22,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-26 19:35:22,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-10-26 19:35:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-26 19:35:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-10-26 19:35:22,185 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 53 [2018-10-26 19:35:22,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:35:22,185 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-10-26 19:35:22,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-26 19:35:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-10-26 19:35:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-26 19:35:22,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:35:22,186 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:35:22,186 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:35:22,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:35:22,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1629050645, now seen corresponding path program 1 times [2018-10-26 19:35:22,187 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:35:22,187 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:35:22,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:35:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:35:22,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:35:22,293 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 19:35:22,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:35:22,391 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 19:35:22,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:35:22,393 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:35:22,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:35:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:35:22,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:35:22,460 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 19:35:22,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:35:22,644 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 19:35:22,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 19:35:22,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 6 [2018-10-26 19:35:22,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:35:22,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:35:22,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:35:22,661 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 6 states. [2018-10-26 19:35:22,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:35:22,742 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-10-26 19:35:22,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 19:35:22,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-10-26 19:35:22,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:35:22,746 INFO L225 Difference]: With dead ends: 84 [2018-10-26 19:35:22,746 INFO L226 Difference]: Without dead ends: 51 [2018-10-26 19:35:22,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:35:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-26 19:35:22,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-26 19:35:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-26 19:35:22,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-10-26 19:35:22,754 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 53 [2018-10-26 19:35:22,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:35:22,754 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-10-26 19:35:22,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:35:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-10-26 19:35:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-26 19:35:22,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:35:22,755 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:35:22,755 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:35:22,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:35:22,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1790818357, now seen corresponding path program 2 times [2018-10-26 19:35:22,756 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:35:22,756 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:35:22,775 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-10-26 19:35:23,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 19:35:23,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:35:23,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:35:23,124 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-26 19:35:23,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:35:23,227 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-26 19:35:23,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:35:23,229 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:35:23,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 19:35:24,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 19:35:24,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:35:24,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:35:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-26 19:35:24,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:35:24,197 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-26 19:35:24,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 19:35:24,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-10-26 19:35:24,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 19:35:24,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 19:35:24,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-26 19:35:24,217 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 9 states. [2018-10-26 19:35:24,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:35:24,283 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-10-26 19:35:24,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 19:35:24,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-10-26 19:35:24,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:35:24,284 INFO L225 Difference]: With dead ends: 55 [2018-10-26 19:35:24,284 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 19:35:24,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-26 19:35:24,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 19:35:24,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 19:35:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 19:35:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 19:35:24,285 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2018-10-26 19:35:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:35:24,285 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 19:35:24,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 19:35:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 19:35:24,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 19:35:24,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 19:35:24,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:35:24,913 WARN L179 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2018-10-26 19:35:25,416 WARN L179 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2018-10-26 19:35:25,727 WARN L179 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-10-26 19:35:25,749 INFO L425 ceAbstractionStarter]: For program point L592(lines 592 600) no Hoare annotation was computed. [2018-10-26 19:35:25,749 INFO L425 ceAbstractionStarter]: For program point L592-2(lines 590 601) no Hoare annotation was computed. [2018-10-26 19:35:25,749 INFO L425 ceAbstractionStarter]: For program point dll_circular_remove_lastEXIT(lines 590 601) no Hoare annotation was computed. [2018-10-26 19:35:25,750 INFO L421 ceAbstractionStarter]: At program point dll_circular_remove_lastENTRY(lines 590 601) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-10-26 19:35:25,750 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 561 563) no Hoare annotation was computed. [2018-10-26 19:35:25,750 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 561 563) the Hoare annotation is: true [2018-10-26 19:35:25,750 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 561 563) no Hoare annotation was computed. [2018-10-26 19:35:25,750 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-26 19:35:25,750 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 19:35:25,750 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-10-26 19:35:25,750 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:35:25,750 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:35:25,750 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 19:35:25,750 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 19:35:25,750 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 19:35:25,750 INFO L425 ceAbstractionStarter]: For program point L607-1(lines 607 609) no Hoare annotation was computed. [2018-10-26 19:35:25,751 INFO L421 ceAbstractionStarter]: At program point L605(line 605) the Hoare annotation is: (and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (not (= |main_~#s~0.base| (_ bv0 32))) (= |main_~#s~0.offset| (_ bv0 32)) (forall ((|v_node_create_#Ultimate.alloc_#res.base_25| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_node_create_#Ultimate.alloc_#res.base_25|))) (not (= (select |#valid| |v_node_create_#Ultimate.alloc_#res.base_25|) (_ bv0 1))))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-10-26 19:35:25,751 INFO L425 ceAbstractionStarter]: For program point L605-1(line 605) no Hoare annotation was computed. [2018-10-26 19:35:25,751 INFO L421 ceAbstractionStarter]: At program point L607-3(lines 607 609) the Hoare annotation is: (let ((.cse16 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse7 (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32))) (.cse11 (= (_ bv0 32) .cse16)) (.cse13 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))) (let ((.cse9 (or (and .cse13 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse7 .cse11 .cse13))) (.cse0 (not (= |main_~#s~0.base| (_ bv0 32)))) (.cse8 (= |main_~#s~0.offset| (_ bv0 32))) (.cse10 (not (= |main_~#s~0.base| .cse16)))) (or (and .cse0 (exists ((v_arrayElimCell_37 (_ BitVec 32))) (let ((.cse6 (select |#memory_$Pointer$.base| v_arrayElimCell_37)) (.cse1 (select |#memory_$Pointer$.offset| v_arrayElimCell_37))) (let ((.cse3 (select .cse1 (_ bv4 32))) (.cse4 (select .cse6 (_ bv4 32))) (.cse5 (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (.cse2 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= (select .cse1 (_ bv0 32)) (_ bv0 32)) (not (= .cse2 v_arrayElimCell_37)) (= .cse3 (_ bv0 32)) (= .cse3 (select (select |#memory_$Pointer$.offset| .cse4) .cse5)) (= .cse4 .cse2) (= .cse4 (select (select |#memory_$Pointer$.base| .cse2) .cse5)) (= (select .cse6 (_ bv0 32)) .cse2) (not (= |main_~#s~0.base| v_arrayElimCell_37)))))) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse9) (let ((.cse18 (select |#memory_$Pointer$.base| .cse16))) (let ((.cse12 (select .cse18 (_ bv4 32)))) (let ((.cse15 (select |#memory_$Pointer$.base| .cse12))) (let ((.cse14 (select |#memory_$Pointer$.offset| .cse12)) (.cse17 (select .cse15 (_ bv4 32)))) (and (not (= .cse12 |main_~#s~0.base|)) .cse7 (forall ((|v_node_create_#Ultimate.alloc_#res.base_25| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_node_create_#Ultimate.alloc_#res.base_25|))) (not (= (select |#valid| |v_node_create_#Ultimate.alloc_#res.base_25|) (_ bv0 1))))) (= main_~i~0 (_ bv0 32)) .cse13 (= (_ bv0 32) (select .cse14 (_ bv4 32))) (= (select .cse15 (_ bv0 32)) .cse16) (= (_ bv0 32) (select .cse14 (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| .cse17) (_ bv4 32)) (_ bv0 32)) (= .cse17 .cse16) .cse0 .cse8 (not (= .cse15 .cse18)) .cse10))))))))) [2018-10-26 19:35:25,751 INFO L425 ceAbstractionStarter]: For program point L607-4(lines 607 609) no Hoare annotation was computed. [2018-10-26 19:35:25,751 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 602 616) no Hoare annotation was computed. [2018-10-26 19:35:25,751 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 602 616) no Hoare annotation was computed. [2018-10-26 19:35:25,751 INFO L425 ceAbstractionStarter]: For program point L610(lines 610 612) no Hoare annotation was computed. [2018-10-26 19:35:25,768 INFO L421 ceAbstractionStarter]: At program point L608(line 608) the Hoare annotation is: (let ((.cse11 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse13 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))) (let ((.cse10 (and .cse13 (bvslt main_~i~0 main_~len~0))) (.cse7 (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32))) (.cse0 (not (= |main_~#s~0.base| (_ bv0 32)))) (.cse8 (= |main_~#s~0.offset| (_ bv0 32))) (.cse9 (not (= |main_~#s~0.base| .cse11)))) (or (and .cse0 (exists ((v_arrayElimCell_37 (_ BitVec 32))) (let ((.cse6 (select |#memory_$Pointer$.base| v_arrayElimCell_37)) (.cse1 (select |#memory_$Pointer$.offset| v_arrayElimCell_37))) (let ((.cse3 (select .cse1 (_ bv4 32))) (.cse4 (select .cse6 (_ bv4 32))) (.cse5 (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (.cse2 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= (select .cse1 (_ bv0 32)) (_ bv0 32)) (not (= .cse2 v_arrayElimCell_37)) (= .cse3 (_ bv0 32)) (= .cse3 (select (select |#memory_$Pointer$.offset| .cse4) .cse5)) (= .cse4 .cse2) (= .cse4 (select (select |#memory_$Pointer$.base| .cse2) .cse5)) (= (select .cse6 (_ bv0 32)) .cse2) (not (= |main_~#s~0.base| v_arrayElimCell_37)))))) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse7 .cse8 (= (_ bv0 32) .cse11) .cse10) (let ((.cse17 (select |#memory_$Pointer$.base| .cse11))) (let ((.cse12 (select .cse17 (_ bv4 32)))) (let ((.cse15 (select |#memory_$Pointer$.base| .cse12))) (let ((.cse14 (select |#memory_$Pointer$.offset| .cse12)) (.cse16 (select .cse15 (_ bv4 32)))) (and (not (= .cse12 |main_~#s~0.base|)) .cse7 (forall ((|v_node_create_#Ultimate.alloc_#res.base_25| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_node_create_#Ultimate.alloc_#res.base_25|))) (not (= (select |#valid| |v_node_create_#Ultimate.alloc_#res.base_25|) (_ bv0 1))))) (= main_~i~0 (_ bv0 32)) .cse13 (= (_ bv0 32) (select .cse14 (_ bv4 32))) (= (select .cse15 (_ bv0 32)) .cse11) (= (_ bv0 32) (select .cse14 (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| .cse16) (_ bv4 32)) (_ bv0 32)) (= .cse16 .cse11) .cse0 .cse8 (not (= .cse15 .cse17)) .cse9)))))))) [2018-10-26 19:35:25,768 INFO L425 ceAbstractionStarter]: For program point L608-1(lines 607 609) no Hoare annotation was computed. [2018-10-26 19:35:25,768 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 602 616) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-10-26 19:35:25,769 INFO L421 ceAbstractionStarter]: At program point L611(lines 602 616) the Hoare annotation is: false [2018-10-26 19:35:25,769 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 614) no Hoare annotation was computed. [2018-10-26 19:35:25,769 INFO L425 ceAbstractionStarter]: For program point L578-1(line 578) no Hoare annotation was computed. [2018-10-26 19:35:25,769 INFO L425 ceAbstractionStarter]: For program point dll_circular_createEXIT(lines 574 589) no Hoare annotation was computed. [2018-10-26 19:35:25,769 INFO L425 ceAbstractionStarter]: For program point L577-1(lines 577 585) no Hoare annotation was computed. [2018-10-26 19:35:25,769 INFO L421 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |dll_circular_create_#in~len| dll_circular_create_~len) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-10-26 19:35:25,769 INFO L425 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-10-26 19:35:25,769 INFO L421 ceAbstractionStarter]: At program point L577-3(lines 577 585) the Hoare annotation is: (let ((.cse3 (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) (.cse1 (= (_ bv0 32) dll_circular_create_~head~0.offset)) (.cse4 (forall ((|v_node_create_#Ultimate.alloc_#res.base_25| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_node_create_#Ultimate.alloc_#res.base_25|))) (not (= (select |#valid| |v_node_create_#Ultimate.alloc_#res.base_25|) (_ bv0 1)))))) (.cse0 (bvadd |dll_circular_create_#in~len| (_ bv4294967295 32))) (.cse2 (= (_ bv0 32) dll_circular_create_~new_head~0.offset)) (.cse5 (= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1)))) (or (and (bvsgt .cse0 (_ bv1 32)) .cse1 .cse2 (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)) (not .cse3) .cse4 .cse5) (and (= (select |old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |#valid|) (not (= dll_circular_create_~head~0.base (_ bv0 32))) .cse1 (= |dll_circular_create_#in~len| dll_circular_create_~len) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) .cse3) (let ((.cse6 (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (_ bv4 32)))) (and (= dll_circular_create_~head~0.base .cse6) (= dll_circular_create_~new_head~0.base .cse6) .cse1 .cse4 (= (_ bv0 1) (select |old(#valid)| dll_circular_create_~last~0.base)) (= .cse0 dll_circular_create_~len) (= (_ bv0 32) dll_circular_create_~last~0.offset) (= (select (store |old(#valid)| dll_circular_create_~last~0.base (_ bv1 1)) dll_circular_create_~head~0.base) (_ bv0 1)) .cse2 .cse5 (= dll_circular_create_~new_head~0.offset (select (select |#memory_$Pointer$.offset| dll_circular_create_~last~0.base) (_ bv4 32))))))) [2018-10-26 19:35:25,769 INFO L425 ceAbstractionStarter]: For program point L577-4(lines 577 585) no Hoare annotation was computed. [2018-10-26 19:35:25,769 INFO L425 ceAbstractionStarter]: For program point dll_circular_createFINAL(lines 574 589) no Hoare annotation was computed. [2018-10-26 19:35:25,769 INFO L425 ceAbstractionStarter]: For program point L580(lines 580 582) no Hoare annotation was computed. [2018-10-26 19:35:25,770 INFO L421 ceAbstractionStarter]: At program point dll_circular_createENTRY(lines 574 589) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-10-26 19:35:25,770 INFO L421 ceAbstractionStarter]: At program point L578(line 578) the Hoare annotation is: (or (and (bvsgt (bvadd |dll_circular_create_#in~len| (_ bv4294967295 32)) (_ bv1 32)) (forall ((|v_node_create_#Ultimate.alloc_#res.base_25| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_node_create_#Ultimate.alloc_#res.base_25|))) (not (= (select |#valid| |v_node_create_#Ultimate.alloc_#res.base_25|) (_ bv0 1))))) (= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))) (and (= (select |old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |#valid|) (not (= dll_circular_create_~head~0.base (_ bv0 32))) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= |dll_circular_create_#in~len| dll_circular_create_~len) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))) [2018-10-26 19:35:25,770 INFO L425 ceAbstractionStarter]: For program point L580-2(lines 580 582) no Hoare annotation was computed. [2018-10-26 19:35:25,770 INFO L421 ceAbstractionStarter]: At program point node_createENTRY(lines 564 573) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-10-26 19:35:25,770 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 564 573) no Hoare annotation was computed. [2018-10-26 19:35:25,770 INFO L428 ceAbstractionStarter]: At program point L567(line 567) the Hoare annotation is: true [2018-10-26 19:35:25,770 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-10-26 19:35:25,770 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 564 573) no Hoare annotation was computed. [2018-10-26 19:35:25,770 INFO L425 ceAbstractionStarter]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2018-10-26 19:35:25,783 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,784 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,784 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,784 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,784 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,785 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,785 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,785 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,785 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,785 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,785 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,786 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,786 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,786 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,786 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,786 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,787 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,787 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,787 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,787 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,787 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,788 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,788 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,788 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,788 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,788 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,788 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,788 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,789 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,789 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,789 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,789 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,789 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,790 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,790 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,790 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:25,790 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:25,791 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,791 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,791 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,791 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,791 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,791 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,792 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,792 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,792 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,793 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,794 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,794 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,794 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,794 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,794 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,795 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,795 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,795 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,795 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,795 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,796 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,796 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,796 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,796 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,798 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,799 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,799 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,799 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,799 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,799 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,805 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,805 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,805 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,805 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,806 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,806 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,806 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,806 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,806 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,808 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,808 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,808 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,808 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,808 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,809 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,809 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,809 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,809 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,810 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,810 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,810 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,810 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,810 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,811 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,811 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,811 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,811 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,811 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,811 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,812 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,812 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,812 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,812 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,820 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,821 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,821 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,821 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,821 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,821 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,822 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,823 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,833 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,833 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,833 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,833 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,833 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,834 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,834 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,834 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,834 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,834 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,835 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,835 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,835 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,835 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,835 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,836 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,836 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,836 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,836 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,841 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,842 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,842 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,842 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,842 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,843 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,843 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,843 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,843 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,843 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,844 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,844 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,844 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,844 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,848 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,848 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,848 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:25,848 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:25,848 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,849 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,849 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,851 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,852 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,852 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,852 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,853 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,853 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,853 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,853 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,853 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,854 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,854 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,854 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,854 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,854 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,854 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,855 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,855 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,855 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,855 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,855 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,855 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,863 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,864 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,864 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,864 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,864 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,865 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,865 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,866 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,866 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,867 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,867 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,867 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,867 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,867 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,867 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,868 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,868 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,868 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,868 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,868 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,868 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,869 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,869 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,869 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,869 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,869 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,870 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,870 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,870 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,870 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,870 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,870 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,871 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,871 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,871 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,871 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,871 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,871 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,872 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,872 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,872 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,872 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,872 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,872 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,873 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,873 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,873 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,873 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,873 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,873 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,875 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:25,875 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:25,876 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,876 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,876 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:25,878 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:25,878 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,879 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,879 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,880 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,880 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:25,880 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:25,881 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,881 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,881 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:25,881 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:25,881 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,882 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,882 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,883 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:35:25 BoogieIcfgContainer [2018-10-26 19:35:25,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:35:25,887 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 19:35:25,887 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 19:35:25,887 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 19:35:25,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:34:20" (3/4) ... [2018-10-26 19:35:25,890 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 19:35:25,895 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_remove_last [2018-10-26 19:35:25,895 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exit [2018-10-26 19:35:25,895 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 19:35:25,896 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 19:35:25,896 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_create [2018-10-26 19:35:25,896 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-10-26 19:35:25,900 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2018-10-26 19:35:25,901 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2018-10-26 19:35:25,901 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-26 19:35:25,918 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~bvsgt32(~bvadd64(\old(len), 4294967295bv32), 1bv32) && 0bv32 == head) && 0bv32 == new_head) && !(new_head == last)) && !(head == last)) && (forall v_node_create_#Ultimate.alloc_#res.base_25 : bv32 :: !(1bv1 == \old(\valid)[v_node_create_#Ultimate.alloc_#res.base_25]) || !(\valid[v_node_create_#Ultimate.alloc_#res.base_25] == 0bv1))) && ~bvadd64(\valid[last], 1bv1) == 0bv1) || ((((((\old(\valid)[head] == 0bv1 && \old(\valid)[head := 1bv1] == \valid) && !(head == 0bv32)) && 0bv32 == head) && \old(len) == len) && head == last) && head == last)) || ((((((((((head == #memory_$Pointer$[last][4bv32] && new_head == #memory_$Pointer$[last][4bv32]) && 0bv32 == head) && (forall v_node_create_#Ultimate.alloc_#res.base_25 : bv32 :: !(1bv1 == \old(\valid)[v_node_create_#Ultimate.alloc_#res.base_25]) || !(\valid[v_node_create_#Ultimate.alloc_#res.base_25] == 0bv1))) && 0bv1 == \old(\valid)[last]) && ~bvadd64(\old(len), 4294967295bv32) == len) && 0bv32 == last) && \old(\valid)[last := 1bv1][head] == 0bv1) && 0bv32 == new_head) && ~bvadd64(\valid[last], 1bv1) == 0bv1) && new_head == #memory_$Pointer$[last][4bv32]) [2018-10-26 19:35:25,919 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(s == 0bv32) && (\exists v_arrayElimCell_37 : bv32 :: ((((((#memory_$Pointer$[v_arrayElimCell_37][0bv32] == 0bv32 && !(#memory_$Pointer$[s][s] == v_arrayElimCell_37)) && #memory_$Pointer$[v_arrayElimCell_37][4bv32] == 0bv32) && #memory_$Pointer$[v_arrayElimCell_37][4bv32] == #memory_$Pointer$[#memory_$Pointer$[v_arrayElimCell_37][4bv32]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)]) && #memory_$Pointer$[v_arrayElimCell_37][4bv32] == #memory_$Pointer$[s][s]) && #memory_$Pointer$[v_arrayElimCell_37][4bv32] == #memory_$Pointer$[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)]) && #memory_$Pointer$[v_arrayElimCell_37][0bv32] == #memory_$Pointer$[s][s]) && !(s == v_arrayElimCell_37))) && #memory_$Pointer$[s][s] == 0bv32) && s == 0bv32) && ((~bvadd64(len, 4294967294bv32) == 0bv32 && ~bvadd64(i, 4294967295bv32) == 0bv32) || ((#memory_$Pointer$[s][s] == 0bv32 && 0bv32 == #memory_$Pointer$[s][s]) && ~bvadd64(len, 4294967294bv32) == 0bv32))) && !(s == #memory_$Pointer$[s][s])) || ((((!(s == 0bv32) && #memory_$Pointer$[s][s] == 0bv32) && s == 0bv32) && 0bv32 == #memory_$Pointer$[s][s]) && ((~bvadd64(len, 4294967294bv32) == 0bv32 && ~bvadd64(i, 4294967295bv32) == 0bv32) || ((#memory_$Pointer$[s][s] == 0bv32 && 0bv32 == #memory_$Pointer$[s][s]) && ~bvadd64(len, 4294967294bv32) == 0bv32)))) || (((((((((((((!(#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32] == s) && #memory_$Pointer$[s][s] == 0bv32) && (forall v_node_create_#Ultimate.alloc_#res.base_25 : bv32 :: !(1bv1 == \old(\valid)[v_node_create_#Ultimate.alloc_#res.base_25]) || !(\valid[v_node_create_#Ultimate.alloc_#res.base_25] == 0bv1))) && i == 0bv32) && ~bvadd64(len, 4294967294bv32) == 0bv32) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]][4bv32]) && #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]][0bv32] == #memory_$Pointer$[s][s]) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]][0bv32]) && #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]][4bv32]][4bv32] == 0bv32) && #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]][4bv32] == #memory_$Pointer$[s][s]) && !(s == 0bv32)) && s == 0bv32) && !(#memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]] == #memory_$Pointer$[#memory_$Pointer$[s][s]])) && !(s == #memory_$Pointer$[s][s])) [2018-10-26 19:35:25,945 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cdb1cea8-431c-4e6f-afe1-57002bfd1fa9/bin-2019/utaipan/witness.graphml [2018-10-26 19:35:25,946 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 19:35:25,946 INFO L168 Benchmark]: Toolchain (without parser) took 66475.86 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 370.1 MB). Free memory was 949.2 MB in the beginning and 1.3 GB in the end (delta: -379.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:35:25,947 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:35:25,947 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.12 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 927.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-26 19:35:25,947 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.84 ms. Allocated memory is still 1.0 GB. Free memory was 927.7 MB in the beginning and 922.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 19:35:25,947 INFO L168 Benchmark]: Boogie Preprocessor took 112.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 922.4 MB in the beginning and 1.1 GB in the end (delta: -224.5 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:35:25,948 INFO L168 Benchmark]: RCFGBuilder took 656.46 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: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2018-10-26 19:35:25,948 INFO L168 Benchmark]: TraceAbstraction took 65178.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 208.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -215.0 MB). Peak memory consumption was 450.4 MB. Max. memory is 11.5 GB. [2018-10-26 19:35:25,948 INFO L168 Benchmark]: Witness Printer took 58.92 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:35:25,952 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 418.12 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 927.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.84 ms. Allocated memory is still 1.0 GB. Free memory was 927.7 MB in the beginning and 922.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 112.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 922.4 MB in the beginning and 1.1 GB in the end (delta: -224.5 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 656.46 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: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 65178.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 208.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -215.0 MB). Peak memory consumption was 450.4 MB. Max. memory is 11.5 GB. * Witness Printer took 58.92 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 614]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 602]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 607]: Loop Invariant [2018-10-26 19:35:25,973 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,974 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,974 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,974 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,974 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,974 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,975 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,975 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,975 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,975 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,975 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,975 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,976 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,976 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,976 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,976 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,976 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,976 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,977 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,977 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,977 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,977 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,977 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,977 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:25,978 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,978 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,978 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,978 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,978 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,978 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,979 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,979 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,979 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,979 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,979 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,980 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:25,980 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:25,980 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,980 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,980 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,980 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,981 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,981 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,981 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,981 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,981 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,981 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,982 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:25,982 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,982 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,982 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,982 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,982 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,982 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,983 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,983 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,983 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,983 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,983 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,983 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,983 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:25,984 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,992 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,993 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,993 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,993 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,993 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,993 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,994 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,994 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,994 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,994 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,994 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,994 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,995 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,995 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,995 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,995 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,995 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,995 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,995 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,996 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,996 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,996 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,996 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,996 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,996 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,996 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,997 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,997 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,997 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,997 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,997 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,997 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,998 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,998 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,998 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,998 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,998 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,998 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,999 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,999 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,999 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,999 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,999 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,999 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,999 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:25,999 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,000 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,000 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,000 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,013 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:26,013 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:26,013 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,013 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:26,013 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:26,014 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:26,014 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:26,014 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:26,014 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:26,014 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,014 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:26,015 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:26,015 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,015 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:26,015 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,015 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,015 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:26,016 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,016 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,016 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:26,016 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,016 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:26,016 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,017 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-10-26 19:35:26,020 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:26,021 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:26,021 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,021 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,021 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:26,021 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,021 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:26,021 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,022 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,022 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,022 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:26,022 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:26,022 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:26,022 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:26,023 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,023 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,023 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,023 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,023 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,023 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,024 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:26,024 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,024 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,024 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:26,024 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,024 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,024 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,025 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,025 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,025 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,025 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,025 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,025 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,025 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,026 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,026 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,026 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,027 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,027 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,027 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,027 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,027 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,027 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,028 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,028 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,028 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,028 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,028 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,028 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,029 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,029 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,029 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,029 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,029 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,029 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,029 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,029 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,030 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,030 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,030 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,030 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,030 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,030 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,031 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,031 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,031 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,031 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,031 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,031 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,031 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,032 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,032 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,032 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,032 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,040 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,040 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,041 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,041 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,041 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,041 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,041 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,041 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,041 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,042 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,042 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,042 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,042 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((!(s == 0bv32) && (\exists v_arrayElimCell_37 : bv32 :: ((((((#memory_$Pointer$[v_arrayElimCell_37][0bv32] == 0bv32 && !(#memory_$Pointer$[s][s] == v_arrayElimCell_37)) && #memory_$Pointer$[v_arrayElimCell_37][4bv32] == 0bv32) && #memory_$Pointer$[v_arrayElimCell_37][4bv32] == #memory_$Pointer$[#memory_$Pointer$[v_arrayElimCell_37][4bv32]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)]) && #memory_$Pointer$[v_arrayElimCell_37][4bv32] == #memory_$Pointer$[s][s]) && #memory_$Pointer$[v_arrayElimCell_37][4bv32] == #memory_$Pointer$[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)]) && #memory_$Pointer$[v_arrayElimCell_37][0bv32] == #memory_$Pointer$[s][s]) && !(s == v_arrayElimCell_37))) && #memory_$Pointer$[s][s] == 0bv32) && s == 0bv32) && ((~bvadd64(len, 4294967294bv32) == 0bv32 && ~bvadd64(i, 4294967295bv32) == 0bv32) || ((#memory_$Pointer$[s][s] == 0bv32 && 0bv32 == #memory_$Pointer$[s][s]) && ~bvadd64(len, 4294967294bv32) == 0bv32))) && !(s == #memory_$Pointer$[s][s])) || ((((!(s == 0bv32) && #memory_$Pointer$[s][s] == 0bv32) && s == 0bv32) && 0bv32 == #memory_$Pointer$[s][s]) && ((~bvadd64(len, 4294967294bv32) == 0bv32 && ~bvadd64(i, 4294967295bv32) == 0bv32) || ((#memory_$Pointer$[s][s] == 0bv32 && 0bv32 == #memory_$Pointer$[s][s]) && ~bvadd64(len, 4294967294bv32) == 0bv32)))) || (((((((((((((!(#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32] == s) && #memory_$Pointer$[s][s] == 0bv32) && (forall v_node_create_#Ultimate.alloc_#res.base_25 : bv32 :: !(1bv1 == \old(\valid)[v_node_create_#Ultimate.alloc_#res.base_25]) || !(\valid[v_node_create_#Ultimate.alloc_#res.base_25] == 0bv1))) && i == 0bv32) && ~bvadd64(len, 4294967294bv32) == 0bv32) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]][4bv32]) && #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]][0bv32] == #memory_$Pointer$[s][s]) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]][0bv32]) && #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]][4bv32]][4bv32] == 0bv32) && #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]][4bv32] == #memory_$Pointer$[s][s]) && !(s == 0bv32)) && s == 0bv32) && !(#memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]] == #memory_$Pointer$[#memory_$Pointer$[s][s]])) && !(s == #memory_$Pointer$[s][s])) - InvariantResult [Line: 577]: Loop Invariant [2018-10-26 19:35:26,043 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:26,043 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:26,043 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,043 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,043 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:26,044 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:26,044 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:26,044 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,052 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,053 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,053 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:26,053 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:26,053 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,054 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:35:26,054 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:26,054 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-10-26 19:35:26,054 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:35:26,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,055 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:35:26,055 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((~bvsgt32(~bvadd64(\old(len), 4294967295bv32), 1bv32) && 0bv32 == head) && 0bv32 == new_head) && !(new_head == last)) && !(head == last)) && (forall v_node_create_#Ultimate.alloc_#res.base_25 : bv32 :: !(1bv1 == \old(\valid)[v_node_create_#Ultimate.alloc_#res.base_25]) || !(\valid[v_node_create_#Ultimate.alloc_#res.base_25] == 0bv1))) && ~bvadd64(\valid[last], 1bv1) == 0bv1) || ((((((\old(\valid)[head] == 0bv1 && \old(\valid)[head := 1bv1] == \valid) && !(head == 0bv32)) && 0bv32 == head) && \old(len) == len) && head == last) && head == last)) || ((((((((((head == #memory_$Pointer$[last][4bv32] && new_head == #memory_$Pointer$[last][4bv32]) && 0bv32 == head) && (forall v_node_create_#Ultimate.alloc_#res.base_25 : bv32 :: !(1bv1 == \old(\valid)[v_node_create_#Ultimate.alloc_#res.base_25]) || !(\valid[v_node_create_#Ultimate.alloc_#res.base_25] == 0bv1))) && 0bv1 == \old(\valid)[last]) && ~bvadd64(\old(len), 4294967295bv32) == len) && 0bv32 == last) && \old(\valid)[last := 1bv1][head] == 0bv1) && 0bv32 == new_head) && ~bvadd64(\valid[last], 1bv1) == 0bv1) && new_head == #memory_$Pointer$[last][4bv32]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 46 locations, 1 error locations. SAFE Result, 65.0s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 10.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 291 SDtfs, 155 SDslu, 1679 SDs, 0 SdLazy, 1633 SolverSat, 113 SolverUnsat, 37 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1032 GetRequests, 894 SyntacticMatches, 8 SemanticMatches, 130 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 27.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 34 PreInvPairs, 47 NumberOfFragments, 983 HoareAnnotationTreeSize, 34 FomulaSimplifications, 658 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 253 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 50.4s InterpolantComputationTime, 623 NumberOfCodeBlocks, 623 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 936 ConstructedInterpolants, 19 QuantifiedInterpolants, 529901 SizeOfPredicates, 256 NumberOfNonLiveVariables, 3784 ConjunctsInSsa, 376 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 267/353 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...