./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/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 ed4d18349810257ce078dfe4f08b9b953ed4516f ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/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 ed4d18349810257ce078dfe4f08b9b953ed4516f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 07:07:59,429 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 07:07:59,430 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 07:07:59,436 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 07:07:59,437 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 07:07:59,437 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 07:07:59,438 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 07:07:59,439 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 07:07:59,439 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 07:07:59,440 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 07:07:59,440 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 07:07:59,440 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 07:07:59,441 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 07:07:59,441 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 07:07:59,442 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 07:07:59,442 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 07:07:59,443 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 07:07:59,444 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 07:07:59,444 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 07:07:59,445 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 07:07:59,446 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 07:07:59,446 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 07:07:59,447 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 07:07:59,447 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 07:07:59,448 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 07:07:59,448 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 07:07:59,449 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 07:07:59,449 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 07:07:59,449 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 07:07:59,450 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 07:07:59,450 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 07:07:59,450 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 07:07:59,450 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 07:07:59,451 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 07:07:59,451 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 07:07:59,451 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 07:07:59,452 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 07:07:59,459 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 07:07:59,459 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 07:07:59,459 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 07:07:59,459 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 07:07:59,460 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 07:07:59,460 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 07:07:59,460 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 07:07:59,460 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 07:07:59,460 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 07:07:59,460 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 07:07:59,460 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 07:07:59,460 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 07:07:59,460 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 07:07:59,461 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 07:07:59,461 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 07:07:59,461 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 07:07:59,461 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 07:07:59,461 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 07:07:59,461 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 07:07:59,461 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 07:07:59,461 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 07:07:59,461 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 07:07:59,462 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 07:07:59,462 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 07:07:59,462 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 07:07:59,462 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 07:07:59,462 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 07:07:59,462 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 07:07:59,462 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:07:59,462 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 07:07:59,462 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 07:07:59,462 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 07:07:59,462 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 07:07:59,463 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 07:07:59,463 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 07:07:59,463 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 07:07:59,463 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_5c45fe37-5820-47cc-a89b-bb80389d2aa9/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 -> ed4d18349810257ce078dfe4f08b9b953ed4516f [2018-12-03 07:07:59,481 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 07:07:59,490 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 07:07:59,492 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 07:07:59,494 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 07:07:59,494 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 07:07:59,494 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:07:59,534 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/data/5a56f95b6/31b347f46d3341548ce092be8126c93c/FLAG8c5f1b2b4 [2018-12-03 07:08:00,033 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 07:08:00,034 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:08:00,040 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/data/5a56f95b6/31b347f46d3341548ce092be8126c93c/FLAG8c5f1b2b4 [2018-12-03 07:08:00,048 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/data/5a56f95b6/31b347f46d3341548ce092be8126c93c [2018-12-03 07:08:00,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 07:08:00,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 07:08:00,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 07:08:00,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 07:08:00,053 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 07:08:00,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:08:00" (1/1) ... [2018-12-03 07:08:00,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@665b4d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:08:00, skipping insertion in model container [2018-12-03 07:08:00,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:08:00" (1/1) ... [2018-12-03 07:08:00,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 07:08:00,078 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 07:08:00,227 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:08:00,233 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 07:08:00,299 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:08:00,328 INFO L195 MainTranslator]: Completed translation [2018-12-03 07:08:00,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:08:00 WrapperNode [2018-12-03 07:08:00,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 07:08:00,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 07:08:00,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 07:08:00,329 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 07:08:00,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:08:00" (1/1) ... [2018-12-03 07:08:00,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:08:00" (1/1) ... [2018-12-03 07:08:00,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 07:08:00,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 07:08:00,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 07:08:00,348 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 07:08:00,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:08:00" (1/1) ... [2018-12-03 07:08:00,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:08:00" (1/1) ... [2018-12-03 07:08:00,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:08:00" (1/1) ... [2018-12-03 07:08:00,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:08:00" (1/1) ... [2018-12-03 07:08:00,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:08:00" (1/1) ... [2018-12-03 07:08:00,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:08:00" (1/1) ... [2018-12-03 07:08:00,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:08:00" (1/1) ... [2018-12-03 07:08:00,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 07:08:00,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 07:08:00,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 07:08:00,368 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 07:08:00,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:08:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:08:00,399 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2018-12-03 07:08:00,399 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2018-12-03 07:08:00,399 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-12-03 07:08:00,399 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-12-03 07:08:00,400 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-03 07:08:00,400 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-03 07:08:00,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 07:08:00,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 07:08:00,400 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2018-12-03 07:08:00,400 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2018-12-03 07:08:00,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 07:08:00,400 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-03 07:08:00,400 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-03 07:08:00,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 07:08:00,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 07:08:00,400 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 07:08:00,400 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 07:08:00,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 07:08:00,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 07:08:00,401 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-12-03 07:08:00,401 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-12-03 07:08:00,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 07:08:00,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 07:08:00,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 07:08:00,588 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 07:08:00,588 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-03 07:08:00,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:08:00 BoogieIcfgContainer [2018-12-03 07:08:00,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 07:08:00,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 07:08:00,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 07:08:00,591 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 07:08:00,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 07:08:00" (1/3) ... [2018-12-03 07:08:00,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0bb57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:08:00, skipping insertion in model container [2018-12-03 07:08:00,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:08:00" (2/3) ... [2018-12-03 07:08:00,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0bb57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:08:00, skipping insertion in model container [2018-12-03 07:08:00,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:08:00" (3/3) ... [2018-12-03 07:08:00,593 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:08:00,599 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 07:08:00,604 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 07:08:00,612 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 07:08:00,629 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 07:08:00,629 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 07:08:00,629 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 07:08:00,629 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 07:08:00,630 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 07:08:00,630 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 07:08:00,630 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 07:08:00,630 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 07:08:00,640 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-12-03 07:08:00,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 07:08:00,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:08:00,644 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:08:00,646 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:08:00,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:08:00,649 INFO L82 PathProgramCache]: Analyzing trace with hash 813625813, now seen corresponding path program 1 times [2018-12-03 07:08:00,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:08:00,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:08:00,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:08:00,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:08:00,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:08:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:08:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:08:00,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:08:00,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 07:08:00,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:08:00,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-03 07:08:00,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-03 07:08:00,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-03 07:08:00,757 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-12-03 07:08:00,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:08:00,772 INFO L93 Difference]: Finished difference Result 97 states and 127 transitions. [2018-12-03 07:08:00,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-03 07:08:00,773 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-12-03 07:08:00,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:08:00,778 INFO L225 Difference]: With dead ends: 97 [2018-12-03 07:08:00,778 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 07:08:00,780 INFO L631 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-12-03 07:08:00,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 07:08:00,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 07:08:00,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 07:08:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-12-03 07:08:00,804 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 32 [2018-12-03 07:08:00,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:08:00,805 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-12-03 07:08:00,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-03 07:08:00,805 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-12-03 07:08:00,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 07:08:00,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:08:00,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:08:00,807 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:08:00,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:08:00,807 INFO L82 PathProgramCache]: Analyzing trace with hash 400468936, now seen corresponding path program 1 times [2018-12-03 07:08:00,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:08:00,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:08:00,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:08:00,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:08:00,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:08:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:08:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:08:00,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:08:00,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:08:00,869 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:08:00,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:08:00,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:08:00,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:08:00,870 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 5 states. [2018-12-03 07:08:00,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:08:00,900 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2018-12-03 07:08:00,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:08:00,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-03 07:08:00,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:08:00,901 INFO L225 Difference]: With dead ends: 75 [2018-12-03 07:08:00,901 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 07:08:00,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:08:00,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 07:08:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-12-03 07:08:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 07:08:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-12-03 07:08:00,907 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 32 [2018-12-03 07:08:00,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:08:00,907 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-12-03 07:08:00,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:08:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-12-03 07:08:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 07:08:00,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:08:00,908 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:08:00,908 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:08:00,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:08:00,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1119395132, now seen corresponding path program 1 times [2018-12-03 07:08:00,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:08:00,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:08:00,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:08:00,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:08:00,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:08:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:08:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 07:08:00,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:08:00,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:08:00,966 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:08:00,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:08:00,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:08:00,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:08:00,967 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 4 states. [2018-12-03 07:08:00,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:08:00,999 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-12-03 07:08:01,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:08:01,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-12-03 07:08:01,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:08:01,001 INFO L225 Difference]: With dead ends: 69 [2018-12-03 07:08:01,001 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 07:08:01,001 INFO L631 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-12-03 07:08:01,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 07:08:01,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2018-12-03 07:08:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 07:08:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-12-03 07:08:01,005 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 42 [2018-12-03 07:08:01,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:08:01,006 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-12-03 07:08:01,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:08:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-12-03 07:08:01,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 07:08:01,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:08:01,007 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:08:01,007 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:08:01,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:08:01,007 INFO L82 PathProgramCache]: Analyzing trace with hash 296923910, now seen corresponding path program 1 times [2018-12-03 07:08:01,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:08:01,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:08:01,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:08:01,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:08:01,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:08:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:08:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 07:08:01,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:08:01,057 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:08:01,058 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-12-03 07:08:01,059 INFO L205 CegarAbsIntRunner]: [0], [2], [8], [10], [13], [17], [25], [27], [30], [40], [43], [50], [56], [57], [58], [60], [67], [69], [71], [74], [78], [82], [83], [84], [91], [97], [98], [99], [100], [130], [136], [138], [139], [140], [141], [142], [143], [144], [145], [148], [149], [150], [151], [152], [153], [154] [2018-12-03 07:08:01,081 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:08:01,081 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:08:01,250 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:08:01,251 INFO L272 AbstractInterpreter]: Visited 35 different actions 72 times. Merged at 10 different actions 15 times. Never widened. Performed 742 root evaluator evaluations with a maximum evaluation depth of 4. Performed 742 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 31 variables. [2018-12-03 07:08:01,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:08:01,267 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:08:01,339 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 75% of their original sizes. [2018-12-03 07:08:01,339 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:08:01,552 INFO L418 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-12-03 07:08:01,552 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:08:01,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:08:01,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [5] total 24 [2018-12-03 07:08:01,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:08:01,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 07:08:01,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 07:08:01,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-12-03 07:08:01,555 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 21 states. [2018-12-03 07:08:02,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:08:02,600 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2018-12-03 07:08:02,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 07:08:02,600 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-12-03 07:08:02,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:08:02,602 INFO L225 Difference]: With dead ends: 116 [2018-12-03 07:08:02,602 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 07:08:02,602 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2018-12-03 07:08:02,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 07:08:02,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2018-12-03 07:08:02,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 07:08:02,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-12-03 07:08:02,609 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 50 [2018-12-03 07:08:02,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:08:02,609 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-12-03 07:08:02,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 07:08:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2018-12-03 07:08:02,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 07:08:02,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:08:02,610 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:08:02,611 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:08:02,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:08:02,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1930680310, now seen corresponding path program 1 times [2018-12-03 07:08:02,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:08:02,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:08:02,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:08:02,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:08:02,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:08:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:08:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:08:03,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:08:03,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:08:03,335 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-12-03 07:08:03,335 INFO L205 CegarAbsIntRunner]: [0], [2], [8], [10], [13], [17], [25], [27], [30], [40], [43], [50], [52], [56], [57], [58], [60], [67], [69], [71], [74], [78], [82], [83], [84], [91], [97], [98], [99], [100], [130], [136], [138], [139], [140], [141], [142], [143], [144], [145], [148], [149], [150], [151], [152], [153], [154] [2018-12-03 07:08:03,336 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:08:03,336 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:08:03,389 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:08:03,389 INFO L272 AbstractInterpreter]: Visited 47 different actions 127 times. Merged at 22 different actions 37 times. Never widened. Performed 1120 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1120 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 5 different actions. Largest state had 31 variables. [2018-12-03 07:08:03,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:08:03,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:08:03,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:08:03,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:08:03,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:08:03,400 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:08:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:08:03,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:08:03,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:08:03,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:03,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:03,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 07:08:03,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:08:03,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:08:03,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-03 07:08:03,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:03,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:03,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-03 07:08:03,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 07:08:03,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 07:08:03,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:03,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:03,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:03,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-03 07:08:03,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-03 07:08:03,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 07:08:03,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:03,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:03,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:08:03,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-03 07:08:03,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 48 [2018-12-03 07:08:03,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-12-03 07:08:03,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:03,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-12-03 07:08:03,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:08:03,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2018-12-03 07:08:03,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:03,829 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:03,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:03,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:08:03,840 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:71, output treesize:46 [2018-12-03 07:08:04,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:08:04,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 07:08:04,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:04,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:04,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:04,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-03 07:08:04,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-03 07:08:04,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:08:04,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:08:04,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:08:04,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2018-12-03 07:08:04,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:04,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:04,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:08:04,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:52 [2018-12-03 07:08:04,719 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~data Int) (dll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) (+ dll_circular_update_at_~head.offset 8) dll_circular_update_at_~data))) |c_#memory_int|)) is different from true [2018-12-03 07:08:04,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-12-03 07:08:04,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-03 07:08:04,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:04,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:04,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:08:04,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2018-12-03 07:08:04,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:08:04,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-12-03 07:08:04,753 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:08:04,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-03 07:08:04,758 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:04,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:08:04,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:04,765 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:73, output treesize:16 [2018-12-03 07:08:05,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2018-12-03 07:08:05,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-12-03 07:08:05,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:05,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2018-12-03 07:08:05,041 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:05,050 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:08:05,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 10 [2018-12-03 07:08:05,051 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:05,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:05,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:05,057 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:43, output treesize:10 [2018-12-03 07:08:05,097 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-03 07:08:05,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:08:05,577 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 07:08:05,728 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 07:08:05,733 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 07:08:27,333 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 71 [2018-12-03 07:08:27,336 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 07:08:27,341 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 07:08:38,015 WARN L180 SmtUtils]: Spent 633.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-12-03 07:08:38,018 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 07:08:56,519 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 73 [2018-12-03 07:08:56,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 59 [2018-12-03 07:08:56,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-03 07:08:56,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:56,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-03 07:08:56,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-03 07:08:56,595 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:56,596 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:56,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-12-03 07:08:56,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-03 07:08:56,599 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:56,601 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:56,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-03 07:08:56,643 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:08:56,646 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:08:56,647 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:56,651 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:56,652 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:08:56,656 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:08:56,678 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:08:56,679 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:08:56,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-12-03 07:08:56,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-03 07:08:56,711 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:56,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-03 07:08:56,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-03 07:08:56,724 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:56,727 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:56,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-03 07:08:56,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-03 07:08:56,730 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:56,732 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:56,741 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-03 07:08:56,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-03 07:08:56,764 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 8 variables, input treesize:137, output treesize:65 [2018-12-03 07:08:56,991 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:08:56,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:08:57,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 73 [2018-12-03 07:08:57,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-03 07:08:57,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:57,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-12-03 07:08:57,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-03 07:08:57,054 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:57,057 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:57,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2018-12-03 07:08:57,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-12-03 07:08:57,069 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-03 07:08:57,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-03 07:08:57,080 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:57,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-12-03 07:08:57,090 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:57,094 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:08:57,109 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-12-03 07:08:57,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 73 [2018-12-03 07:08:57,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-03 07:08:57,216 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:57,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-12-03 07:08:57,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-03 07:08:57,233 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:57,236 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:57,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2018-12-03 07:08:57,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-03 07:08:57,243 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:57,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-12-03 07:08:57,251 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:57,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-12-03 07:08:57,261 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-12-03 07:08:57,266 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:08:57,283 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-12-03 07:08:57,377 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:57,380 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:57,381 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:08:57,385 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:08:57,386 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:08:57,392 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:08:57,393 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:57,396 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:57,397 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-03 07:08:57,400 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:08:57,401 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:08:57,405 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:08:57,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 11 xjuncts. [2018-12-03 07:08:57,477 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 8 variables, input treesize:165, output treesize:312 [2018-12-03 07:08:57,477 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2018-12-03 07:09:00,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 56 [2018-12-03 07:09:00,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-12-03 07:09:00,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:00,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 63 [2018-12-03 07:09:00,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-12-03 07:09:00,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:00,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-12-03 07:09:00,453 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:00,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-03 07:09:00,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-12-03 07:09:00,472 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:00,473 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:00,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 81 [2018-12-03 07:09:00,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-12-03 07:09:00,518 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:00,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 82 [2018-12-03 07:09:00,619 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-12-03 07:09:00,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:00,716 INFO L478 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 32 treesize of output 39 [2018-12-03 07:09:00,716 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:00,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:00,810 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:00,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 52 treesize of output 66 [2018-12-03 07:09:00,816 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-03 07:09:00,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-12-03 07:09:00,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-03 07:09:00,924 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:00,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-12-03 07:09:00,940 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:00,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:00,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-12-03 07:09:00,941 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:00,943 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:00,948 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:00,950 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:00,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2018-12-03 07:09:00,953 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:00,955 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:00,965 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 32 [2018-12-03 07:09:00,966 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 07:09:00,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-12-03 07:09:00,987 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:00,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:00,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-12-03 07:09:00,988 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:00,990 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:00,994 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:01,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:01,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2018-12-03 07:09:01,104 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:01,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:01,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 54 [2018-12-03 07:09:01,140 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:01,141 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:01,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-12-03 07:09:01,142 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:01,161 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:01,162 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:01,163 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:01,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-03 07:09:01,164 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:01,165 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:01,168 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:01,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-12-03 07:09:01,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:01,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 4 [2018-12-03 07:09:01,308 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:01,309 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:01,325 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:09:01,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:09:01,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:09:01,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:09:01,339 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 5 variables, input treesize:78, output treesize:9 [2018-12-03 07:09:01,752 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:09:01,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:09:01,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 33, 31] total 85 [2018-12-03 07:09:01,767 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:09:01,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 07:09:01,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 07:09:01,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=6691, Unknown=19, NotChecked=164, Total=7140 [2018-12-03 07:09:01,770 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 59 states. [2018-12-03 07:09:05,919 WARN L180 SmtUtils]: Spent 950.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2018-12-03 07:09:11,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:09:11,326 INFO L93 Difference]: Finished difference Result 136 states and 178 transitions. [2018-12-03 07:09:11,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 07:09:11,326 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-03 07:09:11,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:09:11,327 INFO L225 Difference]: With dead ends: 136 [2018-12-03 07:09:11,327 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 07:09:11,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 119 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2845 ImplicationChecksByTransitivity, 64.2s TimeCoverageRelationStatistics Valid=728, Invalid=13526, Unknown=30, NotChecked=236, Total=14520 [2018-12-03 07:09:11,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 07:09:11,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 99. [2018-12-03 07:09:11,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 07:09:11,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 125 transitions. [2018-12-03 07:09:11,344 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 125 transitions. Word has length 59 [2018-12-03 07:09:11,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:09:11,344 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 125 transitions. [2018-12-03 07:09:11,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 07:09:11,344 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 125 transitions. [2018-12-03 07:09:11,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 07:09:11,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:09:11,345 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:09:11,345 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:09:11,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:09:11,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2108590893, now seen corresponding path program 1 times [2018-12-03 07:09:11,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:09:11,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:09:11,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:09:11,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:09:11,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:09:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:09:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 07:09:11,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:09:11,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:09:11,380 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-12-03 07:09:11,380 INFO L205 CegarAbsIntRunner]: [0], [2], [8], [10], [13], [17], [25], [27], [30], [40], [43], [50], [52], [56], [57], [58], [60], [67], [69], [71], [74], [78], [82], [83], [84], [91], [93], [97], [98], [99], [100], [130], [136], [138], [139], [140], [141], [142], [143], [144], [145], [148], [149], [150], [151], [152], [153], [154] [2018-12-03 07:09:11,381 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:09:11,381 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:09:11,432 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:09:11,432 INFO L272 AbstractInterpreter]: Visited 48 different actions 129 times. Merged at 22 different actions 37 times. Never widened. Performed 1134 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1134 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 5 different actions. Largest state had 31 variables. [2018-12-03 07:09:11,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:09:11,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:09:11,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:09:11,434 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:09:11,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:09:11,452 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:09:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:09:11,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:09:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 07:09:11,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:09:11,544 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 07:09:11,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 07:09:11,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2018-12-03 07:09:11,559 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:09:11,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:09:11,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:09:11,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:09:11,560 INFO L87 Difference]: Start difference. First operand 99 states and 125 transitions. Second operand 5 states. [2018-12-03 07:09:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:09:11,582 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2018-12-03 07:09:11,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:09:11,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-12-03 07:09:11,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:09:11,583 INFO L225 Difference]: With dead ends: 139 [2018-12-03 07:09:11,583 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 07:09:11,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:09:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 07:09:11,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 105. [2018-12-03 07:09:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 07:09:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 132 transitions. [2018-12-03 07:09:11,600 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 132 transitions. Word has length 60 [2018-12-03 07:09:11,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:09:11,600 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 132 transitions. [2018-12-03 07:09:11,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:09:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2018-12-03 07:09:11,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 07:09:11,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:09:11,602 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:09:11,602 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:09:11,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:09:11,602 INFO L82 PathProgramCache]: Analyzing trace with hash 190219152, now seen corresponding path program 2 times [2018-12-03 07:09:11,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:09:11,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:09:11,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:09:11,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:09:11,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:09:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:09:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 07:09:11,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:09:11,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:09:11,650 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 07:09:11,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 07:09:11,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:09:11,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:09:11,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 07:09:11,657 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 07:09:11,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 07:09:11,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:09:11,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:09:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:09:11,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:09:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:09:11,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:09:11,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-12-03 07:09:11,861 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:09:11,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 07:09:11,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 07:09:11,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:09:11,862 INFO L87 Difference]: Start difference. First operand 105 states and 132 transitions. Second operand 8 states. [2018-12-03 07:09:11,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:09:11,918 INFO L93 Difference]: Finished difference Result 168 states and 205 transitions. [2018-12-03 07:09:11,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:09:11,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-12-03 07:09:11,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:09:11,919 INFO L225 Difference]: With dead ends: 168 [2018-12-03 07:09:11,919 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 07:09:11,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 115 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-03 07:09:11,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 07:09:11,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2018-12-03 07:09:11,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 07:09:11,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2018-12-03 07:09:11,931 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 60 [2018-12-03 07:09:11,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:09:11,931 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2018-12-03 07:09:11,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 07:09:11,931 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2018-12-03 07:09:11,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 07:09:11,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:09:11,932 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:09:11,932 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:09:11,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:09:11,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1621445052, now seen corresponding path program 3 times [2018-12-03 07:09:11,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:09:11,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:09:11,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:09:11,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:09:11,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:09:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:09:11,961 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 07:09:11,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:09:11,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:09:11,961 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 07:09:11,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 07:09:11,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:09:11,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:09:11,970 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 07:09:11,970 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 07:09:11,994 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 07:09:11,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:09:11,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:09:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 07:09:12,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:09:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 07:09:12,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:09:12,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 07:09:12,079 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:09:12,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 07:09:12,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 07:09:12,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:09:12,080 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand 8 states. [2018-12-03 07:09:12,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:09:12,121 INFO L93 Difference]: Finished difference Result 153 states and 181 transitions. [2018-12-03 07:09:12,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:09:12,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-12-03 07:09:12,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:09:12,122 INFO L225 Difference]: With dead ends: 153 [2018-12-03 07:09:12,122 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 07:09:12,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-03 07:09:12,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 07:09:12,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2018-12-03 07:09:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 07:09:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2018-12-03 07:09:12,137 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 60 [2018-12-03 07:09:12,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:09:12,137 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2018-12-03 07:09:12,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 07:09:12,137 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2018-12-03 07:09:12,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 07:09:12,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:09:12,138 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:09:12,138 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:09:12,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:09:12,139 INFO L82 PathProgramCache]: Analyzing trace with hash -236153920, now seen corresponding path program 4 times [2018-12-03 07:09:12,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:09:12,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:09:12,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:09:12,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:09:12,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:09:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:09:12,191 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 07:09:12,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:09:12,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:09:12,191 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 07:09:12,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 07:09:12,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:09:12,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:09:12,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:09:12,199 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:09:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:09:12,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:09:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-03 07:09:12,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:09:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 07:09:12,353 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:09:12,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 14 [2018-12-03 07:09:12,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:09:12,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:09:12,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:09:12,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-03 07:09:12,354 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand 6 states. [2018-12-03 07:09:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:09:12,394 INFO L93 Difference]: Finished difference Result 171 states and 203 transitions. [2018-12-03 07:09:12,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:09:12,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-03 07:09:12,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:09:12,396 INFO L225 Difference]: With dead ends: 171 [2018-12-03 07:09:12,396 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 07:09:12,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-03 07:09:12,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 07:09:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-12-03 07:09:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 07:09:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2018-12-03 07:09:12,405 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 67 [2018-12-03 07:09:12,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:09:12,405 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2018-12-03 07:09:12,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:09:12,405 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2018-12-03 07:09:12,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 07:09:12,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:09:12,406 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:09:12,406 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:09:12,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:09:12,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2144314145, now seen corresponding path program 1 times [2018-12-03 07:09:12,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:09:12,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:09:12,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:09:12,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:09:12,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:09:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:09:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 07:09:12,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:09:12,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:09:12,440 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-12-03 07:09:12,440 INFO L205 CegarAbsIntRunner]: [0], [2], [8], [10], [13], [17], [25], [27], [30], [32], [34], [40], [43], [50], [52], [56], [57], [58], [60], [67], [69], [71], [74], [78], [82], [83], [84], [91], [97], [98], [99], [100], [130], [136], [138], [139], [140], [141], [142], [143], [144], [145], [148], [149], [150], [151], [152], [153], [154] [2018-12-03 07:09:12,441 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:09:12,442 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:09:12,495 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:09:12,495 INFO L272 AbstractInterpreter]: Visited 49 different actions 145 times. Merged at 24 different actions 42 times. Never widened. Performed 1268 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1268 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 6 different actions. Largest state had 31 variables. [2018-12-03 07:09:12,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:09:12,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:09:12,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:09:12,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:09:12,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:09:12,506 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:09:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:09:12,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:09:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 07:09:12,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:09:12,583 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 07:09:12,598 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:09:12,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 8 [2018-12-03 07:09:12,598 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:09:12,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:09:12,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:09:12,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:09:12,598 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand 6 states. [2018-12-03 07:09:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:09:12,627 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2018-12-03 07:09:12,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:09:12,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-03 07:09:12,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:09:12,627 INFO L225 Difference]: With dead ends: 101 [2018-12-03 07:09:12,627 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 07:09:12,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:09:12,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 07:09:12,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-12-03 07:09:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 07:09:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-12-03 07:09:12,636 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 69 [2018-12-03 07:09:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:09:12,636 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-12-03 07:09:12,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:09:12,637 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-12-03 07:09:12,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 07:09:12,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:09:12,637 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:09:12,637 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:09:12,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:09:12,637 INFO L82 PathProgramCache]: Analyzing trace with hash 792894978, now seen corresponding path program 5 times [2018-12-03 07:09:12,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:09:12,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:09:12,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:09:12,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:09:12,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:09:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:09:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 07:09:12,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:09:12,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:09:12,678 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 07:09:12,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 07:09:12,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:09:12,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:09:12,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 07:09:12,688 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 07:09:12,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 07:09:12,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:09:12,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:09:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 07:09:12,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:09:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 07:09:12,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 07:09:12,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 8 [2018-12-03 07:09:12,817 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:09:12,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:09:12,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:09:12,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:09:12,818 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 6 states. [2018-12-03 07:09:12,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:09:12,846 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-12-03 07:09:12,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:09:12,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-03 07:09:12,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:09:12,847 INFO L225 Difference]: With dead ends: 108 [2018-12-03 07:09:12,847 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 07:09:12,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:09:12,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 07:09:12,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 07:09:12,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 07:09:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-12-03 07:09:12,852 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 69 [2018-12-03 07:09:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:09:12,852 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-12-03 07:09:12,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:09:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-12-03 07:09:12,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 07:09:12,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:09:12,853 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:09:12,853 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:09:12,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:09:12,853 INFO L82 PathProgramCache]: Analyzing trace with hash 141305186, now seen corresponding path program 1 times [2018-12-03 07:09:12,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:09:12,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:09:12,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:09:12,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:09:12,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:09:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:09:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 07:09:13,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:09:13,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:09:13,582 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-12-03 07:09:13,582 INFO L205 CegarAbsIntRunner]: [0], [2], [8], [10], [13], [17], [25], [27], [30], [32], [34], [40], [43], [50], [52], [56], [57], [58], [60], [67], [69], [71], [74], [78], [82], [83], [84], [91], [93], [97], [98], [99], [100], [130], [136], [138], [139], [140], [141], [142], [143], [144], [145], [148], [149], [150], [151], [152], [153], [154] [2018-12-03 07:09:13,583 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:09:13,583 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:09:13,671 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:09:13,671 INFO L272 AbstractInterpreter]: Visited 50 different actions 200 times. Merged at 28 different actions 78 times. Widened at 2 different actions 2 times. Performed 1602 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1602 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 17 fixpoints after 8 different actions. Largest state had 31 variables. [2018-12-03 07:09:13,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:09:13,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:09:13,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:09:13,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:09:13,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:09:13,682 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:09:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:09:13,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:09:13,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:09:13,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:13,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:13,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 07:09:13,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:13,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:13,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-03 07:09:13,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:13,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:13,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-03 07:09:13,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 07:09:13,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 07:09:13,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:13,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:13,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:13,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-03 07:09:13,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-03 07:09:13,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 07:09:13,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:13,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:13,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:13,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-03 07:09:14,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 48 [2018-12-03 07:09:14,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-12-03 07:09:14,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:14,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-12-03 07:09:14,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:14,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2018-12-03 07:09:14,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:14,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:14,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:14,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:14,101 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:71, output treesize:46 [2018-12-03 07:09:14,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-12-03 07:09:14,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-03 07:09:14,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:14,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:14,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:14,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2018-12-03 07:09:14,733 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2018-12-03 07:09:14,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-03 07:09:14,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:14,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:14,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:14,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2018-12-03 07:09:14,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:14,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:14,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:14,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:43 [2018-12-03 07:09:14,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-12-03 07:09:14,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-12-03 07:09:14,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:14,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:14,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:14,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:113 [2018-12-03 07:09:15,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 118 [2018-12-03 07:09:15,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 1 [2018-12-03 07:09:15,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:15,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:15,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 104 [2018-12-03 07:09:15,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 61 [2018-12-03 07:09:15,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 07:09:15,099 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:09:15,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:09:15,128 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:154, output treesize:142 [2018-12-03 07:09:15,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 114 [2018-12-03 07:09:15,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:15,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 104 [2018-12-03 07:09:15,837 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:15,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:15,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 87 [2018-12-03 07:09:15,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:15,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:15,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:15,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 106 treesize of output 120 [2018-12-03 07:09:15,909 INFO L267 ElimStorePlain]: Start of recursive call 5: 9 dim-0 vars, End of recursive call: 9 dim-0 vars, and 8 xjuncts. [2018-12-03 07:09:16,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 9 xjuncts. [2018-12-03 07:09:16,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 76 [2018-12-03 07:09:16,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-12-03 07:09:16,167 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2018-12-03 07:09:16,189 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2018-12-03 07:09:16,210 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,230 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-03 07:09:16,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 82 [2018-12-03 07:09:16,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2018-12-03 07:09:16,238 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2018-12-03 07:09:16,263 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2018-12-03 07:09:16,288 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,311 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-03 07:09:16,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 78 [2018-12-03 07:09:16,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2018-12-03 07:09:16,318 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-12-03 07:09:16,340 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 68 [2018-12-03 07:09:16,366 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 07:09:16,394 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-03 07:09:16,396 INFO L478 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 78 treesize of output 68 [2018-12-03 07:09:16,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-12-03 07:09:16,398 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-03 07:09:16,408 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,417 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 78 [2018-12-03 07:09:16,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2018-12-03 07:09:16,424 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-12-03 07:09:16,453 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 68 [2018-12-03 07:09:16,479 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 07:09:16,519 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-03 07:09:16,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 82 [2018-12-03 07:09:16,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2018-12-03 07:09:16,528 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2018-12-03 07:09:16,556 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2018-12-03 07:09:16,584 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,608 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-03 07:09:16,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 72 [2018-12-03 07:09:16,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-12-03 07:09:16,616 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-12-03 07:09:16,642 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 62 [2018-12-03 07:09:16,666 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 07:09:16,690 INFO L267 ElimStorePlain]: Start of recursive call 29: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-03 07:09:16,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 84 [2018-12-03 07:09:16,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2018-12-03 07:09:16,698 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2018-12-03 07:09:16,723 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 74 [2018-12-03 07:09:16,752 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 07:09:16,785 INFO L267 ElimStorePlain]: Start of recursive call 33: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-03 07:09:16,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 88 [2018-12-03 07:09:16,793 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 70 [2018-12-03 07:09:16,793 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2018-12-03 07:09:16,821 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2018-12-03 07:09:16,850 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:16,879 INFO L267 ElimStorePlain]: Start of recursive call 37: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-03 07:09:17,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 48 treesize of output 42 [2018-12-03 07:09:17,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-12-03 07:09:17,306 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,313 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 64 treesize of output 54 [2018-12-03 07:09:17,317 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:17,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-12-03 07:09:17,317 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,323 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 58 treesize of output 48 [2018-12-03 07:09:17,328 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:17,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-12-03 07:09:17,328 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,334 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 64 treesize of output 54 [2018-12-03 07:09:17,338 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:17,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-12-03 07:09:17,339 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,345 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 58 treesize of output 48 [2018-12-03 07:09:17,349 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:17,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-12-03 07:09:17,350 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,355 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 70 treesize of output 60 [2018-12-03 07:09:17,359 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:17,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-12-03 07:09:17,360 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,368 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 64 treesize of output 54 [2018-12-03 07:09:17,373 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:17,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-12-03 07:09:17,373 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,379 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 58 treesize of output 48 [2018-12-03 07:09:17,383 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:17,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-12-03 07:09:17,384 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,389 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-12-03 07:09:17,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-12-03 07:09:17,392 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,397 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-12-03 07:09:17,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-12-03 07:09:17,400 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,405 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 64 treesize of output 54 [2018-12-03 07:09:17,409 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:17,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-12-03 07:09:17,409 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,416 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 72 [2018-12-03 07:09:17,425 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:17,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 35 [2018-12-03 07:09:17,426 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,460 INFO L267 ElimStorePlain]: Start of recursive call 63: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 70 treesize of output 60 [2018-12-03 07:09:17,465 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:17,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-12-03 07:09:17,465 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,473 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 62 treesize of output 52 [2018-12-03 07:09:17,477 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:17,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-12-03 07:09:17,477 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,483 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 68 treesize of output 58 [2018-12-03 07:09:17,488 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:17,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-12-03 07:09:17,488 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,504 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-12-03 07:09:17,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-12-03 07:09:17,507 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,511 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 [2018-12-03 07:09:17,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-12-03 07:09:17,519 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 23 [2018-12-03 07:09:17,541 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,562 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:17,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2018-12-03 07:09:17,562 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,572 INFO L267 ElimStorePlain]: Start of recursive call 73: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 68 treesize of output 58 [2018-12-03 07:09:17,577 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:17,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-12-03 07:09:17,577 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,591 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 64 treesize of output 54 [2018-12-03 07:09:17,595 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:17,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-12-03 07:09:17,596 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,603 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 64 treesize of output 54 [2018-12-03 07:09:17,607 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:17,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-12-03 07:09:17,608 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,614 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 68 [2018-12-03 07:09:17,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 49 [2018-12-03 07:09:17,624 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,658 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:09:17,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 31 [2018-12-03 07:09:17,659 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,683 INFO L267 ElimStorePlain]: Start of recursive call 83: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:17,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:09:17,887 INFO L202 ElimStorePlain]: Needed 85 recursive calls to eliminate 7 variables, input treesize:131, output treesize:21 [2018-12-03 07:09:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-12-03 07:09:18,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:09:19,227 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:19,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:19,234 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:19,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:19,241 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:19,246 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:19,247 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:19,253 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:19,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 109 [2018-12-03 07:09:19,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 5 [2018-12-03 07:09:19,380 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:19,384 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:19,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 87 [2018-12-03 07:09:19,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 5 [2018-12-03 07:09:19,387 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:19,390 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:19,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 81 [2018-12-03 07:09:19,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 5 [2018-12-03 07:09:19,393 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:19,396 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:19,459 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:19,467 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:19,468 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:19,475 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:19,476 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:19,483 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:19,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 109 [2018-12-03 07:09:19,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 5 [2018-12-03 07:09:19,530 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:19,534 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:19,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 87 [2018-12-03 07:09:19,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 5 [2018-12-03 07:09:19,538 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:19,541 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:19,577 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:19,578 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:19,578 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:19,580 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:19,580 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:19,582 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:19,605 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:19,607 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:19,607 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:19,610 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:19,611 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:19,612 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:19,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-12-03 07:09:19,625 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 6 variables, input treesize:245, output treesize:178 [2018-12-03 07:09:19,824 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 07:09:19,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 96 [2018-12-03 07:09:20,125 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:09:20,127 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:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-03 07:09:20,134 INFO L168 Benchmark]: Toolchain (without parser) took 80083.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.3 MB). Free memory was 948.1 MB in the beginning and 986.9 MB in the end (delta: -38.8 MB). Peak memory consumption was 139.4 MB. Max. memory is 11.5 GB. [2018-12-03 07:09:20,135 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:09:20,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -133.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-03 07:09:20,135 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:09:20,135 INFO L168 Benchmark]: Boogie Preprocessor took 19.78 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-03 07:09:20,135 INFO L168 Benchmark]: RCFGBuilder took 220.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:09:20,136 INFO L168 Benchmark]: TraceAbstraction took 79543.14 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.0 GB in the beginning and 986.9 MB in the end (delta: 57.9 MB). Peak memory consumption was 138.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:09:20,137 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 277.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -133.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.78 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 220.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 79543.14 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.0 GB in the beginning and 986.9 MB in the end (delta: 57.9 MB). Peak memory consumption was 138.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-03 07:09:21,451 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 07:09:21,452 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 07:09:21,460 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 07:09:21,460 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 07:09:21,460 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 07:09:21,461 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 07:09:21,462 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 07:09:21,463 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 07:09:21,463 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 07:09:21,463 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 07:09:21,464 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 07:09:21,464 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 07:09:21,465 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 07:09:21,465 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 07:09:21,466 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 07:09:21,466 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 07:09:21,467 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 07:09:21,468 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 07:09:21,469 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 07:09:21,469 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 07:09:21,470 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 07:09:21,471 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 07:09:21,471 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 07:09:21,471 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 07:09:21,472 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 07:09:21,472 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 07:09:21,473 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 07:09:21,473 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 07:09:21,474 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 07:09:21,474 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 07:09:21,474 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 07:09:21,474 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 07:09:21,474 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 07:09:21,475 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 07:09:21,475 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 07:09:21,475 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-03 07:09:21,483 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 07:09:21,483 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 07:09:21,483 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 07:09:21,484 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 07:09:21,484 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 07:09:21,484 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 07:09:21,484 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 07:09:21,484 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 07:09:21,484 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 07:09:21,484 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 07:09:21,485 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 07:09:21,485 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 07:09:21,485 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 07:09:21,485 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 07:09:21,485 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 07:09:21,485 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 07:09:21,485 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 07:09:21,485 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-03 07:09:21,486 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-03 07:09:21,486 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 07:09:21,486 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 07:09:21,486 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 07:09:21,486 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 07:09:21,486 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 07:09:21,486 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 07:09:21,486 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 07:09:21,487 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 07:09:21,487 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:09:21,487 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 07:09:21,487 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 07:09:21,487 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 07:09:21,487 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-03 07:09:21,487 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 07:09:21,487 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-03 07:09:21,487 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-03 07:09:21,488 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_5c45fe37-5820-47cc-a89b-bb80389d2aa9/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 -> ed4d18349810257ce078dfe4f08b9b953ed4516f [2018-12-03 07:09:21,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 07:09:21,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 07:09:21,517 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 07:09:21,518 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 07:09:21,518 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 07:09:21,518 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:09:21,554 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/data/968be2634/23c4251b59d64e1e80e50bfd90006cf2/FLAG8cf190901 [2018-12-03 07:09:21,977 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 07:09:21,977 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:09:21,985 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/data/968be2634/23c4251b59d64e1e80e50bfd90006cf2/FLAG8cf190901 [2018-12-03 07:09:21,993 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/data/968be2634/23c4251b59d64e1e80e50bfd90006cf2 [2018-12-03 07:09:21,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 07:09:21,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 07:09:21,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 07:09:21,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 07:09:22,000 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 07:09:22,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:09:21" (1/1) ... [2018-12-03 07:09:22,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49da4dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:22, skipping insertion in model container [2018-12-03 07:09:22,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:09:21" (1/1) ... [2018-12-03 07:09:22,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 07:09:22,035 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 07:09:22,209 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:09:22,216 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 07:09:22,282 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:09:22,305 INFO L195 MainTranslator]: Completed translation [2018-12-03 07:09:22,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:22 WrapperNode [2018-12-03 07:09:22,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 07:09:22,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 07:09:22,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 07:09:22,306 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 07:09:22,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:22" (1/1) ... [2018-12-03 07:09:22,320 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:22" (1/1) ... [2018-12-03 07:09:22,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 07:09:22,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 07:09:22,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 07:09:22,325 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 07:09:22,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:22" (1/1) ... [2018-12-03 07:09:22,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:22" (1/1) ... [2018-12-03 07:09:22,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:22" (1/1) ... [2018-12-03 07:09:22,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:22" (1/1) ... [2018-12-03 07:09:22,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:22" (1/1) ... [2018-12-03 07:09:22,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:22" (1/1) ... [2018-12-03 07:09:22,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:22" (1/1) ... [2018-12-03 07:09:22,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 07:09:22,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 07:09:22,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 07:09:22,347 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 07:09:22,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:09:22,377 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2018-12-03 07:09:22,377 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2018-12-03 07:09:22,377 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-12-03 07:09:22,377 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-12-03 07:09:22,377 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-03 07:09:22,377 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-03 07:09:22,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 07:09:22,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-03 07:09:22,377 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2018-12-03 07:09:22,378 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2018-12-03 07:09:22,378 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-03 07:09:22,378 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-03 07:09:22,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 07:09:22,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 07:09:22,378 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 07:09:22,378 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 07:09:22,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 07:09:22,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 07:09:22,378 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-12-03 07:09:22,378 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-12-03 07:09:22,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 07:09:22,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-03 07:09:22,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 07:09:22,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 07:09:22,623 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 07:09:22,623 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-03 07:09:22,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:09:22 BoogieIcfgContainer [2018-12-03 07:09:22,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 07:09:22,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 07:09:22,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 07:09:22,626 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 07:09:22,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 07:09:21" (1/3) ... [2018-12-03 07:09:22,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ac2381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:09:22, skipping insertion in model container [2018-12-03 07:09:22,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:22" (2/3) ... [2018-12-03 07:09:22,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ac2381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:09:22, skipping insertion in model container [2018-12-03 07:09:22,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:09:22" (3/3) ... [2018-12-03 07:09:22,627 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:09:22,633 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 07:09:22,637 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 07:09:22,645 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 07:09:22,661 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 07:09:22,662 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 07:09:22,662 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 07:09:22,662 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 07:09:22,662 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 07:09:22,662 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 07:09:22,662 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 07:09:22,662 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 07:09:22,662 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 07:09:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-12-03 07:09:22,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 07:09:22,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:09:22,675 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:09:22,676 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:09:22,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:09:22,680 INFO L82 PathProgramCache]: Analyzing trace with hash -429725179, now seen corresponding path program 1 times [2018-12-03 07:09:22,682 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:09:22,682 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:09:22,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:09:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:09:22,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:09:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:09:22,803 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:09:22,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:09:22,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:09:22,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:09:22,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:09:22,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:09:22,819 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 5 states. [2018-12-03 07:09:22,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:09:22,886 INFO L93 Difference]: Finished difference Result 103 states and 137 transitions. [2018-12-03 07:09:22,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:09:22,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-03 07:09:22,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:09:22,893 INFO L225 Difference]: With dead ends: 103 [2018-12-03 07:09:22,893 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 07:09:22,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:09:22,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 07:09:22,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-12-03 07:09:22,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 07:09:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-12-03 07:09:22,921 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 31 [2018-12-03 07:09:22,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:09:22,922 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-12-03 07:09:22,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:09:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-12-03 07:09:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 07:09:22,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:09:22,923 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:09:22,923 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:09:22,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:09:22,924 INFO L82 PathProgramCache]: Analyzing trace with hash 855090161, now seen corresponding path program 1 times [2018-12-03 07:09:22,924 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:09:22,924 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:09:22,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:09:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:09:23,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:09:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 07:09:23,026 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:09:23,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:09:23,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:09:23,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:09:23,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:09:23,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:09:23,029 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 4 states. [2018-12-03 07:09:23,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:09:23,070 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2018-12-03 07:09:23,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:09:23,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-12-03 07:09:23,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:09:23,072 INFO L225 Difference]: With dead ends: 66 [2018-12-03 07:09:23,072 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 07:09:23,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-12-03 07:09:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 07:09:23,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-12-03 07:09:23,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 07:09:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-12-03 07:09:23,078 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 41 [2018-12-03 07:09:23,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:09:23,078 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-12-03 07:09:23,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:09:23,078 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-12-03 07:09:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 07:09:23,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:09:23,079 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:09:23,079 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:09:23,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:09:23,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1918785159, now seen corresponding path program 1 times [2018-12-03 07:09:23,080 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:09:23,080 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:09:23,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:09:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:09:23,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:09:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 07:09:23,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:09:23,260 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 07:09:23,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:09:23,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:09:23,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:09:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:09:23,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:09:23,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:09:23,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 07:09:23,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:23,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:23,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:23,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-03 07:09:23,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-12-03 07:09:23,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-03 07:09:23,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:23,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-03 07:09:23,856 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:23,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:23,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:23,867 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-12-03 07:09:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 07:09:23,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:09:24,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-12-03 07:09:24,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-12-03 07:09:24,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:24,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:24,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:09:24,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:10 [2018-12-03 07:09:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 07:09:24,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:09:24,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 21, 12] total 34 [2018-12-03 07:09:24,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 07:09:24,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 07:09:24,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1015, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 07:09:24,631 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 34 states. [2018-12-03 07:09:27,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:09:27,922 INFO L93 Difference]: Finished difference Result 95 states and 120 transitions. [2018-12-03 07:09:27,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 07:09:27,923 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 49 [2018-12-03 07:09:27,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:09:27,925 INFO L225 Difference]: With dead ends: 95 [2018-12-03 07:09:27,925 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 07:09:27,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=211, Invalid=1951, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 07:09:27,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 07:09:27,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 49. [2018-12-03 07:09:27,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 07:09:27,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-12-03 07:09:27,933 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 49 [2018-12-03 07:09:27,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:09:27,933 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-12-03 07:09:27,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 07:09:27,933 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-12-03 07:09:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 07:09:27,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:09:27,934 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:09:27,934 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:09:27,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:09:27,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1628181277, now seen corresponding path program 2 times [2018-12-03 07:09:27,935 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:09:27,935 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:09:27,950 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-03 07:09:28,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:09:28,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:09:28,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:09:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:09:28,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:09:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:09:28,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:09:28,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:09:28,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-03 07:09:28,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:09:28,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:09:28,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:09:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:09:28,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:09:28,494 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:09:28,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:09:28,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-03 07:09:28,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:09:28,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:09:28,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:09:28,512 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 9 states. [2018-12-03 07:09:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:09:28,631 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2018-12-03 07:09:28,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:09:28,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-12-03 07:09:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:09:28,632 INFO L225 Difference]: With dead ends: 94 [2018-12-03 07:09:28,632 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 07:09:28,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-03 07:09:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 07:09:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2018-12-03 07:09:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 07:09:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-12-03 07:09:28,638 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 57 [2018-12-03 07:09:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:09:28,638 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-12-03 07:09:28,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:09:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-12-03 07:09:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 07:09:28,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:09:28,639 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:09:28,639 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:09:28,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:09:28,639 INFO L82 PathProgramCache]: Analyzing trace with hash -625261382, now seen corresponding path program 1 times [2018-12-03 07:09:28,639 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:09:28,640 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:09:28,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:09:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:09:28,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:09:28,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:09:28,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:28,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:28,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 07:09:28,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:28,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:28,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 07:09:28,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:28,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:28,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2018-12-03 07:09:28,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 07:09:28,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12-03 07:09:28,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:28,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:28,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:28,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-12-03 07:09:29,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-03 07:09:29,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 07:09:29,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:29,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:29,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:29,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-03 07:09:29,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:29,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 55 [2018-12-03 07:09:29,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-12-03 07:09:29,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:29,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:29,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:29,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 57 [2018-12-03 07:09:29,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:29,178 INFO L478 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 60 treesize of output 87 [2018-12-03 07:09:29,180 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:09:29,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:29,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:29,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:29,232 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:72, output treesize:51 [2018-12-03 07:09:29,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:09:29,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 07:09:29,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:29,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:29,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:29,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-03 07:09:29,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:29,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:29,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:29,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 72 [2018-12-03 07:09:29,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:29,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:29,869 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 91 [2018-12-03 07:09:29,870 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:09:29,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:29,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:29,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:82, output treesize:63 [2018-12-03 07:09:31,717 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~data (_ BitVec 32)) (dll_circular_update_at_~head.offset (_ BitVec 32))) (= |c_#memory_int| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) (bvadd dll_circular_update_at_~head.offset (_ bv8 32)) dll_circular_update_at_~data))))) is different from true [2018-12-03 07:09:31,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:31,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:31,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 50 [2018-12-03 07:09:31,754 INFO L478 Elim1Store]: Elim1 applied some 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 15 treesize of output 23 [2018-12-03 07:09:31,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:31,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-12-03 07:09:31,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:31,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:31,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-03 07:09:31,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 07:09:31,819 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:31,829 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:31,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:31,844 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:84, output treesize:18 [2018-12-03 07:09:34,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-12-03 07:09:34,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-12-03 07:09:34,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:34,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:34,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:34,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-03 07:09:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-03 07:09:34,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:09:37,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:09:37,266 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:09:37,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:09:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:09:37,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:09:37,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:09:37,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:37,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:37,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 07:09:37,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:37,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:37,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 07:09:37,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:37,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:37,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-12-03 07:09:37,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 07:09:37,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 07:09:37,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:37,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:37,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:37,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-03 07:09:37,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-03 07:09:37,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 07:09:37,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:37,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:37,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:37,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-12-03 07:09:38,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 48 [2018-12-03 07:09:38,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-12-03 07:09:38,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:38,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-12-03 07:09:38,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:38,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2018-12-03 07:09:38,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:38,086 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:38,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:38,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:38,116 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:49 [2018-12-03 07:09:38,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:09:38,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 07:09:38,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:38,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:38,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:38,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-03 07:09:38,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-12-03 07:09:38,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:38,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:38,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-12-03 07:09:38,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:38,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:38,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:38,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:50 [2018-12-03 07:09:38,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:38,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-12-03 07:09:38,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-03 07:09:38,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:38,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:38,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:09:38,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-12-03 07:09:38,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-12-03 07:09:38,985 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:39,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-03 07:09:39,001 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:39,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:09:39,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:39,021 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:71, output treesize:18 [2018-12-03 07:09:41,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-12-03 07:09:41,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-12-03 07:09:41,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:09:41,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:41,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:09:41,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-03 07:09:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-03 07:09:41,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:09:43,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 07:09:43,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 46 [2018-12-03 07:09:43,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 07:09:43,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 07:09:43,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2501, Unknown=3, NotChecked=100, Total=2756 [2018-12-03 07:09:43,502 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 46 states. [2018-12-03 07:10:14,650 WARN L180 SmtUtils]: Spent 1.93 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 07:10:19,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:19,811 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2018-12-03 07:10:19,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 07:10:19,811 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 58 [2018-12-03 07:10:19,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:19,812 INFO L225 Difference]: With dead ends: 111 [2018-12-03 07:10:19,812 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 07:10:19,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=338, Invalid=5053, Unknown=15, NotChecked=144, Total=5550 [2018-12-03 07:10:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 07:10:19,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2018-12-03 07:10:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 07:10:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2018-12-03 07:10:19,824 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 58 [2018-12-03 07:10:19,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:19,824 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2018-12-03 07:10:19,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 07:10:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2018-12-03 07:10:19,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 07:10:19,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:19,825 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:10:19,825 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:10:19,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:19,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1469266884, now seen corresponding path program 1 times [2018-12-03 07:10:19,826 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:10:19,826 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:10:19,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:19,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:10:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-03 07:10:19,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:10:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-03 07:10:19,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:10:19,972 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:10:19,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:20,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:10:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-03 07:10:20,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:10:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-03 07:10:20,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:10:20,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 6 [2018-12-03 07:10:20,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:10:20,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:10:20,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:10:20,074 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand 6 states. [2018-12-03 07:10:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:20,198 INFO L93 Difference]: Finished difference Result 143 states and 172 transitions. [2018-12-03 07:10:20,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:10:20,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-03 07:10:20,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:20,199 INFO L225 Difference]: With dead ends: 143 [2018-12-03 07:10:20,199 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 07:10:20,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 226 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-12-03 07:10:20,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 07:10:20,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 07:10:20,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 07:10:20,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2018-12-03 07:10:20,209 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 58 [2018-12-03 07:10:20,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:20,210 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2018-12-03 07:10:20,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:10:20,210 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2018-12-03 07:10:20,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 07:10:20,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:20,211 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:10:20,211 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:10:20,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:20,211 INFO L82 PathProgramCache]: Analyzing trace with hash -602214656, now seen corresponding path program 1 times [2018-12-03 07:10:20,211 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:10:20,211 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:10:20,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:20,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:10:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 07:10:20,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:10:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 07:10:20,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:10:20,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-12-03 07:10:20,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:10:20,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:10:20,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:10:20,372 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 7 states. [2018-12-03 07:10:20,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:20,418 INFO L93 Difference]: Finished difference Result 130 states and 158 transitions. [2018-12-03 07:10:20,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:10:20,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-12-03 07:10:20,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:20,419 INFO L225 Difference]: With dead ends: 130 [2018-12-03 07:10:20,419 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 07:10:20,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:10:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 07:10:20,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2018-12-03 07:10:20,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 07:10:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2018-12-03 07:10:20,430 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 59 [2018-12-03 07:10:20,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:20,430 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2018-12-03 07:10:20,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:10:20,430 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2018-12-03 07:10:20,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 07:10:20,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:20,431 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:10:20,431 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:10:20,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:20,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1762507075, now seen corresponding path program 2 times [2018-12-03 07:10:20,431 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:10:20,431 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:10:20,445 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-03 07:10:20,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:10:20,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:10:20,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:10:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:10:20,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:10:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:10:20,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:10:20,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/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-12-03 07:10:20,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-03 07:10:21,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:10:21,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:10:21,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:10:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:10:21,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:10:21,420 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:10:21,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:10:21,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-03 07:10:21,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 07:10:21,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 07:10:21,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-03 07:10:21,438 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 18 states. [2018-12-03 07:10:22,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:22,366 INFO L93 Difference]: Finished difference Result 185 states and 242 transitions. [2018-12-03 07:10:22,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 07:10:22,367 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2018-12-03 07:10:22,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:22,368 INFO L225 Difference]: With dead ends: 185 [2018-12-03 07:10:22,368 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 07:10:22,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-12-03 07:10:22,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 07:10:22,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 112. [2018-12-03 07:10:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 07:10:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 143 transitions. [2018-12-03 07:10:22,383 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 143 transitions. Word has length 59 [2018-12-03 07:10:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:22,383 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 143 transitions. [2018-12-03 07:10:22,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 07:10:22,383 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2018-12-03 07:10:22,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 07:10:22,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:22,384 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:10:22,384 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:10:22,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:22,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1102743158, now seen corresponding path program 1 times [2018-12-03 07:10:22,384 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:10:22,384 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:10:22,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:10:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:22,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:10:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 07:10:22,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:10:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 07:10:22,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:10:22,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:10:22,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:22,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:10:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 07:10:22,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:10:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 07:10:22,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:10:22,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-03 07:10:22,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:10:22,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:10:22,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:10:22,688 INFO L87 Difference]: Start difference. First operand 112 states and 143 transitions. Second operand 9 states. [2018-12-03 07:10:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:22,808 INFO L93 Difference]: Finished difference Result 162 states and 205 transitions. [2018-12-03 07:10:22,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:10:22,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-12-03 07:10:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:22,810 INFO L225 Difference]: With dead ends: 162 [2018-12-03 07:10:22,810 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 07:10:22,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-03 07:10:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 07:10:22,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2018-12-03 07:10:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 07:10:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2018-12-03 07:10:22,828 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 67 [2018-12-03 07:10:22,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:22,828 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2018-12-03 07:10:22,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:10:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2018-12-03 07:10:22,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 07:10:22,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:22,829 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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-12-03 07:10:22,829 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:10:22,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:22,830 INFO L82 PathProgramCache]: Analyzing trace with hash 195796967, now seen corresponding path program 3 times [2018-12-03 07:10:22,830 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:10:22,830 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:10:22,843 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-03 07:10:23,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 07:10:23,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:10:23,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:10:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-03 07:10:23,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:10:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 07:10:23,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:10:23,265 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:10:23,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 07:10:39,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 07:10:39,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:10:39,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:10:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 07:10:39,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:10:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 07:10:39,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:10:39,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8, 12] total 18 [2018-12-03 07:10:39,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 07:10:39,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 07:10:39,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-12-03 07:10:39,390 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand 18 states. [2018-12-03 07:10:39,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:39,518 INFO L93 Difference]: Finished difference Result 175 states and 208 transitions. [2018-12-03 07:10:39,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:10:39,519 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-12-03 07:10:39,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:39,519 INFO L225 Difference]: With dead ends: 175 [2018-12-03 07:10:39,519 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 07:10:39,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 245 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-12-03 07:10:39,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 07:10:39,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-12-03 07:10:39,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 07:10:39,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2018-12-03 07:10:39,529 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 67 [2018-12-03 07:10:39,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:39,530 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2018-12-03 07:10:39,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 07:10:39,530 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2018-12-03 07:10:39,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 07:10:39,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:39,530 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:10:39,530 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:10:39,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:39,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1775719472, now seen corresponding path program 1 times [2018-12-03 07:10:39,531 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:10:39,531 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:10:39,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:10:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:39,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:10:39,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:10:39,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:39,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:39,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 07:10:39,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:39,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:39,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 07:10:39,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:39,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:39,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2018-12-03 07:10:39,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 07:10:39,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 07:10:39,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:39,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:39,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 07:10:39,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 07:10:39,963 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:39,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:39,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:39,980 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-12-03 07:10:40,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-03 07:10:40,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 07:10:40,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:40,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:40,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-12-03 07:10:40,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-03 07:10:40,071 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:40,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:40,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:40,090 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:47 [2018-12-03 07:10:40,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:40,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 120 [2018-12-03 07:10:40,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 50 [2018-12-03 07:10:40,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:40,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:40,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:40,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:40,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 114 [2018-12-03 07:10:40,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:40,448 INFO L478 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 119 treesize of output 158 [2018-12-03 07:10:40,449 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:10:40,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:40,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:40,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:40,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-12-03 07:10:40,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-12-03 07:10:40,680 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:40,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:40,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 71 [2018-12-03 07:10:40,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:40,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-12-03 07:10:40,725 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:40,742 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:40,752 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:40,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:40,779 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:143, output treesize:109 [2018-12-03 07:10:41,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:41,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:41,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:41,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 112 [2018-12-03 07:10:41,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:41,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:41,405 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 143 [2018-12-03 07:10:41,406 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:10:41,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:41,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:41,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2018-12-03 07:10:41,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:41,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:41,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 66 [2018-12-03 07:10:41,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:41,643 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:41,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:41,677 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:147, output treesize:109 [2018-12-03 07:10:42,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-12-03 07:10:42,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-12-03 07:10:42,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:42,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:42,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:42,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:104, output treesize:96 [2018-12-03 07:10:42,310 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:10:42,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:42,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:42,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:42,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 211 [2018-12-03 07:10:42,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:42,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:42,500 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 145 [2018-12-03 07:10:42,501 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:10:42,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:42,653 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:10:42,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 148 [2018-12-03 07:10:42,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:42,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:42,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2018-12-03 07:10:42,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:42,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:42,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:42,757 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:205, output treesize:131 [2018-12-03 07:10:44,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 70 [2018-12-03 07:10:44,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 45 [2018-12-03 07:10:44,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:44,266 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:10:44,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-12-03 07:10:44,266 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:44,289 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:10:44,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-12-03 07:10:44,290 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:44,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:44,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 153 [2018-12-03 07:10:44,426 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 16 xjuncts. [2018-12-03 07:10:44,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:44,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:44,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:44,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:44,519 INFO L478 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 6 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 109 [2018-12-03 07:10:44,564 INFO L478 Elim1Store]: Elim1 applied some 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 91 treesize of output 99 [2018-12-03 07:10:44,565 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:10:44,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2018-12-03 07:10:44,722 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:44,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-12-03 07:10:44,834 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:44,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2018-12-03 07:10:44,975 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:45,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-12-03 07:10:45,026 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:45,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2018-12-03 07:10:45,046 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:45,049 INFO L267 ElimStorePlain]: Start of recursive call 7: 11 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:45,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:45,055 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:263, output treesize:11 [2018-12-03 07:10:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 07:10:45,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:10:46,681 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-03 07:10:46,813 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-03 07:10:46,913 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:10:46,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:10:46,938 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:10:46,961 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:10:46,962 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:10:46,979 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:10:46,980 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:10:46,998 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:10:47,157 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:10:47,176 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:10:47,176 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:10:47,195 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:10:47,202 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:10:47,223 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:10:47,224 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:10:47,245 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:10:47,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 69 [2018-12-03 07:10:47,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 5 [2018-12-03 07:10:47,451 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:47,455 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:47,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 69 [2018-12-03 07:10:47,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 5 [2018-12-03 07:10:47,464 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:47,467 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:47,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 41 [2018-12-03 07:10:47,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 5 [2018-12-03 07:10:47,477 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:47,480 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:47,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 07:10:47,508 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 3 variables, input treesize:122, output treesize:72 [2018-12-03 07:10:47,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:10:47,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:10:47,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:47,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:10:47,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:10:47,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:47,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:47,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 07:10:47,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:47,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:47,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 07:10:47,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:47,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:47,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:14 [2018-12-03 07:10:47,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 07:10:47,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 07:10:47,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:47,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:48,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12-03 07:10:48,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 07:10:48,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:48,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:48,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:48,024 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-12-03 07:10:48,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-12-03 07:10:48,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-03 07:10:48,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:48,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:48,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-03 07:10:48,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 07:10:48,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:48,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:48,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:48,219 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-03 07:10:48,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 46 [2018-12-03 07:10:48,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-12-03 07:10:48,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:48,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2018-12-03 07:10:48,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:48,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 07:10:48,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:48,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:48,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:48,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 68 [2018-12-03 07:10:48,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 29 [2018-12-03 07:10:48,759 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:48,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:48,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2018-12-03 07:10:48,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:48,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 90 [2018-12-03 07:10:48,802 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:48,826 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:48,843 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:48,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:48,871 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:135, output treesize:92 [2018-12-03 07:10:49,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:49,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:49,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:49,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 106 [2018-12-03 07:10:49,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:49,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:49,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:49,606 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 143 [2018-12-03 07:10:49,607 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:10:49,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:49,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 77 [2018-12-03 07:10:49,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:49,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:49,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:49,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 66 [2018-12-03 07:10:49,795 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:49,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:49,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:49,841 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:138, output treesize:104 [2018-12-03 07:10:50,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-12-03 07:10:50,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-12-03 07:10:50,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:50,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:50,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:50,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:107, output treesize:99 [2018-12-03 07:10:51,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:51,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 143 [2018-12-03 07:10:51,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:51,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 92 [2018-12-03 07:10:51,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 07:10:51,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:10:51,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:51,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:51,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:51,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 170 [2018-12-03 07:10:51,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:55,495 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 151 [2018-12-03 07:10:55,497 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-12-03 07:10:55,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-03 07:10:55,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:55,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:55,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:55,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 166 [2018-12-03 07:10:55,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:55,778 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 141 [2018-12-03 07:10:55,779 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 07:10:55,866 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 07:10:56,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-12-03 07:10:56,251 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:205, output treesize:1027 [2018-12-03 07:10:56,926 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 55 [2018-12-03 07:10:57,367 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-03 07:10:58,594 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-12-03 07:10:59,235 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2018-12-03 07:11:00,744 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-12-03 07:11:01,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:01,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:01,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:01,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:01,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:01,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:01,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:01,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:01,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 205 treesize of output 225 [2018-12-03 07:11:01,266 INFO L478 Elim1Store]: Elim1 applied some 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 211 treesize of output 234 [2018-12-03 07:11:01,269 INFO L267 ElimStorePlain]: Start of recursive call 3: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-12-03 07:11:01,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 159 [2018-12-03 07:11:01,626 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:01,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 145 [2018-12-03 07:11:01,906 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:02,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 142 treesize of output 142 [2018-12-03 07:11:02,061 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-03 07:11:02,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 117 [2018-12-03 07:11:02,896 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-03 07:11:04,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:04,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 87 [2018-12-03 07:11:04,242 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:04,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:04,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 91 [2018-12-03 07:11:04,249 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:04,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:04,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 87 [2018-12-03 07:11:04,256 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:04,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:04,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 83 [2018-12-03 07:11:04,266 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:04,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 9 dim-1 vars, End of recursive call: 12 dim-0 vars, and 8 xjuncts. [2018-12-03 07:11:06,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:06,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:06,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:06,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:06,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:06,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:06,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:06,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:06,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 205 treesize of output 225 [2018-12-03 07:11:06,734 INFO L478 Elim1Store]: Elim1 applied some 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 211 treesize of output 234 [2018-12-03 07:11:06,737 INFO L267 ElimStorePlain]: Start of recursive call 13: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-12-03 07:11:07,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 178 treesize of output 176 [2018-12-03 07:11:07,153 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-03 07:11:07,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 134 [2018-12-03 07:11:07,711 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:07,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 138 [2018-12-03 07:11:07,722 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:07,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 138 [2018-12-03 07:11:07,739 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:07,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 142 [2018-12-03 07:11:07,754 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:08,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 126 [2018-12-03 07:11:08,223 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:08,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 122 [2018-12-03 07:11:08,233 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:08,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 130 [2018-12-03 07:11:08,239 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:08,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 126 [2018-12-03 07:11:08,245 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:08,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:08,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 102 [2018-12-03 07:11:08,661 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:09,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 96 [2018-12-03 07:11:09,063 INFO L267 ElimStorePlain]: Start of recursive call 24: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-03 07:11:11,458 INFO L267 ElimStorePlain]: Start of recursive call 12: 9 dim-1 vars, End of recursive call: 12 dim-0 vars, and 8 xjuncts. [2018-12-03 07:11:14,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:14,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:14,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:14,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:14,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 125 [2018-12-03 07:11:14,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:14,873 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 82 [2018-12-03 07:11:14,882 INFO L267 ElimStorePlain]: Start of recursive call 26: 24 dim-0 vars, End of recursive call: 24 dim-0 vars, and 15 xjuncts. [2018-12-03 07:11:15,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-12-03 07:11:15,011 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:15,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-03 07:11:15,054 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:15,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 07:11:15,088 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:15,116 INFO L267 ElimStorePlain]: Start of recursive call 25: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:15,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:15,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:15,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2018-12-03 07:11:15,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:15,140 INFO L478 Elim1Store]: Elim1 applied some 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 17 treesize of output 31 [2018-12-03 07:11:15,140 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:11:15,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:15,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-12-03 07:11:15,167 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:15,178 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:15,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:15,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:15,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2018-12-03 07:11:15,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:15,200 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 53 [2018-12-03 07:11:15,201 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 07:11:15,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-12-03 07:11:15,228 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:15,239 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:15,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:15,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:15,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:15,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:15,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 129 [2018-12-03 07:11:15,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:15,372 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 82 [2018-12-03 07:11:15,387 INFO L267 ElimStorePlain]: Start of recursive call 37: 24 dim-0 vars, End of recursive call: 24 dim-0 vars, and 15 xjuncts. [2018-12-03 07:11:15,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-12-03 07:11:15,583 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:15,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-03 07:11:15,629 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:15,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 07:11:15,666 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:15,697 INFO L267 ElimStorePlain]: Start of recursive call 36: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:15,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:15,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:15,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:15,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:15,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 121 [2018-12-03 07:11:15,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:15,781 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 82 [2018-12-03 07:11:15,788 INFO L267 ElimStorePlain]: Start of recursive call 42: 24 dim-0 vars, End of recursive call: 24 dim-0 vars, and 15 xjuncts. [2018-12-03 07:11:15,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-12-03 07:11:15,948 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:15,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-03 07:11:15,995 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:16,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 07:11:16,025 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:16,048 INFO L267 ElimStorePlain]: Start of recursive call 41: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:16,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:16,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:16,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 75 [2018-12-03 07:11:16,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:16,072 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 53 [2018-12-03 07:11:16,074 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 07:11:16,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-12-03 07:11:16,104 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:16,117 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:16,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:16,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:16,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:16,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:16,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 121 [2018-12-03 07:11:16,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:16,204 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 82 [2018-12-03 07:11:16,213 INFO L267 ElimStorePlain]: Start of recursive call 50: 24 dim-0 vars, End of recursive call: 24 dim-0 vars, and 15 xjuncts. [2018-12-03 07:11:16,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 07:11:16,363 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:16,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-12-03 07:11:16,414 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:16,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-03 07:11:16,454 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:16,484 INFO L267 ElimStorePlain]: Start of recursive call 49: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:16,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:16,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:16,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2018-12-03 07:11:16,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:16,513 INFO L478 Elim1Store]: Elim1 applied some 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 17 treesize of output 33 [2018-12-03 07:11:16,513 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:11:16,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:16,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-12-03 07:11:16,540 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:16,552 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:19,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 117 [2018-12-03 07:11:19,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 26 [2018-12-03 07:11:19,299 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:19,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 07:11:19,356 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:19,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-03 07:11:19,398 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:19,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-12-03 07:11:19,434 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:19,458 INFO L267 ElimStorePlain]: Start of recursive call 57: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:19,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2018-12-03 07:11:19,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,486 INFO L478 Elim1Store]: Elim1 applied some 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 17 treesize of output 33 [2018-12-03 07:11:19,487 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:11:19,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2018-12-03 07:11:19,508 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:19,519 INFO L267 ElimStorePlain]: Start of recursive call 62: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:19,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 117 [2018-12-03 07:11:19,549 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-12-03 07:11:19,550 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:19,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 26 [2018-12-03 07:11:19,616 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:19,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-12-03 07:11:19,667 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:19,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-03 07:11:19,706 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:19,733 INFO L267 ElimStorePlain]: Start of recursive call 65: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:19,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 73 [2018-12-03 07:11:19,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,761 INFO L478 Elim1Store]: Elim1 applied some 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 17 treesize of output 33 [2018-12-03 07:11:19,762 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:11:19,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 22 [2018-12-03 07:11:19,790 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:19,801 INFO L267 ElimStorePlain]: Start of recursive call 70: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:19,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2018-12-03 07:11:19,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,824 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 51 [2018-12-03 07:11:19,825 INFO L267 ElimStorePlain]: Start of recursive call 74: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 07:11:19,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-12-03 07:11:19,853 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:19,863 INFO L267 ElimStorePlain]: Start of recursive call 73: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:19,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 121 [2018-12-03 07:11:19,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 26 [2018-12-03 07:11:19,889 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:19,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 07:11:19,949 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:19,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:19,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-12-03 07:11:19,996 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:20,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-03 07:11:20,043 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:20,075 INFO L267 ElimStorePlain]: Start of recursive call 76: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:20,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:20,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:20,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2018-12-03 07:11:20,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:20,106 INFO L478 Elim1Store]: Elim1 applied some 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 17 treesize of output 33 [2018-12-03 07:11:20,106 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:11:20,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:20,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2018-12-03 07:11:20,131 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:20,142 INFO L267 ElimStorePlain]: Start of recursive call 81: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:20,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:20,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:20,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:20,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:20,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 121 [2018-12-03 07:11:20,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 26 [2018-12-03 07:11:20,169 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:20,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-03 07:11:20,253 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:20,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 07:11:20,300 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:20,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:20,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-12-03 07:11:20,339 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:20,367 INFO L267 ElimStorePlain]: Start of recursive call 84: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:22,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 167 [2018-12-03 07:11:22,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 144 [2018-12-03 07:11:22,551 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:22,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 133 [2018-12-03 07:11:22,702 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:22,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 121 [2018-12-03 07:11:22,842 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:22,924 INFO L267 ElimStorePlain]: Start of recursive call 89: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:24,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 241 treesize of output 239 [2018-12-03 07:11:24,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 224 [2018-12-03 07:11:24,981 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:25,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 193 [2018-12-03 07:11:25,245 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:25,466 INFO L267 ElimStorePlain]: Start of recursive call 93: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:27,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:27,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:27,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:27,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:27,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:27,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:27,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:27,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:27,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 163 [2018-12-03 07:11:27,521 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-03 07:11:27,521 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:27,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 104 [2018-12-03 07:11:27,657 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:27,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-12-03 07:11:27,810 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:27,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 96 [2018-12-03 07:11:27,882 INFO L267 ElimStorePlain]: Start of recursive call 100: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:27,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-03 07:11:27,944 INFO L267 ElimStorePlain]: Start of recursive call 101: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:28,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85 [2018-12-03 07:11:28,057 INFO L267 ElimStorePlain]: Start of recursive call 102: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:28,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2018-12-03 07:11:28,117 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:28,165 INFO L267 ElimStorePlain]: Start of recursive call 96: 9 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 07:11:30,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:30,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:30,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-12-03 07:11:30,185 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:30,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:30,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:30,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:30,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:30,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:30,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:30,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:30,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:30,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 93 [2018-12-03 07:11:30,203 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:32,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2018-12-03 07:11:32,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-12-03 07:11:32,102 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:32,125 INFO L267 ElimStorePlain]: Start of recursive call 106: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:32,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-12-03 07:11:32,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-12-03 07:11:32,134 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:32,154 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:32,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-12-03 07:11:32,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-03 07:11:32,158 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:32,168 INFO L267 ElimStorePlain]: Start of recursive call 110: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:32,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2018-12-03 07:11:32,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-12-03 07:11:32,177 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:32,201 INFO L267 ElimStorePlain]: Start of recursive call 112: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:32,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-12-03 07:11:32,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-03 07:11:32,205 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:32,214 INFO L267 ElimStorePlain]: Start of recursive call 114: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:32,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-12-03 07:11:32,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-12-03 07:11:32,224 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:32,245 INFO L267 ElimStorePlain]: Start of recursive call 116: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:32,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-12-03 07:11:32,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-03 07:11:32,250 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:32,260 INFO L267 ElimStorePlain]: Start of recursive call 118: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:32,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-03 07:11:32,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-03 07:11:32,263 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:32,270 INFO L267 ElimStorePlain]: Start of recursive call 120: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:33,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:33,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:33,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 193 treesize of output 221 [2018-12-03 07:11:33,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 196 [2018-12-03 07:11:33,833 INFO L267 ElimStorePlain]: Start of recursive call 123: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:37,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 151 [2018-12-03 07:11:37,214 INFO L267 ElimStorePlain]: Start of recursive call 124: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:40,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 141 [2018-12-03 07:11:40,022 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:42,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:42,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 123 [2018-12-03 07:11:42,860 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:44,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 130 [2018-12-03 07:11:44,813 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:46,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 123 [2018-12-03 07:11:46,322 INFO L267 ElimStorePlain]: Start of recursive call 128: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:49,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 152 [2018-12-03 07:11:49,583 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:51,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 119 [2018-12-03 07:11:51,033 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:53,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 123 [2018-12-03 07:11:53,372 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:54,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:54,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 156 [2018-12-03 07:11:54,425 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:55,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 147 [2018-12-03 07:11:55,460 INFO L267 ElimStorePlain]: Start of recursive call 133: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:56,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 138 [2018-12-03 07:11:56,533 INFO L267 ElimStorePlain]: Start of recursive call 134: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:58,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 136 [2018-12-03 07:11:58,627 INFO L267 ElimStorePlain]: Start of recursive call 135: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:11:59,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:59,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 151 [2018-12-03 07:11:59,659 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:00,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 126 [2018-12-03 07:12:00,603 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:02,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 119 [2018-12-03 07:12:02,357 INFO L267 ElimStorePlain]: Start of recursive call 138: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:12:04,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 123 [2018-12-03 07:12:04,028 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:05,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 128 [2018-12-03 07:12:05,805 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:06,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 119 [2018-12-03 07:12:06,649 INFO L267 ElimStorePlain]: Start of recursive call 141: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:12:07,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 140 [2018-12-03 07:12:07,429 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:08,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 131 [2018-12-03 07:12:08,180 INFO L267 ElimStorePlain]: Start of recursive call 143: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:12:09,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:09,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 126 [2018-12-03 07:12:09,764 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:10,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 119 [2018-12-03 07:12:10,484 INFO L267 ElimStorePlain]: Start of recursive call 145: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:12:11,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 119 [2018-12-03 07:12:11,892 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:13,206 INFO L267 ElimStorePlain]: Start of recursive call 122: 33 dim-1 vars, End of recursive call: 10 dim-0 vars, and 9 xjuncts. [2018-12-03 07:12:16,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:16,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:16,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:16,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:16,194 INFO L478 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 6 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 133 [2018-12-03 07:12:16,273 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 126 [2018-12-03 07:12:16,274 INFO L267 ElimStorePlain]: Start of recursive call 148: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:12:17,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 78 [2018-12-03 07:12:17,233 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 2 xjuncts. [2018-12-03 07:12:17,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2018-12-03 07:12:17,410 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 2 xjuncts. [2018-12-03 07:12:17,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 95 [2018-12-03 07:12:17,741 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 32 xjuncts. [2018-12-03 07:12:17,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 63 [2018-12-03 07:12:17,915 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-03 07:12:17,916 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 2 xjuncts. [2018-12-03 07:12:17,937 INFO L267 ElimStorePlain]: Start of recursive call 147: 14 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:17,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:17,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:17,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:17,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:18,030 INFO L478 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 6 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 133 [2018-12-03 07:12:18,104 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 126 [2018-12-03 07:12:18,105 INFO L267 ElimStorePlain]: Start of recursive call 154: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:12:18,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 78 [2018-12-03 07:12:18,468 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 2 xjuncts. [2018-12-03 07:12:18,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 43 [2018-12-03 07:12:18,699 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:18,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 73 [2018-12-03 07:12:18,862 INFO L267 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 32 xjuncts. [2018-12-03 07:12:19,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 92 [2018-12-03 07:12:19,181 INFO L267 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 4 xjuncts. [2018-12-03 07:12:19,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 61 [2018-12-03 07:12:19,389 INFO L267 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 4 xjuncts. [2018-12-03 07:12:19,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 15 [2018-12-03 07:12:19,501 INFO L267 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:19,523 INFO L267 ElimStorePlain]: Start of recursive call 153: 14 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:19,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:19,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:19,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:19,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:19,605 INFO L478 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 6 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 133 [2018-12-03 07:12:19,674 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 126 [2018-12-03 07:12:19,675 INFO L267 ElimStorePlain]: Start of recursive call 162: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:12:20,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 95 [2018-12-03 07:12:20,018 INFO L267 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 32 xjuncts. [2018-12-03 07:12:20,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 18 [2018-12-03 07:12:20,315 INFO L267 ElimStorePlain]: Start of recursive call 164: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:20,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 73 [2018-12-03 07:12:20,798 INFO L267 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:20,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 66 [2018-12-03 07:12:20,929 INFO L267 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 2 xjuncts. [2018-12-03 07:12:21,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 77 [2018-12-03 07:12:21,047 INFO L267 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 4 xjuncts. [2018-12-03 07:12:21,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2018-12-03 07:12:21,168 INFO L267 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 2 xjuncts. [2018-12-03 07:12:21,183 INFO L267 ElimStorePlain]: Start of recursive call 161: 11 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:21,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:21,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:21,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:21,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:21,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:21,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:21,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:21,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 145 [2018-12-03 07:12:21,408 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 131 treesize of output 176 [2018-12-03 07:12:21,408 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-12-03 07:12:21,411 INFO L267 ElimStorePlain]: Start of recursive call 170: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-12-03 07:12:21,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 96 [2018-12-03 07:12:21,884 INFO L267 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 4 xjuncts. [2018-12-03 07:12:22,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 85 [2018-12-03 07:12:22,096 INFO L267 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 2 xjuncts. [2018-12-03 07:12:22,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 55 [2018-12-03 07:12:22,227 INFO L267 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 2 xjuncts. [2018-12-03 07:12:22,274 INFO L267 ElimStorePlain]: Start of recursive call 169: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:22,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:22,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:22,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:22,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:22,355 INFO L478 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 6 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 133 [2018-12-03 07:12:22,428 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 126 [2018-12-03 07:12:22,429 INFO L267 ElimStorePlain]: Start of recursive call 175: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:12:24,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 77 [2018-12-03 07:12:24,663 INFO L267 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:24,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 81 [2018-12-03 07:12:24,873 INFO L267 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 4 xjuncts. [2018-12-03 07:12:25,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 43 [2018-12-03 07:12:25,061 INFO L267 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:25,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 50 [2018-12-03 07:12:25,197 INFO L267 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 4 xjuncts. [2018-12-03 07:12:25,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 70 [2018-12-03 07:12:25,310 INFO L267 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 32 xjuncts. [2018-12-03 07:12:25,411 INFO L267 ElimStorePlain]: Start of recursive call 174: 17 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:25,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:25,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:25,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:25,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:25,510 INFO L478 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 6 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 133 [2018-12-03 07:12:25,516 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-03 07:12:25,516 INFO L267 ElimStorePlain]: Start of recursive call 182: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:25,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 111 [2018-12-03 07:12:25,833 INFO L267 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 4 xjuncts. [2018-12-03 07:12:26,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 76 [2018-12-03 07:12:26,485 INFO L267 ElimStorePlain]: Start of recursive call 184: End of recursive call: and 2 xjuncts. [2018-12-03 07:12:26,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 47 [2018-12-03 07:12:26,657 INFO L267 ElimStorePlain]: Start of recursive call 185: End of recursive call: and 2 xjuncts. [2018-12-03 07:12:26,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 80 [2018-12-03 07:12:26,949 INFO L267 ElimStorePlain]: Start of recursive call 186: End of recursive call: and 2 xjuncts. [2018-12-03 07:12:27,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 70 [2018-12-03 07:12:27,047 INFO L267 ElimStorePlain]: Start of recursive call 187: End of recursive call: and 32 xjuncts. [2018-12-03 07:12:27,109 INFO L267 ElimStorePlain]: Start of recursive call 181: 14 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:27,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:27,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:27,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:27,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:27,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:27,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:27,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:27,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 137 [2018-12-03 07:12:27,172 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-03 07:12:27,172 INFO L267 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:27,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 92 [2018-12-03 07:12:27,681 INFO L267 ElimStorePlain]: Start of recursive call 190: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:27,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 96 [2018-12-03 07:12:27,849 INFO L267 ElimStorePlain]: Start of recursive call 191: End of recursive call: and 4 xjuncts. [2018-12-03 07:12:28,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 65 [2018-12-03 07:12:28,099 INFO L267 ElimStorePlain]: Start of recursive call 192: End of recursive call: and 4 xjuncts. [2018-12-03 07:12:28,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2018-12-03 07:12:28,208 INFO L267 ElimStorePlain]: Start of recursive call 193: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:28,243 INFO L267 ElimStorePlain]: Start of recursive call 188: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:28,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:28,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:28,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:28,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:28,335 INFO L478 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 6 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 133 [2018-12-03 07:12:28,410 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 126 [2018-12-03 07:12:28,410 INFO L267 ElimStorePlain]: Start of recursive call 195: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:12:28,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 96 [2018-12-03 07:12:28,873 INFO L267 ElimStorePlain]: Start of recursive call 196: End of recursive call: and 4 xjuncts. [2018-12-03 07:12:29,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 75 [2018-12-03 07:12:29,620 INFO L267 ElimStorePlain]: Start of recursive call 197: End of recursive call: and 2 xjuncts. [2018-12-03 07:12:29,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 55 [2018-12-03 07:12:29,814 INFO L267 ElimStorePlain]: Start of recursive call 198: End of recursive call: and 2 xjuncts. [2018-12-03 07:12:29,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 88 [2018-12-03 07:12:29,953 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-03 07:12:29,954 INFO L267 ElimStorePlain]: Start of recursive call 199: End of recursive call: and 2 xjuncts. [2018-12-03 07:12:30,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 70 [2018-12-03 07:12:30,112 INFO L267 ElimStorePlain]: Start of recursive call 200: End of recursive call: and 32 xjuncts. [2018-12-03 07:12:30,194 INFO L267 ElimStorePlain]: Start of recursive call 194: 14 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:30,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:30,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:30,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:30,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:30,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:30,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:30,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:30,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 137 [2018-12-03 07:12:30,404 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 123 treesize of output 168 [2018-12-03 07:12:30,405 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-12-03 07:12:30,407 INFO L267 ElimStorePlain]: Start of recursive call 202: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-12-03 07:12:31,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 83 [2018-12-03 07:12:31,289 INFO L267 ElimStorePlain]: Start of recursive call 203: End of recursive call: and 2 xjuncts. [2018-12-03 07:12:31,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 77 [2018-12-03 07:12:31,412 INFO L267 ElimStorePlain]: Start of recursive call 204: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:31,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 55 [2018-12-03 07:12:31,531 INFO L267 ElimStorePlain]: Start of recursive call 205: End of recursive call: and 2 xjuncts. [2018-12-03 07:12:31,571 INFO L267 ElimStorePlain]: Start of recursive call 201: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:31,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 12 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:31,709 INFO L202 ElimStorePlain]: Needed 205 recursive calls to eliminate 24 variables, input treesize:821, output treesize:15 [2018-12-03 07:12:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 07:12:31,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:12:34,145 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-03 07:12:34,413 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-03 07:12:34,576 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-03 07:12:34,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-03 07:12:34,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 5 [2018-12-03 07:12:34,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:34,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:34,756 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:12:34,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:12:34,761 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:34,766 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:34,766 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:34,771 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:34,820 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:34,824 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:34,824 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:34,827 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:34,827 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:12:34,832 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:12:34,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 07:12:34,870 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:130, output treesize:99 [2018-12-03 07:12:35,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 07:12:35,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 55 [2018-12-03 07:12:35,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 07:12:35,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 07:12:35,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=4825, Unknown=5, NotChecked=0, Total=5112 [2018-12-03 07:12:35,212 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 55 states. [2018-12-03 07:12:38,219 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-12-03 07:12:40,954 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2018-12-03 07:12:42,939 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 65 [2018-12-03 07:12:43,435 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 56 [2018-12-03 07:12:44,102 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 62 [2018-12-03 07:12:44,626 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 68 [2018-12-03 07:12:45,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:12:45,218 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-12-03 07:12:45,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 07:12:45,219 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 68 [2018-12-03 07:12:45,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:12:45,220 INFO L225 Difference]: With dead ends: 109 [2018-12-03 07:12:45,220 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 07:12:45,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 104 SyntacticMatches, 7 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2327 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=537, Invalid=8014, Unknown=5, NotChecked=0, Total=8556 [2018-12-03 07:12:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 07:12:45,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-12-03 07:12:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 07:12:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2018-12-03 07:12:45,233 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 68 [2018-12-03 07:12:45,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:12:45,233 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2018-12-03 07:12:45,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 07:12:45,233 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2018-12-03 07:12:45,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 07:12:45,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:12:45,234 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:12:45,234 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:12:45,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:12:45,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1621997390, now seen corresponding path program 4 times [2018-12-03 07:12:45,234 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:12:45,234 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:12:45,250 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 07:12:45,343 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 07:12:45,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:12:45,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:12:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 07:12:45,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:12:45,488 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 07:12:45,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:12:45,490 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:12:45,497 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 07:12:45,524 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 07:12:45,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:12:45,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:12:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 07:12:45,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:12:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 07:12:45,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:12:45,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-03 07:12:45,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:12:45,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:12:45,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:12:45,588 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 9 states. [2018-12-03 07:12:45,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:12:45,725 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2018-12-03 07:12:45,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:12:45,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-12-03 07:12:45,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:12:45,726 INFO L225 Difference]: With dead ends: 117 [2018-12-03 07:12:45,726 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 07:12:45,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 263 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-12-03 07:12:45,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 07:12:45,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 07:12:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 07:12:45,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-12-03 07:12:45,734 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 68 [2018-12-03 07:12:45,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:12:45,735 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-12-03 07:12:45,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:12:45,735 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-12-03 07:12:45,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 07:12:45,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:12:45,735 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:12:45,735 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:12:45,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:12:45,735 INFO L82 PathProgramCache]: Analyzing trace with hash 813747786, now seen corresponding path program 2 times [2018-12-03 07:12:45,736 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:12:45,736 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:12:45,754 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-03 07:12:45,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:12:45,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:12:45,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:12:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 07:12:45,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:12:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 07:12:46,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:12:46,072 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c45fe37-5820-47cc-a89b-bb80389d2aa9/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:12:46,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-03 07:12:47,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:12:47,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:12:47,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:12:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 07:12:47,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:12:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 07:12:47,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:12:47,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-03 07:12:47,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 07:12:47,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 07:12:47,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-03 07:12:47,484 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 18 states. [2018-12-03 07:12:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:12:48,044 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-12-03 07:12:48,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 07:12:48,045 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2018-12-03 07:12:48,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:12:48,045 INFO L225 Difference]: With dead ends: 69 [2018-12-03 07:12:48,045 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 07:12:48,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-12-03 07:12:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 07:12:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 07:12:48,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 07:12:48,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 07:12:48,045 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2018-12-03 07:12:48,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:12:48,046 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 07:12:48,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 07:12:48,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 07:12:48,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 07:12:48,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 07:12:48,835 WARN L180 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2018-12-03 07:12:49,077 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-12-03 07:12:49,568 WARN L180 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2018-12-03 07:12:49,938 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2018-12-03 07:12:50,304 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2018-12-03 07:12:50,586 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2018-12-03 07:12:50,588 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-03 07:12:50,588 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-12-03 07:12:50,588 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 07:12:50,588 INFO L451 ceAbstractionStarter]: At program point myexitENTRY(lines 561 563) the Hoare annotation is: true [2018-12-03 07:12:50,588 INFO L448 ceAbstractionStarter]: For program point myexitFINAL(lines 561 563) no Hoare annotation was computed. [2018-12-03 07:12:50,588 INFO L448 ceAbstractionStarter]: For program point myexitEXIT(lines 561 563) no Hoare annotation was computed. [2018-12-03 07:12:50,589 INFO L451 ceAbstractionStarter]: At program point L562(line 562) the Hoare annotation is: true [2018-12-03 07:12:50,589 INFO L451 ceAbstractionStarter]: At program point dll_circular_destroyENTRY(lines 590 600) the Hoare annotation is: true [2018-12-03 07:12:50,589 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 599) no Hoare annotation was computed. [2018-12-03 07:12:50,589 INFO L451 ceAbstractionStarter]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2018-12-03 07:12:50,589 INFO L448 ceAbstractionStarter]: For program point L593-3(lines 593 597) no Hoare annotation was computed. [2018-12-03 07:12:50,589 INFO L448 ceAbstractionStarter]: For program point L591-2(lines 590 600) no Hoare annotation was computed. [2018-12-03 07:12:50,589 INFO L448 ceAbstractionStarter]: For program point dll_circular_destroyEXIT(lines 590 600) no Hoare annotation was computed. [2018-12-03 07:12:50,589 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 07:12:50,589 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-03 07:12:50,589 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 07:12:50,589 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 07:12:50,589 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 632) no Hoare annotation was computed. [2018-12-03 07:12:50,589 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 615 634) no Hoare annotation was computed. [2018-12-03 07:12:50,589 INFO L448 ceAbstractionStarter]: For program point L630(line 630) no Hoare annotation was computed. [2018-12-03 07:12:50,589 INFO L444 ceAbstractionStarter]: At program point L626(line 626) the Hoare annotation is: (let ((.cse19 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse7 (select .cse19 (_ bv4 32)))) (let ((.cse20 (select |#memory_$Pointer$.base| .cse7))) (let ((.cse3 (select .cse19 main_~s~0.offset)) (.cse6 (bvneg main_~len~0)) (.cse13 (select .cse20 (_ bv4 32))) (.cse0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))))) (let ((.cse9 (select .cse19 (_ bv0 32))) (.cse8 (= main_~s~0.offset (_ bv0 32))) (.cse1 (= .cse0 main_~len~0)) (.cse4 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse10 (= .cse13 main_~s~0.base)) (.cse11 (= (bvadd .cse6 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse12 (= (select .cse20 (_ bv0 32)) main_~s~0.base)) (.cse5 (select |#memory_int| .cse3))) (or (let ((.cse2 (select |#memory_$Pointer$.offset| .cse13))) (and (= .cse0 main_~expected~0) .cse1 (= (_ bv0 32) (select .cse2 (_ bv4 32))) (= main_~i~0 (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse3) (_ bv0 32))) .cse4 (= (select .cse2 (_ bv0 32)) (_ bv0 32)) (= (bvadd (select .cse5 (bvadd (select .cse2 main_~s~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (bvneg .cse6)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse7) (_ bv4 32))) .cse8 (= .cse7 .cse9) .cse10 .cse11 .cse12)) (let ((.cse16 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse18 (select .cse19 .cse16))) (let ((.cse14 (select |#memory_$Pointer$.offset| .cse18)) (.cse17 (bvadd (bvneg main_~i~0) main_~expected~0)) (.cse15 (select |#memory_$Pointer$.offset| main_~s~0.base))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| .cse9) (_ bv4 32))) (_ bv4 32))) (= main_~s~0.offset (select .cse14 (select .cse15 .cse16))) (= (_ bv2 32) .cse17) .cse8 (and .cse1 .cse4) (= .cse18 .cse3) (= main_~s~0.offset (select .cse14 (_ bv4 32))) (= (select .cse15 (_ bv0 32)) (_ bv0 32)) .cse10 .cse11 .cse12 (= (bvadd (bvneg (bvneg .cse17)) (_ bv1 32)) (select .cse5 (bvadd (select .cse15 main_~s~0.offset) (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))))))))))) [2018-12-03 07:12:50,589 INFO L448 ceAbstractionStarter]: For program point L626-1(lines 626 628) no Hoare annotation was computed. [2018-12-03 07:12:50,590 INFO L444 ceAbstractionStarter]: At program point L622(line 622) the Hoare annotation is: (let ((.cse9 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse13 (select .cse9 (_ bv0 32)))) (let ((.cse8 (select |#memory_$Pointer$.base| .cse13))) (let ((.cse1 (select .cse8 (_ bv4 32))) (.cse12 (select .cse9 (_ bv4 32)))) (let ((.cse0 (select |#memory_$Pointer$.offset| .cse12)) (.cse6 (select |#memory_$Pointer$.offset| .cse1))) (let ((.cse2 (= (_ bv0 32) (select .cse6 (_ bv4 32)))) (.cse7 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse3 (= (_ bv0 32) (select .cse0 (_ bv4 32)))) (.cse4 (= main_~s~0.offset (_ bv0 32))) (.cse5 (= .cse12 .cse13))) (or (and (= (select .cse0 (_ bv0 32)) (_ bv0 32)) (= main_~len~0 main_~new_data~0) (= .cse1 main_~s~0.base) .cse2 .cse3 .cse4 .cse5 (= (_ bv0 32) (select .cse6 (_ bv0 32))) (= main_~i~0 (_ bv0 32)) .cse7 (not (= .cse8 .cse9)) (= (select .cse8 (_ bv0 32)) main_~s~0.base)) (let ((.cse10 (select |#memory_$Pointer$.offset| main_~s~0.base)) (.cse11 (select |#memory_$Pointer$.base| .cse12))) (and .cse2 (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) .cse7 (= (select (select |#memory_$Pointer$.offset| (select .cse9 main_~s~0.offset)) (select .cse10 (bvadd main_~s~0.offset (_ bv4 32)))) main_~s~0.offset) .cse3 .cse4 .cse5 (= (select .cse10 (_ bv0 32)) (_ bv0 32)) (= (select .cse11 (_ bv4 32)) main_~s~0.base) (= (bvadd (bvneg main_~len~0) main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32)) (= (select .cse11 (_ bv0 32)) main_~s~0.base) (not (= .cse11 .cse9)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))))))))) [2018-12-03 07:12:50,590 INFO L448 ceAbstractionStarter]: For program point L624-2(lines 624 629) no Hoare annotation was computed. [2018-12-03 07:12:50,590 INFO L448 ceAbstractionStarter]: For program point L622-1(lines 620 623) no Hoare annotation was computed. [2018-12-03 07:12:50,590 INFO L444 ceAbstractionStarter]: At program point L624-3(lines 624 629) the Hoare annotation is: (let ((.cse19 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse14 (select .cse19 (_ bv4 32)))) (let ((.cse15 (select |#memory_$Pointer$.base| .cse14))) (let ((.cse17 (select .cse15 (_ bv4 32)))) (let ((.cse2 (select .cse19 (_ bv0 32))) (.cse11 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse13 (= main_~i~0 (_ bv0 32))) (.cse12 (select |#memory_$Pointer$.offset| .cse17)) (.cse16 (bvneg main_~len~0)) (.cse18 (select .cse19 main_~s~0.offset))) (let ((.cse10 (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0)) (.cse0 (select |#memory_$Pointer$.offset| .cse18)) (.cse1 (= (bvadd (select (select |#memory_int| .cse18) (bvadd (select .cse12 main_~s~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (bvneg .cse16))) (.cse8 (or (and (bvsgt main_~i~0 (_ bv0 32)) .cse11) (and .cse11 .cse13))) (.cse9 (= main_~s~0.offset (_ bv0 32))) (.cse3 (= .cse14 .cse2)) (.cse5 (= .cse17 main_~s~0.base)) (.cse6 (= (bvadd .cse16 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse7 (= (select .cse15 (_ bv0 32)) main_~s~0.base))) (or (let ((.cse4 (select |#memory_$Pointer$.offset| main_~s~0.base))) (and (= main_~s~0.offset (select .cse0 (_ bv4 32))) .cse1 (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| .cse2) (_ bv4 32))) (_ bv4 32))) .cse3 (= (select .cse4 (_ bv0 32)) (_ bv0 32)) (= (select .cse0 (select .cse4 (bvadd main_~s~0.offset (_ bv4 32)))) main_~s~0.offset) .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))) (and .cse11 (= (_ bv2 32) main_~i~0)) (and .cse10 (= (_ bv0 32) (select .cse12 (_ bv4 32))) .cse13 (= (_ bv0 32) (select .cse0 (_ bv0 32))) (= (select .cse12 (_ bv0 32)) (_ bv0 32)) .cse1 .cse8 (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse14) (_ bv4 32))) .cse9 .cse3 .cse5 .cse6 .cse7)))))))) [2018-12-03 07:12:50,590 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 615 634) no Hoare annotation was computed. [2018-12-03 07:12:50,590 INFO L444 ceAbstractionStarter]: At program point L624-4(lines 624 629) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-12-03 07:12:50,590 INFO L444 ceAbstractionStarter]: At program point L618(line 618) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-03 07:12:50,590 INFO L444 ceAbstractionStarter]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse9 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse19 (select .cse9 (_ bv0 32)))) (let ((.cse18 (select .cse9 (_ bv4 32))) (.cse8 (select |#memory_$Pointer$.base| .cse19))) (let ((.cse1 (select .cse8 (_ bv4 32))) (.cse13 (select |#memory_$Pointer$.base| .cse18))) (let ((.cse17 (select .cse13 (_ bv4 32))) (.cse21 (select |#memory_$Pointer$.offset| .cse1)) (.cse20 (select |#memory_$Pointer$.offset| .cse18))) (let ((.cse0 (= (select .cse20 (_ bv0 32)) (_ bv0 32))) (.cse3 (= (_ bv0 32) (select .cse21 (_ bv4 32)))) (.cse6 (= (_ bv0 32) (select .cse21 (_ bv0 32)))) (.cse10 (= (select .cse8 (_ bv0 32)) main_~s~0.base)) (.cse11 (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0)) (.cse7 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse2 (= (_ bv0 32) (select .cse20 (_ bv4 32)))) (.cse4 (= main_~s~0.offset (_ bv0 32))) (.cse5 (= .cse18 .cse19)) (.cse12 (= .cse17 main_~s~0.base))) (or (and .cse0 (= .cse1 main_~s~0.base) .cse2 .cse3 .cse4 .cse5 .cse6 (= main_~i~0 (_ bv0 32)) .cse7 (not (= .cse8 .cse9)) .cse10) (and .cse0 (= main_~len~0 main_~new_data~0) .cse3 .cse11 .cse6 .cse7 .cse10 .cse2 .cse4 .cse5 .cse12 (not (= .cse13 .cse9)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse15 (select .cse9 main_~s~0.offset)) (.cse14 (select |#memory_$Pointer$.offset| .cse17)) (.cse16 (bvneg main_~len~0))) (and .cse11 (= (_ bv0 32) (select .cse14 (_ bv4 32))) .cse7 (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse15) (_ bv0 32))) (= (select .cse14 (_ bv0 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| .cse15) (bvadd (select .cse14 main_~s~0.offset) (_ bv8 32))) (_ bv4294967295 32)) (bvneg .cse16)) .cse2 .cse4 .cse5 .cse12 (= (bvadd .cse16 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= (select .cse13 (_ bv0 32)) main_~s~0.base)))))))))) [2018-12-03 07:12:50,590 INFO L448 ceAbstractionStarter]: For program point L618-1(line 618) no Hoare annotation was computed. [2018-12-03 07:12:50,590 INFO L448 ceAbstractionStarter]: For program point L620-3(lines 620 623) no Hoare annotation was computed. [2018-12-03 07:12:50,590 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 615 634) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-03 07:12:50,590 INFO L444 ceAbstractionStarter]: At program point L627(lines 615 634) the Hoare annotation is: false [2018-12-03 07:12:50,591 INFO L444 ceAbstractionStarter]: At program point L609-2(lines 609 612) the Hoare annotation is: (let ((.cse0 (= |old(#memory_int)| |#memory_int|)) (.cse1 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse2 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (.cse3 (= |dll_circular_update_at_#in~data| dll_circular_update_at_~data))) (let ((.cse4 (and .cse0 (= dll_circular_update_at_~index |dll_circular_update_at_#in~index|) .cse1 (= |dll_circular_update_at_#in~head.base| dll_circular_update_at_~head.base) .cse2 (= |dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset) .cse3))) (and (or (and (= (bvadd dll_circular_update_at_~index (_ bv1 32)) |dll_circular_update_at_#in~index|) .cse0 (= dll_circular_update_at_~head.base (select (select |#memory_$Pointer$.base| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|)) .cse1 (= (select (select |#memory_$Pointer$.offset| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|) dll_circular_update_at_~head.offset) .cse2 .cse3) .cse4 (and (bvsgt (bvadd |dll_circular_update_at_#in~index| (_ bv4294967295 32)) (_ bv0 32)) .cse0 .cse2)) (or .cse4 (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))))) [2018-12-03 07:12:50,591 INFO L448 ceAbstractionStarter]: For program point L609-3(lines 609 612) no Hoare annotation was computed. [2018-12-03 07:12:50,591 INFO L448 ceAbstractionStarter]: For program point dll_circular_update_atFINAL(lines 608 614) no Hoare annotation was computed. [2018-12-03 07:12:50,591 INFO L448 ceAbstractionStarter]: For program point dll_circular_update_atEXIT(lines 608 614) no Hoare annotation was computed. [2018-12-03 07:12:50,591 INFO L444 ceAbstractionStarter]: At program point dll_circular_update_atENTRY(lines 608 614) the Hoare annotation is: (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-03 07:12:50,591 INFO L448 ceAbstractionStarter]: For program point L578-1(line 578) no Hoare annotation was computed. [2018-12-03 07:12:50,591 INFO L444 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |dll_circular_create_#in~len| dll_circular_create_~len) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-03 07:12:50,591 INFO L444 ceAbstractionStarter]: At program point L577-2(lines 577 585) the Hoare annotation is: (let ((.cse2 (bvadd |dll_circular_create_#in~len| (_ bv4294967295 32))) (.cse0 (= (_ bv0 32) dll_circular_create_~head~0.offset)) (.cse3 (= (_ bv0 32) dll_circular_create_~new_head~0.offset)) (.cse1 (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))) (or (and (not (= dll_circular_create_~head~0.base (_ bv0 32))) .cse0 (= (bvadd (select |#valid| dll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= |dll_circular_create_#in~len| dll_circular_create_~len) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) .cse1) (and (bvsgt .cse2 (_ bv1 32)) .cse0 .cse3) (let ((.cse4 (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (_ bv4 32)))) (and (= .cse2 dll_circular_create_~len) (= dll_circular_create_~head~0.base .cse4) (= (select (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~last~0.base) (= dll_circular_create_~new_head~0.base .cse4) (= (_ bv0 32) dll_circular_create_~last~0.offset) .cse0 .cse3 (not .cse1) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse4) dll_circular_create_~last~0.offset)) (= dll_circular_create_~new_head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) (_ bv4 32))))))) [2018-12-03 07:12:50,591 INFO L448 ceAbstractionStarter]: For program point dll_circular_createEXIT(lines 574 589) no Hoare annotation was computed. [2018-12-03 07:12:50,591 INFO L448 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-12-03 07:12:50,591 INFO L448 ceAbstractionStarter]: For program point L577-3(lines 577 585) no Hoare annotation was computed. [2018-12-03 07:12:50,591 INFO L448 ceAbstractionStarter]: For program point dll_circular_createFINAL(lines 574 589) no Hoare annotation was computed. [2018-12-03 07:12:50,591 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 582) no Hoare annotation was computed. [2018-12-03 07:12:50,591 INFO L444 ceAbstractionStarter]: At program point dll_circular_createENTRY(lines 574 589) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-03 07:12:50,591 INFO L444 ceAbstractionStarter]: At program point L578(line 578) the Hoare annotation is: (or (bvsgt (bvadd |dll_circular_create_#in~len| (_ bv4294967295 32)) (_ bv1 32)) (and (not (= dll_circular_create_~head~0.base (_ bv0 32))) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (bvadd (select |#valid| dll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= |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-12-03 07:12:50,591 INFO L448 ceAbstractionStarter]: For program point L580-2(lines 580 582) no Hoare annotation was computed. [2018-12-03 07:12:50,591 INFO L444 ceAbstractionStarter]: At program point node_createENTRY(lines 564 573) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-03 07:12:50,591 INFO L448 ceAbstractionStarter]: For program point node_createFINAL(lines 564 573) no Hoare annotation was computed. [2018-12-03 07:12:50,591 INFO L451 ceAbstractionStarter]: At program point L567(line 567) the Hoare annotation is: true [2018-12-03 07:12:50,591 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-12-03 07:12:50,591 INFO L448 ceAbstractionStarter]: For program point node_createEXIT(lines 564 573) no Hoare annotation was computed. [2018-12-03 07:12:50,592 INFO L448 ceAbstractionStarter]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2018-12-03 07:12:50,592 INFO L448 ceAbstractionStarter]: For program point dll_circular_get_data_atFINAL(lines 601 607) no Hoare annotation was computed. [2018-12-03 07:12:50,592 INFO L448 ceAbstractionStarter]: For program point dll_circular_get_data_atEXIT(lines 601 607) no Hoare annotation was computed. [2018-12-03 07:12:50,592 INFO L451 ceAbstractionStarter]: At program point dll_circular_get_data_atENTRY(lines 601 607) the Hoare annotation is: true [2018-12-03 07:12:50,592 INFO L444 ceAbstractionStarter]: At program point L602-2(lines 602 605) the Hoare annotation is: (let ((.cse0 (and (= |dll_circular_get_data_at_#in~head.base| dll_circular_get_data_at_~head.base) (= |dll_circular_get_data_at_#in~index| dll_circular_get_data_at_~index) (= dll_circular_get_data_at_~head.offset |dll_circular_get_data_at_#in~head.offset|))) (.cse2 (forall ((v_main_~s~0.base_BEFORE_CALL_6 (_ BitVec 32))) (not (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_6) (_ bv8 32)))))) (.cse3 (forall ((v_main_~s~0.base_BEFORE_CALL_14 (_ BitVec 32))) (let ((.cse11 (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_14))) (let ((.cse5 (select .cse11 (_ bv4 32)))) (let ((.cse10 (select |#memory_$Pointer$.base| .cse5))) (let ((.cse4 (select .cse10 (_ bv4 32)))) (let ((.cse8 (select |#memory_$Pointer$.offset| .cse4)) (.cse6 (select .cse11 (_ bv0 32)))) (let ((.cse7 (select |#memory_$Pointer$.offset| .cse6)) (.cse9 (select .cse8 (_ bv0 32)))) (or (not (= .cse4 v_main_~s~0.base_BEFORE_CALL_14)) (not (= .cse5 .cse6)) (= v_main_~s~0.base_BEFORE_CALL_14 .cse6) (not (= (select .cse7 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 32) (select .cse7 (_ bv0 32)))) (not (= (select .cse8 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv3 32) (select (select |#memory_int| .cse6) (bvadd .cse9 (_ bv8 32))))) (not (= .cse9 (_ bv0 32))) (not (= v_main_~s~0.base_BEFORE_CALL_14 (select .cse10 (_ bv0 32)))))))))))))) (and (let ((.cse1 (bvadd |dll_circular_get_data_at_#in~index| (_ bv4294967295 32)))) (or .cse0 (bvsgt .cse1 (_ bv0 32)) .cse2 (and (= (select (select |#memory_$Pointer$.base| |dll_circular_get_data_at_#in~head.base|) |dll_circular_get_data_at_#in~head.offset|) dll_circular_get_data_at_~head.base) (= .cse1 dll_circular_get_data_at_~index) (= (select (select |#memory_$Pointer$.offset| |dll_circular_get_data_at_#in~head.base|) |dll_circular_get_data_at_#in~head.offset|) dll_circular_get_data_at_~head.offset)) .cse3)) (or .cse0 .cse2 .cse3 (bvsgt |dll_circular_get_data_at_#in~index| (_ bv0 32))))) [2018-12-03 07:12:50,592 INFO L448 ceAbstractionStarter]: For program point L602-3(lines 602 605) no Hoare annotation was computed. [2018-12-03 07:12:50,597 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,597 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,598 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,598 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,598 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,598 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,598 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,598 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,598 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,598 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,599 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,599 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,599 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,599 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,599 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,599 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,600 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,600 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,604 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,605 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,605 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,605 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,605 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,605 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,605 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,605 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,605 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,605 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,605 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,606 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,606 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,606 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,606 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,606 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,610 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-03 07:12:50,611 INFO L168 Benchmark]: Toolchain (without parser) took 208616.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -144.3 MB). Peak memory consumption was 317.2 MB. Max. memory is 11.5 GB. [2018-12-03 07:12:50,612 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:12:50,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-03 07:12:50,612 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:12:50,612 INFO L168 Benchmark]: Boogie Preprocessor took 21.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-03 07:12:50,612 INFO L168 Benchmark]: RCFGBuilder took 276.77 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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2018-12-03 07:12:50,613 INFO L168 Benchmark]: TraceAbstraction took 207987.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 325.4 MB. Max. memory is 11.5 GB. [2018-12-03 07:12:50,614 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 309.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 276.77 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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 207987.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 325.4 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$.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$.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$.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$.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$.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$.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$.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$.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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: 632]: 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: 609]: Loop Invariant [2018-12-03 07:12:50,616 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,616 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,616 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,617 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,617 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,617 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,617 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,617 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,617 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,617 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,617 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,617 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,617 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,617 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,617 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,618 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,620 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,620 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,620 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,620 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,620 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,620 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,620 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,620 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,621 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,621 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,621 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,621 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,621 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,621 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:12:50,621 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,621 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:12:50,621 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,621 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:12:50,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:12:50,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((~bvadd64(index, 1bv32) == \old(index) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && head == #memory_$Pointer$[head][head]) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$[head][head] == head) && \old(#memory_$Pointer$) == #memory_$Pointer$) && \old(data) == data) || ((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && index == \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && head == head) && \old(#memory_$Pointer$) == #memory_$Pointer$) && head == head) && \old(data) == data)) || ((~bvsgt32(~bvadd64(\old(index), 4294967295bv32), 0bv32) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$)) && (((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && index == \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && head == head) && \old(#memory_$Pointer$) == #memory_$Pointer$) && head == head) && \old(data) == data) || ~bvsgt32(\old(index), 0bv32)) - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: 1 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...