./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_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/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_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/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_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/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_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/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-11-10 12:54:16,155 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:54:16,157 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:54:16,165 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:54:16,165 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:54:16,165 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:54:16,166 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:54:16,167 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:54:16,168 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:54:16,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:54:16,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:54:16,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:54:16,170 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:54:16,170 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:54:16,171 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:54:16,172 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:54:16,172 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:54:16,174 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:54:16,175 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:54:16,176 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:54:16,178 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:54:16,179 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:54:16,180 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:54:16,181 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:54:16,181 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:54:16,182 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:54:16,183 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:54:16,184 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:54:16,184 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:54:16,185 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:54:16,186 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:54:16,186 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:54:16,186 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:54:16,187 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:54:16,187 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:54:16,188 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:54:16,188 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 12:54:16,199 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:54:16,199 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:54:16,200 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:54:16,200 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 12:54:16,200 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 12:54:16,200 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 12:54:16,200 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 12:54:16,201 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 12:54:16,201 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 12:54:16,201 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 12:54:16,201 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 12:54:16,202 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:54:16,203 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:54:16,203 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:54:16,203 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:54:16,203 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:54:16,203 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:54:16,203 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:54:16,203 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:54:16,204 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:54:16,204 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:54:16,204 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:54:16,204 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:54:16,204 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:54:16,204 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:54:16,204 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:54:16,204 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:54:16,204 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:54:16,205 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:54:16,205 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:54:16,205 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 12:54:16,205 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:54:16,205 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:54:16,205 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 12:54:16,205 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_1eb656d9-a716-42c6-aafb-2fece1117e55/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-11-10 12:54:16,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:54:16,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:54:16,243 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:54:16,244 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:54:16,244 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:54:16,245 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-10 12:54:16,285 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/data/e3b682f22/4659d1c3bd90497d997c77e6739f7bad/FLAG1f56c5f69 [2018-11-10 12:54:16,648 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:54:16,648 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-10 12:54:16,655 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/data/e3b682f22/4659d1c3bd90497d997c77e6739f7bad/FLAG1f56c5f69 [2018-11-10 12:54:16,662 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/data/e3b682f22/4659d1c3bd90497d997c77e6739f7bad [2018-11-10 12:54:16,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:54:16,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:54:16,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:54:16,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:54:16,669 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:54:16,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:54:16" (1/1) ... [2018-11-10 12:54:16,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff31fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:16, skipping insertion in model container [2018-11-10 12:54:16,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:54:16" (1/1) ... [2018-11-10 12:54:16,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:54:16,709 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:54:16,938 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:54:16,943 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:54:16,971 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:54:17,005 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:54:17,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:17 WrapperNode [2018-11-10 12:54:17,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:54:17,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:54:17,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:54:17,006 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:54:17,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:17" (1/1) ... [2018-11-10 12:54:17,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:17" (1/1) ... [2018-11-10 12:54:17,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:54:17,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:54:17,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:54:17,094 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:54:17,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:17" (1/1) ... [2018-11-10 12:54:17,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:17" (1/1) ... [2018-11-10 12:54:17,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:17" (1/1) ... [2018-11-10 12:54:17,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:17" (1/1) ... [2018-11-10 12:54:17,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:17" (1/1) ... [2018-11-10 12:54:17,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:17" (1/1) ... [2018-11-10 12:54:17,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:17" (1/1) ... [2018-11-10 12:54:17,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:54:17,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:54:17,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:54:17,114 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:54:17,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:54:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-11-10 12:54:17,149 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-11-10 12:54:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 12:54:17,149 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-10 12:54:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-10 12:54:17,149 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-10 12:54:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:54:17,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:54:17,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:54:17,150 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:54:17,150 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_remove_last [2018-11-10 12:54:17,150 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_remove_last [2018-11-10 12:54:17,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:54:17,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:54:17,448 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:54:17,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:54:17 BoogieIcfgContainer [2018-11-10 12:54:17,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:54:17,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:54:17,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:54:17,451 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:54:17,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:54:16" (1/3) ... [2018-11-10 12:54:17,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1fd832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:54:17, skipping insertion in model container [2018-11-10 12:54:17,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:17" (2/3) ... [2018-11-10 12:54:17,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1fd832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:54:17, skipping insertion in model container [2018-11-10 12:54:17,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:54:17" (3/3) ... [2018-11-10 12:54:17,454 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-10 12:54:17,460 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:54:17,464 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:54:17,473 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:54:17,495 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:54:17,495 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:54:17,495 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:54:17,495 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:54:17,495 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:54:17,495 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:54:17,495 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:54:17,495 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:54:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-10 12:54:17,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 12:54:17,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:17,510 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:54:17,511 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:54:17,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:17,516 INFO L82 PathProgramCache]: Analyzing trace with hash -613250840, now seen corresponding path program 1 times [2018-11-10 12:54:17,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:17,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:17,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:17,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:17,553 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:54:17,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:54:17,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:54:17,643 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:54:17,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 12:54:17,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 12:54:17,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 12:54:17,657 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-10 12:54:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:17,671 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-11-10 12:54:17,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:54:17,672 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-10 12:54:17,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:17,678 INFO L225 Difference]: With dead ends: 64 [2018-11-10 12:54:17,678 INFO L226 Difference]: Without dead ends: 37 [2018-11-10 12:54:17,680 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-11-10 12:54:17,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-10 12:54:17,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-10 12:54:17,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 12:54:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-10 12:54:17,707 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 24 [2018-11-10 12:54:17,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:17,708 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-10 12:54:17,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 12:54:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-10 12:54:17,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 12:54:17,710 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:17,710 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-11-10 12:54:17,710 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:54:17,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:17,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1120811875, now seen corresponding path program 1 times [2018-11-10 12:54:17,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:17,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:17,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:17,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:17,713 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:17,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:54:17,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:54:17,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:54:17,790 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:54:17,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:54:17,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:54:17,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:54:17,791 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2018-11-10 12:54:17,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:17,846 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-11-10 12:54:17,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:54:17,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-10 12:54:17,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:17,847 INFO L225 Difference]: With dead ends: 59 [2018-11-10 12:54:17,848 INFO L226 Difference]: Without dead ends: 43 [2018-11-10 12:54:17,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:54:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-10 12:54:17,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-11-10 12:54:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-10 12:54:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-10 12:54:17,854 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2018-11-10 12:54:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:17,854 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-10 12:54:17,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:54:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-10 12:54:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 12:54:17,855 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:17,856 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-11-10 12:54:17,856 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:54:17,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:17,856 INFO L82 PathProgramCache]: Analyzing trace with hash -10678655, now seen corresponding path program 1 times [2018-11-10 12:54:17,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:17,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:17,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:17,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:17,858 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 12:54:17,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:54:17,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:54:17,932 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:54:17,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:54:17,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:54:17,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:54:17,933 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2018-11-10 12:54:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:17,965 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-10 12:54:17,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:54:17,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-10 12:54:17,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:17,966 INFO L225 Difference]: With dead ends: 47 [2018-11-10 12:54:17,966 INFO L226 Difference]: Without dead ends: 43 [2018-11-10 12:54:17,966 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-11-10 12:54:17,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-10 12:54:17,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-10 12:54:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 12:54:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-10 12:54:17,970 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 37 [2018-11-10 12:54:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:17,970 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-10 12:54:17,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:54:17,971 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-10 12:54:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 12:54:17,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:17,971 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-11-10 12:54:17,972 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:54:17,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:17,972 INFO L82 PathProgramCache]: Analyzing trace with hash 204905672, now seen corresponding path program 1 times [2018-11-10 12:54:17,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:17,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:17,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:17,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:17,973 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 12:54:18,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:18,071 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:54:18,072 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-10 12:54:18,074 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-11-10 12:54:18,110 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:54:18,110 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:54:18,652 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 12:54:18,653 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-11-10 12:54:18,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:18,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 12:54:18,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:18,666 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:54:18,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:18,673 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 12:54:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:18,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:54:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 12:54:18,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:54:18,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 12:54:18,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:54:18,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-10 12:54:18,856 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:54:18,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:54:18,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:54:18,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:54:18,857 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2018-11-10 12:54:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:18,896 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-10 12:54:18,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:54:18,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-10 12:54:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:18,897 INFO L225 Difference]: With dead ends: 51 [2018-11-10 12:54:18,899 INFO L226 Difference]: Without dead ends: 47 [2018-11-10 12:54:18,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:54:18,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-10 12:54:18,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-10 12:54:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 12:54:18,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-11-10 12:54:18,904 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 45 [2018-11-10 12:54:18,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:18,905 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-10 12:54:18,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:54:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-10 12:54:18,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 12:54:18,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:18,907 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-11-10 12:54:18,907 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:54:18,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:18,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1151136783, now seen corresponding path program 2 times [2018-11-10 12:54:18,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:18,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:18,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:18,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:18,910 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 12:54:19,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:54:19,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:54:19,001 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:54:19,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:54:19,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:54:19,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:54:19,001 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 6 states. [2018-11-10 12:54:19,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:19,080 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-11-10 12:54:19,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:54:19,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-11-10 12:54:19,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:19,083 INFO L225 Difference]: With dead ends: 60 [2018-11-10 12:54:19,083 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 12:54:19,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:54:19,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 12:54:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2018-11-10 12:54:19,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 12:54:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-10 12:54:19,090 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 53 [2018-11-10 12:54:19,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:19,091 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-10 12:54:19,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:54:19,091 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-10 12:54:19,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 12:54:19,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:19,092 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-11-10 12:54:19,092 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:54:19,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:19,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1831195153, now seen corresponding path program 1 times [2018-11-10 12:54:19,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:19,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:19,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:54:19,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:19,095 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 12:54:19,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:19,302 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:54:19,302 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-10 12:54:19,302 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-11-10 12:54:19,305 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:54:19,305 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:54:19,581 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 12:54:19,581 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-11-10 12:54:19,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:19,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 12:54:19,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:19,583 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:54:19,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:19,595 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 12:54:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:19,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:54:19,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:54:19,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:54:19,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:19,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:19,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:54:19,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 8 treesize of output 7 [2018-11-10 12:54:19,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:19,706 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:19,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:19,712 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-11-10 12:54:19,749 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-11-10 12:54:19,813 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-11-10 12:54:19,817 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-11-10 12:54:19,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:19,832 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:19,860 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-11-10 12:54:19,870 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-10 12:54:19,870 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:20,002 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-11-10 12:54:20,003 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:20,103 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-11-10 12:54:20,104 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:20,132 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:54:20,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:54:20,182 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-11-10 12:54:20,185 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-11-10 12:54:20,185 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:20,228 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-11-10 12:54:20,238 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-10 12:54:20,239 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:20,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2018-11-10 12:54:20,302 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:20,334 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-11-10 12:54:20,335 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:20,369 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:54:20,386 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:54:20,388 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:20,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-11-10 12:54:20,395 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-11-10 12:54:20,395 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:20,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-11-10 12:54:20,418 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-11-10 12:54:20,419 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:20,426 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:20,434 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:20,457 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-11-10 12:54:20,458 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:185, output treesize:99 [2018-11-10 12:54:20,479 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-11-10 12:54:20,481 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-11-10 12:54:20,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:20,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:20,494 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-11-10 12:54:20,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 12:54:20,497 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:20,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:20,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:20,507 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-11-10 12:54:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2018-11-10 12:54:20,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:54:21,161 WARN L179 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-11-10 12:54:21,284 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-11-10 12:54:21,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 12:54:21,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,310 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:21,310 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:21,311 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-11-10 12:54:21,333 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:21,333 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-11-10 12:54:21,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-10 12:54:21,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 12:54:21,344 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,345 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,345 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,356 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-11-10 12:54:21,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 12:54:21,374 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:21,399 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:21,400 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-11-10 12:54:21,424 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:21,425 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-11-10 12:54:21,425 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-10 12:54:21,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 12:54:21,437 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,438 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,439 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,443 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,452 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:183, output treesize:4 [2018-11-10 12:54:21,609 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 61 [2018-11-10 12:54:21,613 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-11-10 12:54:21,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 12:54:21,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,673 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-11-10 12:54:21,697 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:21,699 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-11-10 12:54:21,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,707 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-11-10 12:54:21,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 12:54:21,709 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 12:54:21,715 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,716 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,736 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-11-10 12:54:21,791 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-11-10 12:54:21,791 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,821 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-11-10 12:54:21,822 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:21,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-11-10 12:54:21,855 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 17 treesize of output 12 [2018-11-10 12:54:21,855 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:21,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-10 12:54:21,862 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,863 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 10 treesize of output 8 [2018-11-10 12:54:21,864 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,865 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,867 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 44 treesize of output 39 [2018-11-10 12:54:21,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2018-11-10 12:54:21,869 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 12:54:21,875 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,877 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,898 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 41 treesize of output 44 [2018-11-10 12:54:21,901 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 39 treesize of output 35 [2018-11-10 12:54:21,901 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:54:21,917 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-11-10 12:54:21,918 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:54:21,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-10 12:54:21,931 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-10 12:54:21,943 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:21,958 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-11-10 12:54:21,959 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:21,971 INFO L267 ElimStorePlain]: Start of recursive call 19: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 12:54:21,979 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:22,005 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-11-10 12:54:22,263 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 141 [2018-11-10 12:54:22,265 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 61 treesize of output 60 [2018-11-10 12:54:22,266 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:22,364 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 50 treesize of output 66 [2018-11-10 12:54:22,365 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:22,479 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:22,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 63 [2018-11-10 12:54:22,481 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:22,599 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-11-10 12:54:22,601 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-11-10 12:54:22,601 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:22,605 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:22,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, 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 46 [2018-11-10 12:54:22,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-10 12:54:22,686 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:54:22,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 12:54:22,695 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:22,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-10 12:54:22,702 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:22,706 INFO L267 ElimStorePlain]: Start of recursive call 31: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:22,783 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:22,791 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 54 treesize of output 61 [2018-11-10 12:54:22,795 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 36 treesize of output 29 [2018-11-10 12:54:22,795 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:22,821 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:22,825 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 36 treesize of output 33 [2018-11-10 12:54:22,826 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:22,843 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:22,847 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-11-10 12:54:22,847 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:22,852 INFO L267 ElimStorePlain]: Start of recursive call 35: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:22,936 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-11-10 12:54:23,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-10 12:54:23,010 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:23,051 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:23,052 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 30 treesize of output 22 [2018-11-10 12:54:23,053 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:23,075 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 26 treesize of output 17 [2018-11-10 12:54:23,075 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:23,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-11-10 12:54:23,077 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:23,087 INFO L267 ElimStorePlain]: Start of recursive call 39: 6 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:54:23,114 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-11-10 12:54:23,117 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:23,121 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 32 treesize of output 29 [2018-11-10 12:54:23,121 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:23,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 33 treesize of output 27 [2018-11-10 12:54:23,154 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:23,174 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 36 treesize of output 32 [2018-11-10 12:54:23,174 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:23,203 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 27 treesize of output 23 [2018-11-10 12:54:23,204 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:23,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-10 12:54:23,214 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:23,218 INFO L267 ElimStorePlain]: Start of recursive call 44: 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:54:23,221 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:23,245 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-11-10 12:54:23,493 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 143 [2018-11-10 12:54:23,502 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-11-10 12:54:23,503 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:23,516 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-11-10 12:54:23,517 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:23,524 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-11-10 12:54:23,525 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:23,874 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-11-10 12:54:23,874 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:23,883 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-11-10 12:54:23,883 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:23,891 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-11-10 12:54:23,892 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:24,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-11-10 12:54:24,241 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:24,243 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-11-10 12:54:24,243 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:24,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-11-10 12:54:24,245 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:24,598 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-11-10 12:54:24,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-11-10 12:54:24,611 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:24,637 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 18 treesize of output 14 [2018-11-10 12:54:24,637 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:24,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-11-10 12:54:24,639 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:24,649 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:54:24,652 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 48 treesize of output 37 [2018-11-10 12:54:24,671 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 18 treesize of output 14 [2018-11-10 12:54:24,672 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:24,675 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 15 treesize of output 10 [2018-11-10 12:54:24,675 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:24,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 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-11-10 12:54:24,678 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:24,690 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:54:24,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-11-10 12:54:24,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-11-10 12:54:24,695 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:24,700 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,009 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 47 treesize of output 42 [2018-11-10 12:54:25,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2018-11-10 12:54:25,011 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 12:54:25,018 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,022 INFO L267 ElimStorePlain]: Start of recursive call 70: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-11-10 12:54:25,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-10 12:54:25,029 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:54:25,040 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:25,040 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:25,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-11-10 12:54:25,042 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,053 INFO L267 ElimStorePlain]: Start of recursive call 73: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-11-10 12:54:25,063 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 17 treesize of output 12 [2018-11-10 12:54:25,063 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:25,073 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 10 treesize of output 8 [2018-11-10 12:54:25,074 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,075 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 13 treesize of output 9 [2018-11-10 12:54:25,075 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,078 INFO L267 ElimStorePlain]: Start of recursive call 76: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,081 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 49 treesize of output 40 [2018-11-10 12:54:25,083 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 16 treesize of output 12 [2018-11-10 12:54:25,084 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:54:25,098 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 15 treesize of output 10 [2018-11-10 12:54:25,098 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:25,106 INFO L267 ElimStorePlain]: Start of recursive call 80: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:54:25,346 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 47 [2018-11-10 12:54:25,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-11-10 12:54:25,348 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-11-10 12:54:25,377 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,389 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 23 treesize of output 21 [2018-11-10 12:54:25,390 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,401 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:25,401 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:25,401 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 32 treesize of output 23 [2018-11-10 12:54:25,401 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-10 12:54:25,411 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,416 INFO L267 ElimStorePlain]: Start of recursive call 83: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,422 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 47 [2018-11-10 12:54:25,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-11-10 12:54:25,424 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-10 12:54:25,442 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:54:25,454 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-11-10 12:54:25,455 INFO L267 ElimStorePlain]: Start of recursive call 92: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:54:25,470 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 29 treesize of output 21 [2018-11-10 12:54:25,471 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,486 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-11-10 12:54:25,486 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:25,500 INFO L267 ElimStorePlain]: Start of recursive call 89: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 12:54:25,507 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 44 treesize of output 47 [2018-11-10 12:54:25,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2018-11-10 12:54:25,510 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-11-10 12:54:25,524 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-10 12:54:25,536 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,550 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 32 treesize of output 28 [2018-11-10 12:54:25,551 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:25,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-10 12:54:25,565 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-11-10 12:54:25,567 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,572 INFO L267 ElimStorePlain]: Start of recursive call 95: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,900 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-11-10 12:54:25,958 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 32 treesize of output 25 [2018-11-10 12:54:25,958 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:25,982 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-11-10 12:54:25,982 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:26,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-10 12:54:26,004 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:26,023 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-11-10 12:54:26,023 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:26,043 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:26,044 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:26,048 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 25 treesize of output 29 [2018-11-10 12:54:26,048 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:26,067 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-11-10 12:54:26,067 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:26,074 INFO L267 ElimStorePlain]: Start of recursive call 102: 6 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:54:26,084 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-11-10 12:54:26,196 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2018-11-10 12:54:26,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-10 12:54:26,198 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:26,232 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-11-10 12:54:26,232 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:26,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-11-10 12:54:26,234 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:26,259 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 23 treesize of output 21 [2018-11-10 12:54:26,260 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:26,292 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 25 treesize of output 32 [2018-11-10 12:54:26,293 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 3 xjuncts. [2018-11-10 12:54:26,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-10 12:54:26,317 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:26,338 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-11-10 12:54:26,339 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:26,351 INFO L267 ElimStorePlain]: Start of recursive call 109: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 12:54:26,371 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-11-10 12:54:26,411 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2018-11-10 12:54:26,411 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 3 xjuncts. [2018-11-10 12:54:26,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, 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-11-10 12:54:26,440 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:26,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-10 12:54:26,461 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:26,482 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 29 treesize of output 23 [2018-11-10 12:54:26,482 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:26,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-10 12:54:26,501 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:26,521 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-11-10 12:54:26,521 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:26,533 INFO L267 ElimStorePlain]: Start of recursive call 117: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 12:54:26,560 INFO L267 ElimStorePlain]: Start of recursive call 50: 3 dim-1 vars, 8 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 12:54:26,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:26,584 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-11-10 12:54:26,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 95 [2018-11-10 12:54:26,688 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:26,690 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 141 treesize of output 140 [2018-11-10 12:54:26,691 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:26,693 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-11-10 12:54:26,694 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:26,697 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-11-10 12:54:26,698 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:26,880 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:26,881 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:26,881 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 83 treesize of output 98 [2018-11-10 12:54:26,882 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:26,884 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:26,884 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:26,884 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 83 treesize of output 96 [2018-11-10 12:54:26,885 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:26,887 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-11-10 12:54:26,887 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:27,038 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-11-10 12:54:27,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:27,066 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-11-10 12:54:27,067 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:27,075 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-11-10 12:54:27,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 12:54:27,077 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:27,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 12:54:27,080 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:27,081 INFO L267 ElimStorePlain]: Start of recursive call 134: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:27,088 INFO L267 ElimStorePlain]: Start of recursive call 132: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:27,114 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-11-10 12:54:27,436 WARN L179 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 140 [2018-11-10 12:54:27,438 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-11-10 12:54:27,438 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:27,553 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-11-10 12:54:27,554 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:27,677 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:27,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 80 [2018-11-10 12:54:27,678 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:27,803 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 76 treesize of output 50 [2018-11-10 12:54:27,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 12:54:27,804 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:27,813 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:27,814 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-11-10 12:54:27,814 INFO L267 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:27,818 INFO L267 ElimStorePlain]: Start of recursive call 141: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:27,922 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 59 treesize of output 57 [2018-11-10 12:54:27,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, 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 42 [2018-11-10 12:54:27,925 INFO L267 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:27,949 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:27,950 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 45 treesize of output 37 [2018-11-10 12:54:27,951 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:27,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-10 12:54:27,972 INFO L267 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:27,988 INFO L267 ElimStorePlain]: Start of recursive call 144: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,078 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 55 treesize of output 63 [2018-11-10 12:54:28,080 INFO L267 ElimStorePlain]: Start of recursive call 149: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:54:28,122 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 42 treesize of output 36 [2018-11-10 12:54:28,122 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,161 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:28,164 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-11-10 12:54:28,165 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:28,184 INFO L267 ElimStorePlain]: Start of recursive call 148: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,209 INFO L267 ElimStorePlain]: Start of recursive call 137: 3 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,224 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-11-10 12:54:28,288 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-11-10 12:54:28,288 INFO L267 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,325 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-11-10 12:54:28,325 INFO L267 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:28,372 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-11-10 12:54:28,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 12:54:28,374 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,382 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-11-10 12:54:28,382 INFO L267 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-10 12:54:28,389 INFO L267 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,393 INFO L267 ElimStorePlain]: Start of recursive call 155: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,429 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-11-10 12:54:28,431 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-11-10 12:54:28,431 INFO L267 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,438 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-11-10 12:54:28,438 INFO L267 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,442 INFO L267 ElimStorePlain]: Start of recursive call 159: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,444 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-11-10 12:54:28,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11-10 12:54:28,450 INFO L267 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 2 xjuncts. [2018-11-10 12:54:28,458 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-11-10 12:54:28,459 INFO L267 ElimStorePlain]: Start of recursive call 164: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,460 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-11-10 12:54:28,460 INFO L267 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,464 INFO L267 ElimStorePlain]: Start of recursive call 162: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,484 INFO L267 ElimStorePlain]: Start of recursive call 152: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,549 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-11-10 12:54:28,551 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-11-10 12:54:28,551 INFO L267 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,553 INFO L267 ElimStorePlain]: Start of recursive call 166: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,568 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-11-10 12:54:28,709 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2018-11-10 12:54:28,710 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-11-10 12:54:28,711 INFO L267 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,744 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:28,745 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:28,746 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:28,747 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 61 treesize of output 65 [2018-11-10 12:54:28,747 INFO L267 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,787 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 55 treesize of output 37 [2018-11-10 12:54:28,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-10 12:54:28,789 INFO L267 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,793 INFO L267 ElimStorePlain]: Start of recursive call 171: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,835 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 56 [2018-11-10 12:54:28,837 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:28,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2018-11-10 12:54:28,838 INFO L267 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,858 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:28,859 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:28,859 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 41 treesize of output 26 [2018-11-10 12:54:28,859 INFO L267 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 25 [2018-11-10 12:54:28,876 INFO L267 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,887 INFO L267 ElimStorePlain]: Start of recursive call 173: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:54:28,902 INFO L267 ElimStorePlain]: Start of recursive call 168: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,903 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-11-10 12:54:28,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-11-10 12:54:28,905 INFO L267 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,908 INFO L267 ElimStorePlain]: Start of recursive call 177: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,920 INFO L267 ElimStorePlain]: Start of recursive call 124: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:28,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:54:28,942 INFO L202 ElimStorePlain]: Needed 178 recursive calls to eliminate 10 variables, input treesize:419, output treesize:15 [2018-11-10 12:54:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 12:54:28,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:54:28,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 18 [2018-11-10 12:54:28,990 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:54:28,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 12:54:28,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:54:28,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=224, Unknown=1, NotChecked=30, Total=306 [2018-11-10 12:54:28,991 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 13 states. [2018-11-10 12:54:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:29,263 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-10 12:54:29,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 12:54:29,265 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-11-10 12:54:29,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:29,266 INFO L225 Difference]: With dead ends: 62 [2018-11-10 12:54:29,266 INFO L226 Difference]: Without dead ends: 45 [2018-11-10 12:54:29,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 92 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=407, Unknown=3, NotChecked=42, Total=552 [2018-11-10 12:54:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-10 12:54:29,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-10 12:54:29,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 12:54:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-10 12:54:29,273 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 53 [2018-11-10 12:54:29,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:29,273 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-10 12:54:29,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 12:54:29,274 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-10 12:54:29,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 12:54:29,274 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:29,274 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-11-10 12:54:29,275 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:54:29,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:29,275 INFO L82 PathProgramCache]: Analyzing trace with hash 242847251, now seen corresponding path program 1 times [2018-11-10 12:54:29,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:29,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:29,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:29,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:29,276 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:30,601 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 12:54:30,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:30,601 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:54:30,601 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-10 12:54:30,601 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-11-10 12:54:30,603 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:54:30,603 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:54:30,845 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 12:54:30,845 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-11-10 12:54:30,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:30,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 12:54:30,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:30,850 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:54:30,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:30,868 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 12:54:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:30,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:54:30,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 12:54:30,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:30,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:30,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 12:54:30,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:54:31,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:54:31,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:34 [2018-11-10 12:54:31,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:54:31,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:54:31,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:54:31,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:54:31,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,044 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,052 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-11-10 12:54:31,081 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-11-10 12:54:31,084 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:31,084 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-11-10 12:54:31,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,094 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:31,094 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-11-10 12:54:31,096 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-11-10 12:54:31,096 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-10 12:54:31,122 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:31,122 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-11-10 12:54:31,123 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,130 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-11-10 12:54:31,132 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-11-10 12:54:31,132 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,137 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,140 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,151 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:96, output treesize:107 [2018-11-10 12:54:31,193 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:31,195 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:31,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:31,196 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-11-10 12:54:31,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:112, output treesize:105 [2018-11-10 12:54:31,248 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:31,250 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-11-10 12:54:31,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:54:31,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,279 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-11-10 12:54:31,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:54:31,281 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,301 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:108, output treesize:137 [2018-11-10 12:54:31,384 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-11-10 12:54:31,390 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_94 Int)) (= (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_94))))))) |c_#memory_$Pointer$.base|)) (exists ((v_prenex_95 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_95))))))) |c_#memory_$Pointer$.offset|)) (not (= (select (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1) .cse32)))))) is different from true [2018-11-10 12:54:31,397 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:31,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:31,408 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:31,416 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 609 treesize of output 466 [2018-11-10 12:54:31,420 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:31,441 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 517 treesize of output 405 [2018-11-10 12:54:31,445 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-10 12:54:31,887 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:31,898 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 346 treesize of output 382 [2018-11-10 12:54:31,901 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:31,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 105 [2018-11-10 12:54:31,903 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,924 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:31,926 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:31,927 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:31,928 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:54:31,929 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:31,938 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 482 treesize of output 398 [2018-11-10 12:54:31,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:31,943 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:31,944 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:31,948 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:31,975 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 393 treesize of output 448 [2018-11-10 12:54:31,989 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:54:41,174 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:54:50,540 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:54:59,334 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:55:06,400 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:55:14,134 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:55:20,897 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:55:26,591 INFO L267 ElimStorePlain]: Start of recursive call 7: 6 dim-0 vars, 7 dim-1 vars, End of recursive call: 13 dim-0 vars, and 7 xjuncts. [2018-11-10 12:55:32,802 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 13 dim-0 vars, and 7 xjuncts. [2018-11-10 12:55:32,805 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:55:32,821 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:55:32,828 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:55:32,839 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 354 treesize of output 347 [2018-11-10 12:55:32,845 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:55:32,848 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:55:32,850 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:55:32,875 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 80 treesize of output 213 [2018-11-10 12:55:32,878 INFO L267 ElimStorePlain]: Start of recursive call 16: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-11-10 12:55:32,949 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:55:55,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 21 dim-0 vars, and 10 xjuncts. [2018-11-10 12:57:19,964 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:19,966 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:19,971 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 398 treesize of output 351 [2018-11-10 12:57:19,974 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:19,974 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 192 treesize of output 117 [2018-11-10 12:57:19,975 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,005 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,005 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,015 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 144 treesize of output 166 [2018-11-10 12:57:20,018 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,019 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 40 treesize of output 63 [2018-11-10 12:57:20,019 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,035 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,055 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,057 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,060 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,065 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 314 treesize of output 259 [2018-11-10 12:57:20,067 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,068 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 172 treesize of output 97 [2018-11-10 12:57:20,068 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,087 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,087 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,094 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 104 treesize of output 122 [2018-11-10 12:57:20,096 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,097 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 51 [2018-11-10 12:57:20,098 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,110 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,124 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,127 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,133 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,137 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 412 treesize of output 368 [2018-11-10 12:57:20,147 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,147 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 239 treesize of output 144 [2018-11-10 12:57:20,148 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,178 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,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, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 178 [2018-11-10 12:57:20,190 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,191 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 40 treesize of output 63 [2018-11-10 12:57:20,192 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,209 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,227 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,230 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,232 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,237 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 384 treesize of output 338 [2018-11-10 12:57:20,241 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,241 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 217 treesize of output 132 [2018-11-10 12:57:20,241 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,269 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 166 [2018-11-10 12:57:20,281 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,282 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 40 treesize of output 63 [2018-11-10 12:57:20,282 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,298 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,316 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,318 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,321 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,326 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 352 treesize of output 285 [2018-11-10 12:57:20,329 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,329 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 203 treesize of output 108 [2018-11-10 12:57:20,329 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,352 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,358 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 120 treesize of output 138 [2018-11-10 12:57:20,360 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 51 [2018-11-10 12:57:20,362 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,377 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,396 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,400 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,402 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,407 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,415 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 357 treesize of output 292 [2018-11-10 12:57:20,418 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,419 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 235 treesize of output 130 [2018-11-10 12:57:20,420 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,453 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 110 treesize of output 128 [2018-11-10 12:57:20,456 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,458 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 51 [2018-11-10 12:57:20,458 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,486 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,512 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,515 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,517 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,523 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 384 treesize of output 323 [2018-11-10 12:57:20,526 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,527 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 217 treesize of output 132 [2018-11-10 12:57:20,527 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,556 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,578 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 144 treesize of output 166 [2018-11-10 12:57:20,586 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,588 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 40 treesize of output 63 [2018-11-10 12:57:20,588 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,628 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,646 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,650 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,655 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 306 treesize of output 243 [2018-11-10 12:57:20,658 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,658 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 172 treesize of output 97 [2018-11-10 12:57:20,659 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,678 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,685 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 107 treesize of output 125 [2018-11-10 12:57:20,688 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,689 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 51 [2018-11-10 12:57:20,689 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,705 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,720 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,724 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,729 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 311 treesize of output 248 [2018-11-10 12:57:20,732 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,732 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 164 treesize of output 89 [2018-11-10 12:57:20,733 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,759 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,767 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 112 treesize of output 130 [2018-11-10 12:57:20,770 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,771 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 51 [2018-11-10 12:57:20,772 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,789 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,806 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,809 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,812 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,817 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 391 treesize of output 336 [2018-11-10 12:57:20,820 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,820 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 192 treesize of output 117 [2018-11-10 12:57:20,821 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,847 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:57:20,848 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,856 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 141 treesize of output 163 [2018-11-10 12:57:20,858 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:57:20,859 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 40 treesize of output 63 [2018-11-10 12:57:20,860 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,875 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:20,893 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:57:21,373 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-11-10 12:57:21,373 INFO L202 ElimStorePlain]: Needed 56 recursive calls to eliminate 8 variables, input treesize:1219, output treesize:1442 [2018-11-10 12:57:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-11-10 12:57:21,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:57:26,697 WARN L179 SmtUtils]: Spent 4.51 s on a formula simplification that was a NOOP. DAG size: 62 [2018-11-10 12:57:33,560 WARN L179 SmtUtils]: Spent 5.47 s on a formula simplification that was a NOOP. DAG size: 112 [2018-11-10 12:57:33,564 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 12:57:33,567 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-11-10 12:57:44,836 WARN L179 SmtUtils]: Spent 9.02 s on a formula simplification that was a NOOP. DAG size: 158 [2018-11-10 12:57:44,839 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 12:57:44,843 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-11-10 12:58:01,973 WARN L179 SmtUtils]: Spent 16.67 s on a formula simplification that was a NOOP. DAG size: 154 [2018-11-10 12:58:10,810 WARN L179 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-11-10 12:58:11,145 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-11-10 12:58:18,509 WARN L179 SmtUtils]: Spent 7.21 s on a formula simplification. DAG size of input: 626 DAG size of output: 130 [2018-11-10 12:58:18,513 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:18,521 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-11-10 12:58:18,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-11-10 12:58:18,529 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-11-10 12:58:18,529 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:18,541 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:18,572 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:18,584 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-11-10 12:58:18,745 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 66 [2018-11-10 12:58:18,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 12:58:18,749 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:18,771 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:18,772 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:18,774 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:18,775 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:18,791 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 2781 [2018-11-10 12:58:18,794 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:18,794 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-11-10 12:58:18,795 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:18,832 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:18,836 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:18,837 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 2646 treesize of output 2654 [2018-11-10 12:58:18,922 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 12:58:18,922 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:18,925 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:18,925 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 4274 treesize of output 4142 [2018-11-10 12:58:18,926 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:18,929 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:18,929 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 2377 treesize of output 2279 [2018-11-10 12:58:18,930 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:18,963 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:18,966 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 2228 treesize of output 1965 [2018-11-10 12:58:18,968 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:18,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:18,970 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 17 treesize of output 12 [2018-11-10 12:58:18,970 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:18,984 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:18,984 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 1900 treesize of output 1875 [2018-11-10 12:58:18,985 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:18,992 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:18,997 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,005 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,013 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,118 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,122 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-11-10 12:58:19,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11-10 12:58:19,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-11-10 12:58:19,127 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,131 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,147 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,149 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,149 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 1090 treesize of output 534 [2018-11-10 12:58:19,172 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-11-10 12:58:19,172 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,181 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,182 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:19,182 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,183 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,185 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 426 treesize of output 225 [2018-11-10 12:58:19,189 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,191 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,198 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 54 [2018-11-10 12:58:19,198 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 12:58:19,220 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,220 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,221 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,223 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 194 treesize of output 140 [2018-11-10 12:58:19,287 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,288 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,288 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:19,289 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 39 treesize of output 56 [2018-11-10 12:58:19,289 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,309 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,311 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:19,328 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 78 treesize of output 95 [2018-11-10 12:58:19,331 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,344 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,346 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,347 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,347 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:19,348 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 76 treesize of output 109 [2018-11-10 12:58:19,348 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,384 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,385 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:19,386 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,386 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 66 treesize of output 73 [2018-11-10 12:58:19,386 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,417 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,419 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-11-10 12:58:19,421 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,421 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,422 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,422 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,423 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:19,423 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 24 treesize of output 32 [2018-11-10 12:58:19,424 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,432 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,433 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 23 treesize of output 10 [2018-11-10 12:58:19,433 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,437 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,458 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 67 [2018-11-10 12:58:19,472 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,472 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-11-10 12:58:19,473 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,509 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,510 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 43 treesize of output 30 [2018-11-10 12:58:19,510 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,533 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,534 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,534 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-11-10 12:58:19,535 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,558 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 34 [2018-11-10 12:58:19,567 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-11-10 12:58:19,599 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,603 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 20 treesize of output 22 [2018-11-10 12:58:19,604 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-11-10 12:58:19,615 INFO L267 ElimStorePlain]: Start of recursive call 31: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:58:19,626 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:58:19,630 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:58:19,633 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:58:19,637 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:58:19,646 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:58:19,711 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,730 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-11-10 12:58:19,734 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-11-10 12:58:19,738 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-11-10 12:58:19,738 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,748 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,775 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,785 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-11-10 12:58:19,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 12:58:19,868 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,887 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:19,888 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,889 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,891 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:19,911 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 2187 [2018-11-10 12:58:19,914 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,915 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-11-10 12:58:19,915 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:19,939 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:19,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:19,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 2094 treesize of output 1838 [2018-11-10 12:58:20,102 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2018-11-10 12:58:20,105 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,106 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:20,106 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 1564 treesize of output 1536 [2018-11-10 12:58:20,107 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,109 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,110 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:20,111 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 2823 treesize of output 2787 [2018-11-10 12:58:20,111 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,113 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 12:58:20,113 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,117 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,118 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:20,119 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 2016 treesize of output 1984 [2018-11-10 12:58:20,120 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,122 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 12:58:20,123 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,125 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 12:58:20,126 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,128 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 12:58:20,128 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,130 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 12:58:20,130 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,132 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 12:58:20,133 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,136 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,137 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:20,138 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 2371 treesize of output 2343 [2018-11-10 12:58:20,138 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,141 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 12:58:20,141 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,143 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 12:58:20,143 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,221 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,224 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:20,260 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 1483 treesize of output 1494 [2018-11-10 12:58:20,265 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,266 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:20,271 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 2050 treesize of output 2329 [2018-11-10 12:58:20,271 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,387 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,387 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,388 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,390 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:20,393 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 1214 treesize of output 1674 [2018-11-10 12:58:20,394 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,501 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,503 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,504 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,505 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:20,506 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,508 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,515 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 3144 treesize of output 2271 [2018-11-10 12:58:20,647 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 70 [2018-11-10 12:58:20,649 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,650 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:20,650 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 1502 treesize of output 1491 [2018-11-10 12:58:20,651 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,685 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,685 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,686 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,689 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:20,690 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 1427 treesize of output 1419 [2018-11-10 12:58:20,690 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,717 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,717 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,718 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,720 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:20,721 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-11-10 12:58:20,721 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,734 INFO L267 ElimStorePlain]: Start of recursive call 60: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,796 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,797 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:20,798 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,798 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 568 treesize of output 208 [2018-11-10 12:58:20,801 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,802 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,803 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:20,804 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,805 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,808 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,816 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 79 [2018-11-10 12:58:20,817 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 12:58:20,840 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,841 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:20,842 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 20 [2018-11-10 12:58:20,842 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,847 INFO L267 ElimStorePlain]: Start of recursive call 64: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,884 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,885 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,887 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:20,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 1930 treesize of output 2252 [2018-11-10 12:58:20,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2243 treesize of output 2237 [2018-11-10 12:58:20,907 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,950 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:20,951 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,951 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,952 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-11-10 12:58:20,952 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:20,991 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:20,992 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:20,995 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 1346 treesize of output 1339 [2018-11-10 12:58:20,996 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,029 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,030 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:21,031 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-11-10 12:58:21,031 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,060 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,060 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,061 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,064 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:21,065 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-11-10 12:58:21,065 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,091 INFO L267 ElimStorePlain]: Start of recursive call 67: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:58:21,115 INFO L267 ElimStorePlain]: Start of recursive call 57: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:58:21,117 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,118 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:21,140 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 1931 treesize of output 2668 [2018-11-10 12:58:21,143 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,144 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:21,147 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 456 [2018-11-10 12:58:21,147 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,173 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:21,190 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-11-10 12:58:21,193 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,193 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,194 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:21,197 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 2228 treesize of output 2224 [2018-11-10 12:58:21,198 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,227 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,228 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:21,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 1318 treesize of output 1309 [2018-11-10 12:58:21,229 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,252 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,253 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,256 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:21,263 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 663 treesize of output 673 [2018-11-10 12:58:21,263 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 2 xjuncts. [2018-11-10 12:58:21,291 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,292 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,293 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:21,293 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 643 treesize of output 634 [2018-11-10 12:58:21,293 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,309 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 1304 treesize of output 1300 [2018-11-10 12:58:21,310 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,321 INFO L267 ElimStorePlain]: Start of recursive call 75: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:58:21,336 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:58:21,363 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 12:58:21,392 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 12:58:21,424 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 12:58:21,461 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 12:58:21,535 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,539 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-11-10 12:58:21,542 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-11-10 12:58:21,544 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-11-10 12:58:21,544 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,547 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,562 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,565 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,565 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 755 treesize of output 375 [2018-11-10 12:58:21,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11-10 12:58:21,602 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,613 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,613 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,614 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:21,614 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,616 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,617 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 291 treesize of output 171 [2018-11-10 12:58:21,621 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,631 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 106 [2018-11-10 12:58:21,632 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 12:58:21,654 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,655 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,655 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,657 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 139 treesize of output 111 [2018-11-10 12:58:21,687 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,689 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,691 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,692 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:21,700 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 104 [2018-11-10 12:58:21,701 INFO L267 ElimStorePlain]: Start of recursive call 89: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 12:58:21,702 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 12:58:21,702 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,703 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 12:58:21,704 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,706 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,708 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,711 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,712 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:21,720 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 97 [2018-11-10 12:58:21,721 INFO L267 ElimStorePlain]: Start of recursive call 92: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 12:58:21,754 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,755 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 44 treesize of output 37 [2018-11-10 12:58:21,757 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,758 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:21,758 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 17 treesize of output 12 [2018-11-10 12:58:21,758 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,765 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-11-10 12:58:21,766 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,768 INFO L267 ElimStorePlain]: Start of recursive call 93: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,771 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,773 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,776 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,782 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,784 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,787 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 654 treesize of output 405 [2018-11-10 12:58:21,789 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-11-10 12:58:21,792 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-11-10 12:58:21,793 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,796 INFO L267 ElimStorePlain]: Start of recursive call 97: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,811 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,814 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,814 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 368 treesize of output 196 [2018-11-10 12:58:21,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 18 treesize of output 16 [2018-11-10 12:58:21,837 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,847 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,847 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,848 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:21,849 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,853 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,855 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 152 treesize of output 114 [2018-11-10 12:58:21,861 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,871 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 47 [2018-11-10 12:58:21,872 INFO L267 ElimStorePlain]: Start of recursive call 102: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 12:58:21,899 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,900 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,905 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,908 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 80 treesize of output 82 [2018-11-10 12:58:21,935 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,937 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,939 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,940 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:21,949 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 87 [2018-11-10 12:58:21,950 INFO L267 ElimStorePlain]: Start of recursive call 104: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 12:58:21,977 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,978 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 41 treesize of output 34 [2018-11-10 12:58:21,980 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,981 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:58:21,981 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-11-10 12:58:21,981 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,988 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:58:21,989 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 3 [2018-11-10 12:58:21,989 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,990 INFO L267 ElimStorePlain]: Start of recursive call 105: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,992 INFO L267 ElimStorePlain]: Start of recursive call 103: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,994 INFO L267 ElimStorePlain]: Start of recursive call 101: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:21,995 INFO L267 ElimStorePlain]: Start of recursive call 99: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:22,002 INFO L267 ElimStorePlain]: Start of recursive call 96: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:58:22,047 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-11-10 12:58:22,047 INFO L202 ElimStorePlain]: Needed 107 recursive calls to eliminate 28 variables, input treesize:22625, output treesize:33 [2018-11-10 12:58:22,115 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-10 12:58:22,118 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-11-10 12:59:32,611 WARN L179 SmtUtils]: Spent 7.03 s on a formula simplification that was a NOOP. DAG size: 210 [2018-11-10 12:59:32,615 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-10 12:59:32,619 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2018-11-10 13:00:48,647 WARN L179 SmtUtils]: Spent 8.17 s on a formula simplification that was a NOOP. DAG size: 208 [2018-11-10 13:00:48,655 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-10 13:00:48,662 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2018-11-10 13:01:16,467 WARN L179 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 222 [2018-11-10 13:01:16,471 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-10 13:01:16,477 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-11-10 13:01:19,051 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 220 [2018-11-10 13:01:19,054 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-10 13:01:19,060 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-11-10 13:01:19,078 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-10 13:01:19,088 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-11-10 13:01:21,449 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 220 [2018-11-10 13:01:21,454 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-10 13:01:21,460 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-11-10 13:01:21,515 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 8589 [2018-11-10 13:01:21,716 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:01:21,717 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-11-10 13:01:21,720 INFO L168 Benchmark]: Toolchain (without parser) took 425055.05 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 420.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 256.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:01:21,720 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:01:21,720 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.03 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 927.0 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:01:21,721 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 927.0 MB in the beginning and 1.1 GB in the end (delta: -220.7 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:01:21,721 INFO L168 Benchmark]: Boogie Preprocessor took 20.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:01:21,721 INFO L168 Benchmark]: RCFGBuilder took 334.63 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.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-11-10 13:01:21,721 INFO L168 Benchmark]: TraceAbstraction took 424269.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 265.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -8.8 MB). Peak memory consumption was 257.1 MB. Max. memory is 11.5 GB. [2018-11-10 13:01:21,723 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 340.03 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 927.0 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 927.0 MB in the beginning and 1.1 GB in the end (delta: -220.7 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 334.63 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.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 424269.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 265.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -8.8 MB). Peak memory consumption was 257.1 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-11-10 13:01:23,264 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:01:23,265 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:01:23,274 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:01:23,275 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:01:23,275 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:01:23,276 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:01:23,277 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:01:23,279 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:01:23,279 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:01:23,280 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:01:23,280 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:01:23,281 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:01:23,282 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:01:23,283 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:01:23,284 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:01:23,284 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:01:23,286 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:01:23,288 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:01:23,289 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:01:23,290 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:01:23,291 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:01:23,293 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:01:23,293 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:01:23,294 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:01:23,294 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:01:23,295 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:01:23,296 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:01:23,296 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:01:23,297 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:01:23,298 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:01:23,298 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:01:23,298 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:01:23,298 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:01:23,299 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:01:23,300 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:01:23,300 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 13:01:23,312 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:01:23,312 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:01:23,312 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:01:23,313 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 13:01:23,313 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 13:01:23,314 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 13:01:23,314 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 13:01:23,314 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 13:01:23,314 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:01:23,315 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:01:23,315 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:01:23,315 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:01:23,315 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:01:23,315 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:01:23,315 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:01:23,316 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 13:01:23,316 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 13:01:23,316 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:01:23,316 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:01:23,316 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:01:23,316 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:01:23,317 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:01:23,317 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:01:23,317 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:01:23,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:01:23,319 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:01:23,319 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:01:23,319 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:01:23,319 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 13:01:23,319 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:01:23,320 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 13:01:23,320 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 13:01:23,320 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_1eb656d9-a716-42c6-aafb-2fece1117e55/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-11-10 13:01:23,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:01:23,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:01:23,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:01:23,366 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:01:23,366 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:01:23,366 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-10 13:01:23,418 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/data/26acb8fab/1ae8d54f208145cea2dd6d16742e96af/FLAGa1d4850bc [2018-11-10 13:01:23,779 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:01:23,779 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-10 13:01:23,786 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/data/26acb8fab/1ae8d54f208145cea2dd6d16742e96af/FLAGa1d4850bc [2018-11-10 13:01:23,795 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/data/26acb8fab/1ae8d54f208145cea2dd6d16742e96af [2018-11-10 13:01:23,797 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:01:23,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:01:23,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:01:23,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:01:23,807 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:01:23,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:01:23" (1/1) ... [2018-11-10 13:01:23,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e6af860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:23, skipping insertion in model container [2018-11-10 13:01:23,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:01:23" (1/1) ... [2018-11-10 13:01:23,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:01:23,845 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:01:24,073 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:01:24,082 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:01:24,121 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:01:24,149 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:01:24,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:24 WrapperNode [2018-11-10 13:01:24,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:01:24,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:01:24,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:01:24,151 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:01:24,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:24" (1/1) ... [2018-11-10 13:01:24,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:24" (1/1) ... [2018-11-10 13:01:24,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:01:24,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:01:24,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:01:24,238 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:01:24,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:24" (1/1) ... [2018-11-10 13:01:24,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:24" (1/1) ... [2018-11-10 13:01:24,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:24" (1/1) ... [2018-11-10 13:01:24,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:24" (1/1) ... [2018-11-10 13:01:24,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:24" (1/1) ... [2018-11-10 13:01:24,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:24" (1/1) ... [2018-11-10 13:01:24,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:24" (1/1) ... [2018-11-10 13:01:24,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:01:24,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:01:24,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:01:24,271 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:01:24,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:01:24,308 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-11-10 13:01:24,308 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-11-10 13:01:24,308 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 13:01:24,308 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-10 13:01:24,308 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-10 13:01:24,308 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-10 13:01:24,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:01:24,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:01:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:01:24,309 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:01:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_remove_last [2018-11-10 13:01:24,309 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_remove_last [2018-11-10 13:01:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:01:24,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:01:24,651 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:01:24,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:01:24 BoogieIcfgContainer [2018-11-10 13:01:24,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:01:24,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:01:24,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:01:24,655 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:01:24,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:01:23" (1/3) ... [2018-11-10 13:01:24,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6d37ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:01:24, skipping insertion in model container [2018-11-10 13:01:24,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:24" (2/3) ... [2018-11-10 13:01:24,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6d37ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:01:24, skipping insertion in model container [2018-11-10 13:01:24,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:01:24" (3/3) ... [2018-11-10 13:01:24,658 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-10 13:01:24,667 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:01:24,673 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 13:01:24,685 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 13:01:24,703 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:01:24,704 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:01:24,704 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:01:24,704 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:01:24,704 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:01:24,704 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:01:24,704 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:01:24,704 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:01:24,704 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:01:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-10 13:01:24,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 13:01:24,719 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:01:24,719 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:01:24,721 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:01:24,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:01:24,725 INFO L82 PathProgramCache]: Analyzing trace with hash -613250840, now seen corresponding path program 1 times [2018-11-10 13:01:24,728 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:01:24,728 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:01:24,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:01:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:01:24,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:01:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:01:24,831 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-10 13:01:24,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:01:24,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:01:24,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 13:01:24,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 13:01:24,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:01:24,847 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-10 13:01:24,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:01:24,863 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-11-10 13:01:24,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:01:24,864 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-10 13:01:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:01:24,870 INFO L225 Difference]: With dead ends: 64 [2018-11-10 13:01:24,870 INFO L226 Difference]: Without dead ends: 37 [2018-11-10 13:01:24,872 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-11-10 13:01:24,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-10 13:01:24,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-10 13:01:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 13:01:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-10 13:01:24,904 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 24 [2018-11-10 13:01:24,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:01:24,905 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-10 13:01:24,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 13:01:24,906 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-10 13:01:24,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 13:01:24,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:01:24,908 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-11-10 13:01:24,908 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:01:24,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:01:24,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1120811875, now seen corresponding path program 1 times [2018-11-10 13:01:24,909 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:01:24,909 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:01:24,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:01:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:01:25,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:01:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:01:25,048 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:01:25,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:01:25,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:01:25,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:01:25,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:01:25,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:01:25,052 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2018-11-10 13:01:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:01:25,105 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-11-10 13:01:25,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:01:25,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-10 13:01:25,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:01:25,107 INFO L225 Difference]: With dead ends: 59 [2018-11-10 13:01:25,107 INFO L226 Difference]: Without dead ends: 43 [2018-11-10 13:01:25,108 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-11-10 13:01:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-10 13:01:25,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-11-10 13:01:25,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-10 13:01:25,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-10 13:01:25,116 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2018-11-10 13:01:25,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:01:25,116 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-10 13:01:25,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:01:25,117 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-10 13:01:25,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 13:01:25,119 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:01:25,119 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-11-10 13:01:25,119 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:01:25,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:01:25,120 INFO L82 PathProgramCache]: Analyzing trace with hash -10678655, now seen corresponding path program 1 times [2018-11-10 13:01:25,120 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:01:25,120 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:01:25,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:01:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:01:25,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:01:25,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:01:25,293 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:01:25,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:01:25,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:01:25,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:01:25,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:01:25,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:01:25,296 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2018-11-10 13:01:25,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:01:25,323 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-10 13:01:25,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:01:25,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-10 13:01:25,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:01:25,325 INFO L225 Difference]: With dead ends: 47 [2018-11-10 13:01:25,325 INFO L226 Difference]: Without dead ends: 43 [2018-11-10 13:01:25,325 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-11-10 13:01:25,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-10 13:01:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-10 13:01:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 13:01:25,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-10 13:01:25,332 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 37 [2018-11-10 13:01:25,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:01:25,333 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-10 13:01:25,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:01:25,333 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-10 13:01:25,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 13:01:25,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:01:25,334 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-11-10 13:01:25,334 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:01:25,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:01:25,335 INFO L82 PathProgramCache]: Analyzing trace with hash 204905672, now seen corresponding path program 1 times [2018-11-10 13:01:25,335 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:01:25,335 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:01:25,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:01:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:01:25,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:01:25,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:01:25,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:01:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:01:25,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:01:25,665 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:01:25,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:01:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:01:25,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:01:25,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:01:25,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:01:25,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:25,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:25,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:01:25,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:01:25,801 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:25,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:25,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:25,810 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-11-10 13:01:25,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 13:01:25,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 13:01:25,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:25,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:25,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 13:01:25,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 13:01:25,882 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:25,885 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:25,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:25,890 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-11-10 13:01:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:01:25,916 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:01:25,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:01:25,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 5] total 12 [2018-11-10 13:01:25,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 13:01:25,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 13:01:25,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-10 13:01:25,936 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 12 states. [2018-11-10 13:01:26,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:01:26,561 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2018-11-10 13:01:26,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 13:01:26,561 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-11-10 13:01:26,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:01:26,563 INFO L225 Difference]: With dead ends: 66 [2018-11-10 13:01:26,563 INFO L226 Difference]: Without dead ends: 60 [2018-11-10 13:01:26,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-11-10 13:01:26,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-10 13:01:26,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 47. [2018-11-10 13:01:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 13:01:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-10 13:01:26,570 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 45 [2018-11-10 13:01:26,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:01:26,570 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-10 13:01:26,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 13:01:26,570 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-10 13:01:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 13:01:26,571 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:01:26,571 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-11-10 13:01:26,573 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:01:26,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:01:26,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1831195153, now seen corresponding path program 1 times [2018-11-10 13:01:26,574 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:01:26,574 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:01:26,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:01:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:01:26,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:01:26,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 13:01:26,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:26,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:26,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 13:01:27,005 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:27,006 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:27,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-10 13:01:27,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:27,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:27,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-10 13:01:27,083 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-11-10 13:01:27,086 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-11-10 13:01:27,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:27,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:27,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:27,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-11-10 13:01:27,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:01:27,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:01:27,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:27,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:27,232 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-11-10 13:01:27,236 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-11-10 13:01:27,236 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:27,273 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:27,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:27,282 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-11-10 13:01:27,458 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 13:01:27,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:01:28,152 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-11-10 13:01:28,262 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-11-10 13:01:28,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:28,278 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-11-10 13:01:28,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 13:01:28,307 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:28,317 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-11-10 13:01:28,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 13:01:28,319 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:28,321 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:28,326 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:28,334 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-11-10 13:01:28,334 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:42, output treesize:6 [2018-11-10 13:01:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 13:01:28,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:01:28,817 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:01:28,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:01:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:01:28,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:01:29,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:01:29,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:01:29,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:29,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:29,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:01:29,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:01:29,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:29,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:29,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:29,042 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-11-10 13:01:29,216 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-11-10 13:01:29,696 WARN L179 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2018-11-10 13:01:29,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, 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-11-10 13:01:29,748 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-11-10 13:01:29,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:29,918 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-11-10 13:01:29,928 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-11-10 13:01:29,929 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:30,803 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-11-10 13:01:30,803 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-10 13:01:30,958 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:01:31,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:01:31,126 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-11-10 13:01:31,130 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-11-10 13:01:31,130 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:31,165 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:01:31,179 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-11-10 13:01:31,184 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-11-10 13:01:31,184 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:31,194 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:31,208 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:31,225 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-11-10 13:01:31,229 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-11-10 13:01:31,229 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:31,259 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:31,317 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-11-10 13:01:31,326 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-11-10 13:01:31,327 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:31,760 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-11-10 13:01:31,761 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-10 13:01:31,814 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:01:31,862 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:01:31,928 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-11-10 13:01:31,929 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:181, output treesize:99 [2018-11-10 13:01:32,040 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-11-10 13:01:32,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 13:01:32,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:32,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:32,055 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-11-10 13:01:32,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 13:01:32,058 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:32,060 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:32,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:32,065 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7 [2018-11-10 13:01:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2018-11-10 13:01:32,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:01:32,407 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-10 13:01:32,643 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-10 13:01:33,120 WARN L179 SmtUtils]: Spent 476.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-10 13:01:33,528 WARN L179 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-10 13:01:33,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:01:33,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 10] total 34 [2018-11-10 13:01:33,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-10 13:01:33,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-10 13:01:33,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1096, Unknown=8, NotChecked=66, Total=1260 [2018-11-10 13:01:33,808 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 34 states. [2018-11-10 13:01:39,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:01:39,632 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2018-11-10 13:01:39,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 13:01:39,632 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 53 [2018-11-10 13:01:39,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:01:39,633 INFO L225 Difference]: With dead ends: 81 [2018-11-10 13:01:39,633 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 13:01:39,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 129 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=267, Invalid=2869, Unknown=60, NotChecked=110, Total=3306 [2018-11-10 13:01:39,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 13:01:39,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-10 13:01:39,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 13:01:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-10 13:01:39,641 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 53 [2018-11-10 13:01:39,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:01:39,641 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-10 13:01:39,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-10 13:01:39,642 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-10 13:01:39,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 13:01:39,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:01:39,642 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-11-10 13:01:39,642 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:01:39,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:01:39,643 INFO L82 PathProgramCache]: Analyzing trace with hash 242847251, now seen corresponding path program 1 times [2018-11-10 13:01:39,643 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:01:39,643 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:01:39,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:01:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:01:40,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:01:40,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 13:01:40,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 13:01:40,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:01:40,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:01:40,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:01:40,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:01:40,323 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,337 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-11-10 13:01:40,428 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-11-10 13:01:40,433 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-11-10 13:01:40,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,463 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:40,479 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-11-10 13:01:40,483 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-11-10 13:01:40,483 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,561 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-11-10 13:01:40,565 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-11-10 13:01:40,565 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,587 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:40,597 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:40,598 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-11-10 13:01:40,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-10 13:01:40,603 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,621 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,635 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,671 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:89, output treesize:100 [2018-11-10 13:01:40,790 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:40,793 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:40,795 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:40,796 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-11-10 13:01:40,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:92, output treesize:86 [2018-11-10 13:01:40,932 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-11-10 13:01:40,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:01:40,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:40,990 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:41,002 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-11-10 13:01:41,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:01:41,007 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:41,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:41,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:41,065 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:138 [2018-11-10 13:01:41,323 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-11-10 13:01:41,361 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-11-10 13:01:41,371 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-10 13:01:41,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:41,685 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:41,685 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:01:41,846 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:01:41,935 INFO L303 Elim1Store]: Index analysis took 278 ms [2018-11-10 13:01:41,936 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-11-10 13:01:41,943 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:01:41,944 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-11-10 13:01:41,944 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:42,047 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:42,051 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:42,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:42,057 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:01:42,158 INFO L303 Elim1Store]: Index analysis took 135 ms [2018-11-10 13:01:42,158 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-11-10 13:01:42,165 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:42,169 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-11-10 13:01:42,170 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:42,240 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:42,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:42,413 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:01:42,416 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:42,424 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:42,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:42,462 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-11-10 13:01:42,476 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:01:42,533 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-11-10 13:01:42,539 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-10 13:01:43,450 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:43,454 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:43,506 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-11-10 13:01:43,515 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:43,526 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:43,529 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:43,535 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:43,611 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-11-10 13:01:43,621 INFO L267 ElimStorePlain]: Start of recursive call 10: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-11-10 13:01:44,150 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-10 13:01:44,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:44,169 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:44,202 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-11-10 13:01:44,215 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:44,227 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:44,230 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:44,324 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-11-10 13:01:44,328 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-11-10 13:01:44,456 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:01:44,521 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-11-10 13:01:44,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:44,548 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-11-10 13:01:44,549 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:44,600 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:45,385 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-11-10 13:01:46,920 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-11-10 13:01:46,920 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:1221, output treesize:954 [2018-11-10 13:01:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-11-10 13:01:47,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:01:49,190 WARN L179 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-11-10 13:01:49,597 WARN L179 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-10 13:01:50,249 WARN L179 SmtUtils]: Spent 650.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-10 13:01:50,807 WARN L179 SmtUtils]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-11-10 13:02:02,161 WARN L179 SmtUtils]: Spent 10.71 s on a formula simplification that was a NOOP. DAG size: 62 [2018-11-10 13:02:02,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:02:02,165 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/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-11-10 13:02:02,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:02:02,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:02:02,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 13:02:02,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 13:02:02,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:02:02,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:02:02,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:02:02,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:02:02,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,298 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,311 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-11-10 13:02:02,333 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-11-10 13:02:02,340 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-11-10 13:02:02,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,397 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:02,420 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:02,421 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-11-10 13:02:02,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-10 13:02:02,429 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,525 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-11-10 13:02:02,530 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-11-10 13:02:02,530 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,551 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:02,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 51 [2018-11-10 13:02:02,561 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-11-10 13:02:02,561 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,571 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,579 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,603 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:89, output treesize:100 [2018-11-10 13:02:02,633 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:02,634 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:02,635 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:02,636 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-11-10 13:02:02,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:94, output treesize:86 [2018-11-10 13:02:02,698 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-11-10 13:02:02,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:02:02,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,761 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:02,774 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-11-10 13:02:02,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:02:02,780 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:02:02,834 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:138 [2018-11-10 13:02:02,858 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-11-10 13:02:02,872 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:02:02,960 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:02:02,983 INFO L303 Elim1Store]: Index analysis took 118 ms [2018-11-10 13:02:02,984 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-11-10 13:02:02,991 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:02:02,992 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-11-10 13:02:02,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:02:03,191 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:03,195 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:03,196 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:02:03,263 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-11-10 13:02:03,270 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:03,274 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-11-10 13:02:03,274 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:02:03,336 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:02:03,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:02:04,677 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:02:04,681 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:04,689 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:04,746 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:04,755 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-11-10 13:02:04,762 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:02:04,820 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-11-10 13:02:04,824 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-10 13:02:05,723 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:05,758 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-11-10 13:02:05,767 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:05,771 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-11-10 13:02:05,771 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 13:02:05,813 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:02:05,820 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:05,823 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:05,855 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-11-10 13:02:05,868 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:05,871 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:05,875 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:05,886 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:05,962 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-11-10 13:02:05,968 INFO L267 ElimStorePlain]: Start of recursive call 11: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-11-10 13:02:06,558 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-10 13:02:06,580 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:06,583 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:06,625 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-11-10 13:02:06,637 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:06,641 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:06,645 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:02:06,750 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-11-10 13:02:06,753 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-11-10 13:02:06,892 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:02:07,700 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-11-10 13:02:10,501 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-11-10 13:02:10,502 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:1221, output treesize:956 [2018-11-10 13:02:10,739 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-11-10 13:02:10,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:02:11,569 WARN L179 SmtUtils]: Spent 635.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-11-10 13:02:12,110 WARN L179 SmtUtils]: Spent 540.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-10 13:02:12,800 WARN L179 SmtUtils]: Spent 689.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-10 13:02:13,374 WARN L179 SmtUtils]: Spent 573.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-11-10 13:02:13,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:02:13,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-10 13:02:13,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-10 13:02:13,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 13:02:13,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=589, Unknown=4, NotChecked=150, Total=812 [2018-11-10 13:02:13,652 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 25 states. [2018-11-10 13:02:15,014 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-11-10 13:02:16,706 WARN L179 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-11-10 13:02:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:02:17,788 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2018-11-10 13:02:17,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 13:02:17,789 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 53 [2018-11-10 13:02:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:02:17,789 INFO L225 Difference]: With dead ends: 78 [2018-11-10 13:02:17,790 INFO L226 Difference]: Without dead ends: 53 [2018-11-10 13:02:17,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=139, Invalid=1198, Unknown=7, NotChecked=216, Total=1560 [2018-11-10 13:02:17,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-10 13:02:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-11-10 13:02:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-10 13:02:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-11-10 13:02:17,800 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 53 [2018-11-10 13:02:17,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:02:17,800 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-11-10 13:02:17,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-10 13:02:17,801 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-10 13:02:17,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 13:02:17,802 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:02:17,803 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-11-10 13:02:17,803 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:02:17,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:17,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1629050645, now seen corresponding path program 1 times [2018-11-10 13:02:17,804 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:02:17,804 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:02:17,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:02:17,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:02:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:02:17,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:02:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:02:17,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:02:17,986 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/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-11-10 13:02:17,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:02:18,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:02:18,035 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:02:18,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:02:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:02:18,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 13:02:18,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 6 [2018-11-10 13:02:18,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:02:18,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:02:18,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:02:18,151 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 6 states. [2018-11-10 13:02:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:02:18,239 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-11-10 13:02:18,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:02:18,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-11-10 13:02:18,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:02:18,242 INFO L225 Difference]: With dead ends: 84 [2018-11-10 13:02:18,242 INFO L226 Difference]: Without dead ends: 51 [2018-11-10 13:02:18,242 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-11-10 13:02:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-10 13:02:18,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-10 13:02:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-10 13:02:18,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-11-10 13:02:18,249 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 53 [2018-11-10 13:02:18,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:02:18,249 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-11-10 13:02:18,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:02:18,250 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-10 13:02:18,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 13:02:18,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:02:18,250 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-11-10 13:02:18,250 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:02:18,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:18,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1790818357, now seen corresponding path program 2 times [2018-11-10 13:02:18,251 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:02:18,251 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:02:18,265 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 13:02:18,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 13:02:18,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:02:18,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:02:18,629 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 13:02:18,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:02:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 13:02:18,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:02:18,742 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/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-11-10 13:02:18,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 13:02:19,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 13:02:19,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:02:19,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:02:19,672 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 13:02:19,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:02:19,727 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 13:02:19,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 13:02:19,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-11-10 13:02:19,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:02:19,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:02:19,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:02:19,751 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 9 states. [2018-11-10 13:02:19,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:02:19,824 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-10 13:02:19,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:02:19,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-11-10 13:02:19,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:02:19,825 INFO L225 Difference]: With dead ends: 55 [2018-11-10 13:02:19,825 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 13:02:19,826 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-11-10 13:02:19,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 13:02:19,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 13:02:19,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 13:02:19,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 13:02:19,826 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2018-11-10 13:02:19,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:02:19,827 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:02:19,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:02:19,827 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:02:19,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 13:02:19,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 13:02:19,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:02:20,474 WARN L179 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2018-11-10 13:02:20,938 WARN L179 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2018-11-10 13:02:21,207 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-11-10 13:02:21,223 INFO L425 ceAbstractionStarter]: For program point L592(lines 592 600) no Hoare annotation was computed. [2018-11-10 13:02:21,223 INFO L425 ceAbstractionStarter]: For program point L592-2(lines 590 601) no Hoare annotation was computed. [2018-11-10 13:02:21,223 INFO L425 ceAbstractionStarter]: For program point dll_circular_remove_lastEXIT(lines 590 601) no Hoare annotation was computed. [2018-11-10 13:02:21,223 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-11-10 13:02:21,223 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 561 563) no Hoare annotation was computed. [2018-11-10 13:02:21,223 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 561 563) the Hoare annotation is: true [2018-11-10 13:02:21,223 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 561 563) no Hoare annotation was computed. [2018-11-10 13:02:21,223 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-10 13:02:21,223 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:02:21,223 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-11-10 13:02:21,223 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:02:21,223 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:02:21,223 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 13:02:21,224 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 13:02:21,224 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:02:21,224 INFO L425 ceAbstractionStarter]: For program point L607-1(lines 607 609) no Hoare annotation was computed. [2018-11-10 13:02:21,224 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-11-10 13:02:21,224 INFO L425 ceAbstractionStarter]: For program point L605-1(line 605) no Hoare annotation was computed. [2018-11-10 13:02:21,224 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-11-10 13:02:21,224 INFO L425 ceAbstractionStarter]: For program point L607-4(lines 607 609) no Hoare annotation was computed. [2018-11-10 13:02:21,224 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 602 616) no Hoare annotation was computed. [2018-11-10 13:02:21,224 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 602 616) no Hoare annotation was computed. [2018-11-10 13:02:21,224 INFO L425 ceAbstractionStarter]: For program point L610(lines 610 612) no Hoare annotation was computed. [2018-11-10 13:02:21,224 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-11-10 13:02:21,225 INFO L425 ceAbstractionStarter]: For program point L608-1(lines 607 609) no Hoare annotation was computed. [2018-11-10 13:02:21,225 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-11-10 13:02:21,225 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 614) no Hoare annotation was computed. [2018-11-10 13:02:21,225 INFO L421 ceAbstractionStarter]: At program point L611(lines 602 616) the Hoare annotation is: false [2018-11-10 13:02:21,225 INFO L425 ceAbstractionStarter]: For program point L578-1(line 578) no Hoare annotation was computed. [2018-11-10 13:02:21,225 INFO L425 ceAbstractionStarter]: For program point dll_circular_createEXIT(lines 574 589) no Hoare annotation was computed. [2018-11-10 13:02:21,225 INFO L425 ceAbstractionStarter]: For program point L577-1(lines 577 585) no Hoare annotation was computed. [2018-11-10 13:02:21,225 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-11-10 13:02:21,225 INFO L425 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-11-10 13:02:21,225 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-11-10 13:02:21,225 INFO L425 ceAbstractionStarter]: For program point L577-4(lines 577 585) no Hoare annotation was computed. [2018-11-10 13:02:21,225 INFO L425 ceAbstractionStarter]: For program point dll_circular_createFINAL(lines 574 589) no Hoare annotation was computed. [2018-11-10 13:02:21,225 INFO L425 ceAbstractionStarter]: For program point L580(lines 580 582) no Hoare annotation was computed. [2018-11-10 13:02:21,225 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-11-10 13:02:21,226 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-11-10 13:02:21,226 INFO L425 ceAbstractionStarter]: For program point L580-2(lines 580 582) no Hoare annotation was computed. [2018-11-10 13:02:21,226 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-11-10 13:02:21,226 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 564 573) no Hoare annotation was computed. [2018-11-10 13:02:21,226 INFO L428 ceAbstractionStarter]: At program point L567(line 567) the Hoare annotation is: true [2018-11-10 13:02:21,226 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-11-10 13:02:21,226 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 564 573) no Hoare annotation was computed. [2018-11-10 13:02:21,226 INFO L425 ceAbstractionStarter]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2018-11-10 13:02:21,235 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,236 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,236 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,236 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,236 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,237 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,237 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,237 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,237 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,237 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,238 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,238 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,238 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,238 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,239 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,239 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,239 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,239 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,239 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,240 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,240 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,240 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,240 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,241 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,241 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,241 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,241 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,241 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,242 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,242 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,242 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,242 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,243 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,243 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,243 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,243 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,244 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,244 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,244 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,244 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,244 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,245 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,245 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,246 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,247 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,247 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,247 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,247 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,247 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,247 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,248 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,248 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,248 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,248 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,249 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,249 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,249 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,249 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,249 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,249 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,250 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,252 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,252 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,253 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,253 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,254 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,254 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,257 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,257 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,257 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,257 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,257 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,257 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,258 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,258 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,258 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,258 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,260 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,260 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,260 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,260 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,260 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,265 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,267 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,267 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,267 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,267 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,267 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,268 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,268 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,268 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,268 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,268 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,269 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,269 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,269 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,269 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,269 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,270 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,270 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,270 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,270 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,270 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,270 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,271 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,271 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,271 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,271 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,271 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,272 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,272 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,272 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,272 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,272 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,272 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,273 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,273 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,273 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,273 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,273 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,274 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,274 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,274 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,274 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,274 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,274 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,275 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,275 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,275 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,275 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,275 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,276 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,276 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,276 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,276 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,276 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,276 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,277 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,277 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,277 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,277 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,277 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,277 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,278 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,278 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,280 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,280 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,280 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,280 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,280 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,281 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,281 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,281 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,281 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,281 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,281 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,283 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,283 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,283 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,283 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,283 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,284 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,284 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,284 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,284 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,284 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,284 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,285 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,285 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,285 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,285 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,285 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,286 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,286 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,286 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,286 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,286 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,286 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,287 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,287 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,287 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,287 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,291 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,292 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,292 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,293 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,293 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,294 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,294 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,294 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,295 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,295 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,295 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,296 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,296 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,296 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:02:21 BoogieIcfgContainer [2018-11-10 13:02:21,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:02:21,298 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:02:21,299 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:02:21,299 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:02:21,299 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:01:24" (3/4) ... [2018-11-10 13:02:21,303 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 13:02:21,309 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_remove_last [2018-11-10 13:02:21,309 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exit [2018-11-10 13:02:21,309 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 13:02:21,309 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 13:02:21,310 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_create [2018-11-10 13:02:21,310 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-11-10 13:02:21,315 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2018-11-10 13:02:21,315 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2018-11-10 13:02:21,315 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 13:02:21,341 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-11-10 13:02:21,341 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-11-10 13:02:21,364 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1eb656d9-a716-42c6-aafb-2fece1117e55/bin-2019/utaipan/witness.graphml [2018-11-10 13:02:21,365 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:02:21,365 INFO L168 Benchmark]: Toolchain (without parser) took 57567.55 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 330.8 MB). Free memory was 943.3 MB in the beginning and 965.5 MB in the end (delta: -22.2 MB). Peak memory consumption was 308.6 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:21,366 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:02:21,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.31 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 916.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:21,366 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 916.5 MB in the beginning and 1.1 GB in the end (delta: -193.8 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:21,367 INFO L168 Benchmark]: Boogie Preprocessor took 32.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:21,367 INFO L168 Benchmark]: RCFGBuilder took 381.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:21,367 INFO L168 Benchmark]: TraceAbstraction took 56645.55 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 213.9 MB). Free memory was 1.1 GB in the beginning and 976.1 MB in the end (delta: 88.1 MB). Peak memory consumption was 302.0 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:21,367 INFO L168 Benchmark]: Witness Printer took 66.18 ms. Allocated memory is still 1.4 GB. Free memory was 976.1 MB in the beginning and 965.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:21,372 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 351.31 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 916.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 916.5 MB in the beginning and 1.1 GB in the end (delta: -193.8 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 381.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 56645.55 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 213.9 MB). Free memory was 1.1 GB in the beginning and 976.1 MB in the end (delta: 88.1 MB). Peak memory consumption was 302.0 MB. Max. memory is 11.5 GB. * Witness Printer took 66.18 ms. Allocated memory is still 1.4 GB. Free memory was 976.1 MB in the beginning and 965.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. 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-11-10 13:02:21,379 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,379 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,379 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,379 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,380 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,380 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,380 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,380 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,380 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,381 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,381 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,381 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,381 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,381 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,382 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,382 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,382 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,382 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,382 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,383 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,383 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,383 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,383 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,384 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,384 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,384 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,384 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,384 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,385 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,385 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,385 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,385 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,385 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,386 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,386 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,388 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,388 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,388 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,388 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,388 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,388 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,389 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,389 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,389 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,389 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,389 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,389 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,390 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,390 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,390 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,390 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,391 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,391 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,391 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,392 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,392 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,392 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,392 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,392 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,392 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,393 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,393 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,393 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,393 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,393 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,395 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,395 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,395 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,395 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,395 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,396 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,396 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,396 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,396 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,396 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,396 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,397 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,397 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,397 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,397 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,397 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,397 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,398 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,398 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,398 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,398 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,398 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,398 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,399 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,399 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,399 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,399 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,399 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,399 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,400 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,400 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,400 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,401 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,401 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,401 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,401 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,401 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,402 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,402 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,402 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,402 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,402 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,402 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,403 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,403 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,403 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,403 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,403 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,403 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,404 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,404 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,404 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,404 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_37,QUANTIFIED] [2018-11-10 13:02:21,404 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,405 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,405 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,405 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,405 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,405 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,405 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,405 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,406 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,406 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,406 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,406 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,406 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,407 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,407 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,407 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,407 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,407 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,407 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,408 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,408 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,408 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,408 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,408 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,408 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,409 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,409 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,409 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,409 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,409 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,409 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,410 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,410 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,410 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,410 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,410 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,410 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,411 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,411 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,411 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,412 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,412 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,412 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,412 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,412 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,413 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,413 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,413 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,413 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,413 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,413 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,414 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,414 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,414 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,414 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,414 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,414 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,415 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,415 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,415 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,415 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,415 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,415 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,416 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,416 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,416 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,416 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,416 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,416 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,417 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,417 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,417 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,417 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,417 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,417 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,417 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,418 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,418 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,418 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,418 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,418 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,418 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,419 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,419 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,419 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,419 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,419 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-11-10 13:02:21,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,420 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,420 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,421 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,422 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,422 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,422 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,422 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,423 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,423 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,423 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:02:21,423 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,423 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_#Ultimate.alloc_#res.base_25,QUANTIFIED] [2018-11-10 13:02:21,424 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:02:21,424 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,424 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:02:21,425 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, 56.5s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 10.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 291 SDtfs, 155 SDslu, 1681 SDs, 0 SdLazy, 1633 SolverSat, 113 SolverUnsat, 36 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1032 GetRequests, 894 SyntacticMatches, 8 SemanticMatches, 130 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 19.8s 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.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 41.3s 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...