./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_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:41:43,151 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:41:43,152 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:41:43,158 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:41:43,158 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:41:43,158 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:41:43,159 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:41:43,160 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:41:43,160 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:41:43,161 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:41:43,161 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:41:43,161 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:41:43,162 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:41:43,162 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:41:43,163 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:41:43,163 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:41:43,164 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:41:43,164 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:41:43,165 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:41:43,166 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:41:43,166 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:41:43,167 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:41:43,168 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:41:43,168 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:41:43,168 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:41:43,169 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:41:43,169 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:41:43,170 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:41:43,170 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:41:43,170 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:41:43,171 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:41:43,171 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:41:43,171 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:41:43,171 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:41:43,172 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:41:43,172 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:41:43,172 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 01:41:43,179 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:41:43,179 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:41:43,180 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:41:43,180 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:41:43,180 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 01:41:43,180 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 01:41:43,180 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 01:41:43,180 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 01:41:43,180 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 01:41:43,180 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 01:41:43,180 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 01:41:43,181 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 01:41:43,181 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 01:41:43,181 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:41:43,181 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:41:43,181 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:41:43,181 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:41:43,181 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:41:43,182 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 01:41:43,182 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:41:43,182 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 01:41:43,182 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:41:43,182 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 01:41:43,182 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 01:41:43,182 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:41:43,182 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:41:43,182 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:41:43,182 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:41:43,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:41:43,183 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:41:43,183 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:41:43,183 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 01:41:43,183 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 01:41:43,183 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:41:43,183 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 01:41:43,183 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 01:41:43,183 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_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:41:43,201 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:41:43,211 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:41:43,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:41:43,215 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:41:43,215 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:41:43,216 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:41:43,258 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/bin-2019/utaipan/data/048085ca2/9ed918ff16884736804ff4a588d58952/FLAGdad474161 [2018-12-09 01:41:43,698 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:41:43,698 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:41:43,705 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/bin-2019/utaipan/data/048085ca2/9ed918ff16884736804ff4a588d58952/FLAGdad474161 [2018-12-09 01:41:43,713 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/bin-2019/utaipan/data/048085ca2/9ed918ff16884736804ff4a588d58952 [2018-12-09 01:41:43,715 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:41:43,715 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:41:43,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:41:43,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:41:43,718 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:41:43,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:41:43" (1/1) ... [2018-12-09 01:41:43,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b1aa1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:43, skipping insertion in model container [2018-12-09 01:41:43,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:41:43" (1/1) ... [2018-12-09 01:41:43,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:41:43,744 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:41:43,892 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:41:43,898 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:41:43,965 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:41:43,987 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:41:43,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:43 WrapperNode [2018-12-09 01:41:43,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:41:43,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:41:43,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:41:43,988 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:41:43,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:43" (1/1) ... [2018-12-09 01:41:44,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:43" (1/1) ... [2018-12-09 01:41:44,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:41:44,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:41:44,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:41:44,007 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:41:44,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:43" (1/1) ... [2018-12-09 01:41:44,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:43" (1/1) ... [2018-12-09 01:41:44,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:43" (1/1) ... [2018-12-09 01:41:44,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:43" (1/1) ... [2018-12-09 01:41:44,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:43" (1/1) ... [2018-12-09 01:41:44,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:43" (1/1) ... [2018-12-09 01:41:44,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:43" (1/1) ... [2018-12-09 01:41:44,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:41:44,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:41:44,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:41:44,026 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:41:44,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:41:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2018-12-09 01:41:44,057 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2018-12-09 01:41:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-12-09 01:41:44,057 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-12-09 01:41:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 01:41:44,058 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 01:41:44,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:41:44,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 01:41:44,058 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2018-12-09 01:41:44,058 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2018-12-09 01:41:44,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 01:41:44,058 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-09 01:41:44,058 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-09 01:41:44,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:41:44,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:41:44,058 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:41:44,058 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:41:44,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 01:41:44,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 01:41:44,059 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-12-09 01:41:44,059 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-12-09 01:41:44,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:41:44,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:41:44,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:41:44,236 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:41:44,237 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 01:41:44,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:41:44 BoogieIcfgContainer [2018-12-09 01:41:44,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:41:44,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:41:44,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:41:44,240 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:41:44,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:41:43" (1/3) ... [2018-12-09 01:41:44,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46eb7d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:41:44, skipping insertion in model container [2018-12-09 01:41:44,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:43" (2/3) ... [2018-12-09 01:41:44,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46eb7d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:41:44, skipping insertion in model container [2018-12-09 01:41:44,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:41:44" (3/3) ... [2018-12-09 01:41:44,242 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:41:44,248 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:41:44,253 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 01:41:44,262 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 01:41:44,281 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:41:44,281 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 01:41:44,281 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:41:44,281 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:41:44,282 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:41:44,282 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:41:44,282 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:41:44,282 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:41:44,293 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-12-09 01:41:44,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 01:41:44,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:44,298 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-09 01:41:44,299 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:44,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:44,302 INFO L82 PathProgramCache]: Analyzing trace with hash 813625813, now seen corresponding path program 1 times [2018-12-09 01:41:44,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:41:44,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:44,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:44,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:44,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:41:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:44,396 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-09 01:41:44,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:44,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:41:44,398 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:41:44,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 01:41:44,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 01:41:44,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 01:41:44,410 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-12-09 01:41:44,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:44,425 INFO L93 Difference]: Finished difference Result 97 states and 127 transitions. [2018-12-09 01:41:44,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 01:41:44,426 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-12-09 01:41:44,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:44,431 INFO L225 Difference]: With dead ends: 97 [2018-12-09 01:41:44,431 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 01:41:44,433 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-09 01:41:44,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 01:41:44,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-09 01:41:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 01:41:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-12-09 01:41:44,457 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 32 [2018-12-09 01:41:44,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:44,458 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-12-09 01:41:44,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 01:41:44,458 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-12-09 01:41:44,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 01:41:44,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:44,459 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-09 01:41:44,460 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:44,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:44,460 INFO L82 PathProgramCache]: Analyzing trace with hash 400468936, now seen corresponding path program 1 times [2018-12-09 01:41:44,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:41:44,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:44,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:44,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:44,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:41:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:44,515 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-09 01:41:44,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:44,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:41:44,516 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:41:44,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:41:44,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:41:44,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:41:44,517 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 5 states. [2018-12-09 01:41:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:44,556 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2018-12-09 01:41:44,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:41:44,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-09 01:41:44,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:44,558 INFO L225 Difference]: With dead ends: 75 [2018-12-09 01:41:44,558 INFO L226 Difference]: Without dead ends: 50 [2018-12-09 01:41:44,558 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-09 01:41:44,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-09 01:41:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-12-09 01:41:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 01:41:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-12-09 01:41:44,563 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 32 [2018-12-09 01:41:44,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:44,563 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-12-09 01:41:44,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:41:44,563 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-12-09 01:41:44,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 01:41:44,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:44,564 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-09 01:41:44,564 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:44,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:44,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1119395132, now seen corresponding path program 1 times [2018-12-09 01:41:44,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:41:44,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:44,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:44,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:44,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:41:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:44,604 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-09 01:41:44,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:44,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:41:44,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:41:44,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:41:44,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:41:44,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:41:44,605 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 4 states. [2018-12-09 01:41:44,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:44,633 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-12-09 01:41:44,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:41:44,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-12-09 01:41:44,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:44,634 INFO L225 Difference]: With dead ends: 69 [2018-12-09 01:41:44,634 INFO L226 Difference]: Without dead ends: 56 [2018-12-09 01:41:44,635 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-09 01:41:44,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-09 01:41:44,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2018-12-09 01:41:44,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 01:41:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-12-09 01:41:44,640 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 42 [2018-12-09 01:41:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:44,640 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-12-09 01:41:44,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:41:44,640 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-12-09 01:41:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 01:41:44,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:44,641 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-09 01:41:44,641 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:44,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:44,642 INFO L82 PathProgramCache]: Analyzing trace with hash 296923910, now seen corresponding path program 1 times [2018-12-09 01:41:44,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:41:44,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:44,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:44,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:44,643 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:41:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:44,699 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-09 01:41:44,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:41:44,699 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:41:44,700 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-12-09 01:41:44,701 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-09 01:41:44,722 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:41:44,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:41:44,888 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 01:41:44,889 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-09 01:41:44,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:44,897 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 01:41:44,970 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 75% of their original sizes. [2018-12-09 01:41:44,970 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 01:41:45,182 INFO L418 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-12-09 01:41:45,182 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 01:41:45,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:41:45,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [5] total 24 [2018-12-09 01:41:45,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:41:45,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 01:41:45,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 01:41:45,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-12-09 01:41:45,184 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 21 states. [2018-12-09 01:41:46,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:46,159 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2018-12-09 01:41:46,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 01:41:46,159 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-12-09 01:41:46,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:46,161 INFO L225 Difference]: With dead ends: 116 [2018-12-09 01:41:46,161 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 01:41:46,162 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-09 01:41:46,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 01:41:46,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2018-12-09 01:41:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 01:41:46,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-12-09 01:41:46,168 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 50 [2018-12-09 01:41:46,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:46,169 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-12-09 01:41:46,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 01:41:46,169 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2018-12-09 01:41:46,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 01:41:46,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:46,170 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-09 01:41:46,170 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:46,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:46,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1930680310, now seen corresponding path program 1 times [2018-12-09 01:41:46,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:41:46,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:46,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:46,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:46,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:41:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:46,920 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-09 01:41:46,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:41:46,920 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:41:46,920 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-12-09 01:41:46,920 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-09 01:41:46,922 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:41:46,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:41:46,982 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:41:46,982 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-09 01:41:46,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:46,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:41:46,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:41:46,984 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:41:46,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:46,991 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:41:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:47,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:41:47,055 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-09 01:41:47,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:47,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:47,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:41:47,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:47,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:47,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 01:41:47,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:47,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:47,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 01:41:47,211 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-09 01:41:47,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 01:41:47,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:47,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:47,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:47,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-09 01:41:47,254 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-09 01:41:47,256 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-09 01:41:47,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:47,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:47,265 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-09 01:41:47,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 01:41:47,354 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-09 01:41:47,357 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-09 01:41:47,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:47,368 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-09 01:41:47,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:47,371 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-09 01:41:47,371 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:47,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:47,381 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-09 01:41:47,387 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-09 01:41:47,387 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:71, output treesize:46 [2018-12-09 01:41:47,634 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-09 01:41:47,636 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-09 01:41:47,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:47,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:47,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:47,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-09 01:41:47,695 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-09 01:41:47,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:47,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:47,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:47,705 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-09 01:41:47,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:47,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:47,721 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-09 01:41:47,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:52 [2018-12-09 01:41:48,265 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-09 01:41:48,273 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-09 01:41:48,275 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-09 01:41:48,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:48,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:48,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:48,290 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-09 01:41:48,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:48,293 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-09 01:41:48,294 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-09 01:41:48,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 7 treesize of output 1 [2018-12-09 01:41:48,300 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:48,302 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-09 01:41:48,307 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-09 01:41:48,307 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:73, output treesize:16 [2018-12-09 01:41:48,576 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-09 01:41:48,578 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-09 01:41:48,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:48,588 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-09 01:41:48,588 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:48,596 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:41:48,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 29 treesize of output 10 [2018-12-09 01:41:48,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:48,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:48,604 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-09 01:41:48,604 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:43, output treesize:10 [2018-12-09 01:41:48,651 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-09 01:41:48,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:41:49,153 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 01:41:49,307 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 01:41:49,311 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 01:42:12,839 WARN L180 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-12-09 01:42:12,841 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 01:42:12,845 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 01:42:23,403 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 75 [2018-12-09 01:42:23,406 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 01:42:29,861 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-09 01:42:29,876 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-09 01:42:29,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:29,890 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-09 01:42:29,892 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-09 01:42:29,892 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:29,893 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:29,894 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-09 01:42:29,896 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-09 01:42:29,896 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:29,899 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:29,910 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-09 01:42:29,941 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-09 01:42:29,944 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-09 01:42:29,944 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:29,947 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:29,948 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-09 01:42:29,951 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-09 01:42:29,971 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-09 01:42:29,973 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-09 01:42:29,989 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-09 01:42:30,003 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-09 01:42:30,003 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:30,016 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-09 01:42:30,017 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-09 01:42:30,017 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:30,020 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:30,021 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-09 01:42:30,022 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-09 01:42:30,022 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:30,024 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:30,035 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-09 01:42:30,056 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-09 01:42:30,056 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 8 variables, input treesize:137, output treesize:65 [2018-12-09 01:42:31,351 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 40 [2018-12-09 01:42:31,355 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-09 01:42:31,365 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-09 01:42:31,385 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-09 01:42:31,402 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-09 01:42:31,403 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:31,418 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-09 01:42:31,420 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-09 01:42:31,420 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:31,423 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:31,429 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-09 01:42:31,435 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-09 01:42:31,436 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-09 01:42:31,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 01:42:31,445 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:31,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 01:42:31,453 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:31,457 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:42:31,472 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-09 01:42:31,548 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-09 01:42:31,565 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-09 01:42:31,565 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:31,581 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-09 01:42:31,583 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-09 01:42:31,583 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:31,586 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:31,593 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-09 01:42:31,595 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-09 01:42:31,595 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:31,603 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-09 01:42:31,603 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:31,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, 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-09 01:42:31,615 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-12-09 01:42:31,621 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:42:31,635 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-09 01:42:31,730 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:31,739 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:31,740 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-09 01:42:31,746 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-09 01:42:31,747 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-09 01:42:31,753 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-09 01:42:31,754 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:31,757 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:31,758 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:31,762 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:31,763 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-09 01:42:31,768 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-09 01:42:31,850 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-09 01:42:31,850 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 8 variables, input treesize:165, output treesize:312 [2018-12-09 01:42:31,851 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2018-12-09 01:42:38,995 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-09 01:42:38,998 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-09 01:42:38,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,014 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-09 01:42:39,017 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-09 01:42:39,017 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,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 22 treesize of output 23 [2018-12-09 01:42:39,037 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,054 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-09 01:42:39,056 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-09 01:42:39,056 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,057 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,091 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-09 01:42:39,098 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-09 01:42:39,098 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,195 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-09 01:42:39,195 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-12-09 01:42:39,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:42:39,290 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-09 01:42:39,291 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:42:39,371 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:39,377 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-09 01:42:39,378 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-09 01:42:39,474 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-09 01:42:39,475 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-09 01:42:39,475 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,482 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-09 01:42:39,487 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:39,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:42:39,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, 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-09 01:42:39,488 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,489 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,493 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,495 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:39,495 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-09 01:42:39,497 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:39,498 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:39,505 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-09 01:42:39,506 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-09 01:42:39,517 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-09 01:42:39,520 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:39,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:42:39,521 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-09 01:42:39,522 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,523 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,526 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:42:39,598 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-09 01:42:39,601 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:39,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:42:39,607 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-09 01:42:39,628 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:39,628 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:39,628 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-09 01:42:39,629 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,637 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:39,637 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:39,638 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:39,639 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-09 01:42:39,639 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,640 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,642 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,763 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-09 01:42:39,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:42:39,767 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-09 01:42:39,767 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,768 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:39,783 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-09 01:42:39,791 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-09 01:42:39,794 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-09 01:42:39,797 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-09 01:42:39,797 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 5 variables, input treesize:78, output treesize:9 [2018-12-09 01:42:40,184 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-09 01:42:40,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:42:40,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 33, 31] total 85 [2018-12-09 01:42:40,199 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:42:40,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-09 01:42:40,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-09 01:42:40,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=6693, Unknown=16, NotChecked=164, Total=7140 [2018-12-09 01:42:40,201 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 59 states. [2018-12-09 01:42:44,216 WARN L180 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2018-12-09 01:42:48,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:42:48,829 INFO L93 Difference]: Finished difference Result 143 states and 188 transitions. [2018-12-09 01:42:48,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-09 01:42:48,830 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-09 01:42:48,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:42:48,830 INFO L225 Difference]: With dead ends: 143 [2018-12-09 01:42:48,831 INFO L226 Difference]: Without dead ends: 141 [2018-12-09 01:42:48,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 119 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2885 ImplicationChecksByTransitivity, 58.8s TimeCoverageRelationStatistics Valid=729, Invalid=13528, Unknown=27, NotChecked=236, Total=14520 [2018-12-09 01:42:48,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-09 01:42:48,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 99. [2018-12-09 01:42:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-09 01:42:48,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 125 transitions. [2018-12-09 01:42:48,846 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 125 transitions. Word has length 59 [2018-12-09 01:42:48,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:42:48,846 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 125 transitions. [2018-12-09 01:42:48,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-09 01:42:48,846 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 125 transitions. [2018-12-09 01:42:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 01:42:48,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:42:48,847 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-09 01:42:48,847 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:42:48,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:42:48,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2108590893, now seen corresponding path program 1 times [2018-12-09 01:42:48,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:42:48,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:48,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:42:48,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:48,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:42:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:42:48,904 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-09 01:42:48,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:42:48,904 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:42:48,904 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-12-09 01:42:48,904 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-09 01:42:48,906 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:42:48,906 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:42:48,965 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:42:48,965 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-09 01:42:48,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:42:48,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:42:48,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:42:48,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:42:48,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:42:48,975 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:42:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:42:49,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:42:49,021 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-09 01:42:49,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:42:49,060 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-09 01:42:49,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:42:49,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2018-12-09 01:42:49,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:42:49,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:42:49,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:42:49,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:42:49,083 INFO L87 Difference]: Start difference. First operand 99 states and 125 transitions. Second operand 5 states. [2018-12-09 01:42:49,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:42:49,111 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2018-12-09 01:42:49,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:42:49,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-12-09 01:42:49,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:42:49,112 INFO L225 Difference]: With dead ends: 139 [2018-12-09 01:42:49,112 INFO L226 Difference]: Without dead ends: 113 [2018-12-09 01:42:49,112 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-09 01:42:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-09 01:42:49,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 105. [2018-12-09 01:42:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 01:42:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 132 transitions. [2018-12-09 01:42:49,125 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 132 transitions. Word has length 60 [2018-12-09 01:42:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:42:49,125 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 132 transitions. [2018-12-09 01:42:49,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:42:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2018-12-09 01:42:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 01:42:49,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:42:49,126 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-09 01:42:49,126 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:42:49,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:42:49,126 INFO L82 PathProgramCache]: Analyzing trace with hash 190219152, now seen corresponding path program 2 times [2018-12-09 01:42:49,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:42:49,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:49,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:42:49,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:49,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:42:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:42:49,167 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-09 01:42:49,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:42:49,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:42:49,167 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 01:42:49,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 01:42:49,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:42:49,168 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:42:49,174 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 01:42:49,174 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 01:42:49,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 01:42:49,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:42:49,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:42:49,311 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-09 01:42:49,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:42:49,361 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-09 01:42:49,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:42:49,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-12-09 01:42:49,376 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:42:49,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:42:49,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:42:49,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:42:49,377 INFO L87 Difference]: Start difference. First operand 105 states and 132 transitions. Second operand 8 states. [2018-12-09 01:42:49,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:42:49,442 INFO L93 Difference]: Finished difference Result 168 states and 205 transitions. [2018-12-09 01:42:49,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:42:49,442 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-12-09 01:42:49,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:42:49,443 INFO L225 Difference]: With dead ends: 168 [2018-12-09 01:42:49,443 INFO L226 Difference]: Without dead ends: 117 [2018-12-09 01:42:49,444 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-09 01:42:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-09 01:42:49,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2018-12-09 01:42:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-09 01:42:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2018-12-09 01:42:49,455 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 60 [2018-12-09 01:42:49,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:42:49,455 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2018-12-09 01:42:49,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:42:49,455 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2018-12-09 01:42:49,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 01:42:49,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:42:49,456 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-09 01:42:49,456 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:42:49,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:42:49,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1621445052, now seen corresponding path program 3 times [2018-12-09 01:42:49,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:42:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:49,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:42:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:49,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:42:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:42:49,509 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-09 01:42:49,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:42:49,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:42:49,509 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 01:42:49,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 01:42:49,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:42:49,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:42:49,515 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 01:42:49,515 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 01:42:49,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 01:42:49,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:42:49,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:42:49,565 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-09 01:42:49,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:42:49,618 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-09 01:42:49,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:42:49,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-09 01:42:49,634 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:42:49,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:42:49,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:42:49,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:42:49,634 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand 8 states. [2018-12-09 01:42:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:42:49,695 INFO L93 Difference]: Finished difference Result 153 states and 181 transitions. [2018-12-09 01:42:49,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:42:49,696 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-12-09 01:42:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:42:49,696 INFO L225 Difference]: With dead ends: 153 [2018-12-09 01:42:49,696 INFO L226 Difference]: Without dead ends: 113 [2018-12-09 01:42:49,697 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-09 01:42:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-09 01:42:49,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2018-12-09 01:42:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-09 01:42:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2018-12-09 01:42:49,707 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 60 [2018-12-09 01:42:49,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:42:49,707 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2018-12-09 01:42:49,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:42:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2018-12-09 01:42:49,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 01:42:49,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:42:49,708 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-09 01:42:49,708 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:42:49,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:42:49,708 INFO L82 PathProgramCache]: Analyzing trace with hash -236153920, now seen corresponding path program 4 times [2018-12-09 01:42:49,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:42:49,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:49,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:42:49,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:49,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:42:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:42:49,740 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-09 01:42:49,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:42:49,740 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:42:49,740 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 01:42:49,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 01:42:49,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:42:49,740 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:42:49,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:42:49,748 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:42:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:42:49,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:42:49,831 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-09 01:42:49,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:42:49,865 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-09 01:42:49,880 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:42:49,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 14 [2018-12-09 01:42:49,880 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:42:49,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:42:49,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:42:49,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-09 01:42:49,881 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand 6 states. [2018-12-09 01:42:49,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:42:49,914 INFO L93 Difference]: Finished difference Result 171 states and 203 transitions. [2018-12-09 01:42:49,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:42:49,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 01:42:49,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:42:49,914 INFO L225 Difference]: With dead ends: 171 [2018-12-09 01:42:49,914 INFO L226 Difference]: Without dead ends: 99 [2018-12-09 01:42:49,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-09 01:42:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-09 01:42:49,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-12-09 01:42:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-09 01:42:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2018-12-09 01:42:49,923 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 67 [2018-12-09 01:42:49,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:42:49,923 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2018-12-09 01:42:49,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:42:49,923 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2018-12-09 01:42:49,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 01:42:49,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:42:49,924 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-09 01:42:49,924 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:42:49,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:42:49,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2144314145, now seen corresponding path program 1 times [2018-12-09 01:42:49,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:42:49,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:49,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:42:49,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:49,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:42:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:42:49,962 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-09 01:42:49,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:42:49,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:42:49,963 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-12-09 01:42:49,963 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-09 01:42:49,964 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:42:49,964 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:42:50,015 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:42:50,015 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-09 01:42:50,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:42:50,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:42:50,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:42:50,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:42:50,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:42:50,024 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:42:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:42:50,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:42:50,068 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-09 01:42:50,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:42:50,109 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-09 01:42:50,124 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:42:50,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 8 [2018-12-09 01:42:50,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:42:50,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:42:50,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:42:50,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:42:50,124 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand 6 states. [2018-12-09 01:42:50,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:42:50,160 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2018-12-09 01:42:50,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:42:50,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-09 01:42:50,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:42:50,162 INFO L225 Difference]: With dead ends: 101 [2018-12-09 01:42:50,162 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 01:42:50,162 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-09 01:42:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 01:42:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-12-09 01:42:50,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-09 01:42:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-12-09 01:42:50,173 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 69 [2018-12-09 01:42:50,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:42:50,173 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-12-09 01:42:50,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:42:50,173 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-12-09 01:42:50,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 01:42:50,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:42:50,174 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-09 01:42:50,174 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:42:50,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:42:50,174 INFO L82 PathProgramCache]: Analyzing trace with hash 792894978, now seen corresponding path program 5 times [2018-12-09 01:42:50,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:42:50,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:50,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:42:50,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:50,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:42:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:42:50,232 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-09 01:42:50,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:42:50,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:42:50,232 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 01:42:50,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 01:42:50,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:42:50,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:42:50,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 01:42:50,242 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 01:42:50,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-09 01:42:50,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:42:50,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:42:50,308 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-09 01:42:50,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:42:50,383 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-09 01:42:50,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:42:50,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 8 [2018-12-09 01:42:50,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:42:50,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:42:50,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:42:50,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:42:50,404 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 6 states. [2018-12-09 01:42:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:42:50,430 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-12-09 01:42:50,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:42:50,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-09 01:42:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:42:50,431 INFO L225 Difference]: With dead ends: 108 [2018-12-09 01:42:50,431 INFO L226 Difference]: Without dead ends: 62 [2018-12-09 01:42:50,432 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-09 01:42:50,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-09 01:42:50,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-09 01:42:50,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-09 01:42:50,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-12-09 01:42:50,437 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 69 [2018-12-09 01:42:50,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:42:50,437 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-12-09 01:42:50,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:42:50,438 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-12-09 01:42:50,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 01:42:50,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:42:50,438 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-09 01:42:50,438 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:42:50,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:42:50,438 INFO L82 PathProgramCache]: Analyzing trace with hash 141305186, now seen corresponding path program 1 times [2018-12-09 01:42:50,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:42:50,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:50,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:42:50,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:50,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:42:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:42:51,189 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-09 01:42:51,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:42:51,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:42:51,189 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-12-09 01:42:51,189 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-09 01:42:51,190 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:42:51,191 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:42:51,282 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:42:51,282 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-09 01:42:51,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:42:51,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:42:51,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:42:51,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:42:51,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:42:51,292 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:42:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:42:51,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:42:51,350 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-09 01:42:51,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:51,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:51,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:42:51,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:42:51,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:42:51,499 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-09 01:42:51,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:51,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:51,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 01:42:51,526 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-09 01:42:51,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 01:42:51,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:51,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:51,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:51,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-09 01:42:51,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-09 01:42:51,564 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-09 01:42:51,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:51,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:51,570 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-09 01:42:51,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 01:42:51,644 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-09 01:42:51,647 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-09 01:42:51,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:51,656 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-09 01:42:51,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:42:51,658 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-09 01:42:51,658 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:51,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:51,668 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-09 01:42:51,673 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-09 01:42:51,673 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:71, output treesize:46 [2018-12-09 01:42:51,987 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-09 01:42:51,990 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-09 01:42:51,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:51,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:51,998 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-09 01:42:51,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2018-12-09 01:42:52,447 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-09 01:42:52,455 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-09 01:42:52,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:42:52,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:42:52,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:42:52,464 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-09 01:42:52,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:52,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:52,480 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-09 01:42:52,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:43 [2018-12-09 01:42:52,736 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-09 01:42:52,737 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-09 01:42:52,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:52,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:52,751 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-09 01:42:52,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:113 [2018-12-09 01:42:52,826 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-09 01:42:52,828 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-09 01:42:52,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:52,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:52,849 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-09 01:42:52,857 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-09 01:42:52,858 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 01:42:52,868 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:42:52,886 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-09 01:42:52,886 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:154, output treesize:142 [2018-12-09 01:42:53,791 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-09 01:42:53,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:42:53,794 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-09 01:42:53,794 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-09 01:42:53,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:42:53,819 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-09 01:42:53,820 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-09 01:42:53,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:42:53,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:42:53,863 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-09 01:42:53,867 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-09 01:42:54,036 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-09 01:42:54,169 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-09 01:42:54,172 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-09 01:42:54,173 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-09 01:42:54,196 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-09 01:42:54,197 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-09 01:42:54,224 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-09 01:42:54,224 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-09 01:42:54,249 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-09 01:42:54,255 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-09 01:42:54,257 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-09 01:42:54,258 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-09 01:42:54,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 78 treesize of output 72 [2018-12-09 01:42:54,288 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-09 01:42:54,316 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-09 01:42:54,316 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-09 01:42:54,341 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-09 01:42:54,348 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-09 01:42:54,350 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-09 01:42:54,351 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-09 01:42:54,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, 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-09 01:42:54,387 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-09 01:42:54,418 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-09 01:42:54,419 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-09 01:42:54,475 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-09 01:42:54,477 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-09 01:42:54,478 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-09 01:42:54,479 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-09 01:42:54,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 01:42:54,502 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-09 01:42:54,510 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-09 01:42:54,516 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-09 01:42:54,517 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-09 01:42:54,518 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-09 01:42:54,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, 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-09 01:42:54,541 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-09 01:42:54,566 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-09 01:42:54,567 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-09 01:42:54,596 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-09 01:42:54,602 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-09 01:42:54,604 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-09 01:42:54,605 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-09 01:42:54,629 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-09 01:42:54,630 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-09 01:42:54,655 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-09 01:42:54,656 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-09 01:42:54,679 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-09 01:42:54,684 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-09 01:42:54,686 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-09 01:42:54,686 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-09 01:42:54,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-12-09 01:42:54,727 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-09 01:42:54,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, 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-09 01:42:54,753 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-09 01:42:54,778 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-09 01:42:54,784 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-09 01:42:54,785 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-09 01:42:54,786 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-09 01:42:54,811 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-09 01:42:54,812 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-09 01:42:54,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-09 01:42:54,842 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-09 01:42:54,877 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-09 01:42:54,883 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-09 01:42:54,886 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-09 01:42:54,886 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-09 01:42:54,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 01:42:54,916 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-09 01:42:54,946 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-09 01:42:54,946 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-09 01:42:54,976 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-09 01:42:55,413 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-09 01:42:55,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 01:42:55,415 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,420 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,422 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-09 01:42:55,424 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:55,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, 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-09 01:42:55,424 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,429 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,430 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-09 01:42:55,432 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:55,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, 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-09 01:42:55,433 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,439 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,440 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-09 01:42:55,442 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:55,442 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-09 01:42:55,442 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,447 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,448 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-09 01:42:55,450 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:55,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-09 01:42:55,451 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,456 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,457 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-09 01:42:55,459 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42: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, 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-09 01:42:55,459 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,464 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,465 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-09 01:42:55,468 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:55,468 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-09 01:42:55,468 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,475 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,476 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-09 01:42:55,481 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:55,481 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-09 01:42:55,481 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,487 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,488 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-09 01:42:55,490 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:55,490 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-09 01:42:55,491 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,495 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,496 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-09 01:42:55,497 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-09 01:42:55,497 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,503 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,504 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-09 01:42:55,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-12-09 01:42:55,505 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,510 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,511 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-09 01:42:55,514 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:55,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-09 01:42:55,514 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,525 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,527 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-09 01:42:55,529 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:55,529 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-09 01:42:55,529 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,534 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,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, 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-09 01:42:55,538 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:55,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, 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-09 01:42:55,539 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,545 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,546 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-09 01:42:55,547 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-09 01:42:55,548 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,551 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,556 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-09 01:42:55,557 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-09 01:42:55,558 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,575 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-09 01:42:55,575 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,592 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:55,593 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-09 01:42:55,593 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,601 INFO L267 ElimStorePlain]: Start of recursive call 71: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,603 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-09 01:42:55,605 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:55,605 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-09 01:42:55,605 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,611 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,617 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-09 01:42:55,619 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:55,620 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-09 01:42:55,620 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,655 INFO L267 ElimStorePlain]: Start of recursive call 77: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,656 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-09 01:42:55,658 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:55,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 36 treesize of output 7 [2018-12-09 01:42:55,658 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,663 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,665 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-09 01:42:55,667 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:55,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, 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-09 01:42:55,667 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,673 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,678 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-09 01:42:55,680 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-09 01:42:55,680 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,708 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:55,708 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-09 01:42:55,709 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,728 INFO L267 ElimStorePlain]: Start of recursive call 83: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:55,815 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-09 01:42:55,816 INFO L202 ElimStorePlain]: Needed 85 recursive calls to eliminate 7 variables, input treesize:131, output treesize:21 [2018-12-09 01:42:55,866 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-09 01:42:55,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:42:56,766 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-12-09 01:42:56,768 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-09 01:42:56,775 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-09 01:42:56,776 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-09 01:42:56,786 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-09 01:42:56,787 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-09 01:42:56,798 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-09 01:42:56,799 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-09 01:42:56,808 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-09 01:42:56,950 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-09 01:42:56,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 01:42:56,952 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:56,955 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:56,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 109 [2018-12-09 01:42:56,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 5 [2018-12-09 01:42:56,958 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:56,962 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:56,964 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-09 01:42:56,965 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-09 01:42:56,965 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:56,969 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,035 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-09 01:42:57,041 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-09 01:42:57,042 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-09 01:42:57,049 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-09 01:42:57,050 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-09 01:42:57,056 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-09 01:42:57,104 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-09 01:42:57,106 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-09 01:42:57,106 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,110 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,111 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-09 01:42:57,113 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-09 01:42:57,113 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,116 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,151 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,152 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,152 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,153 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,154 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-09 01:42:57,155 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-09 01:42:57,176 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,177 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,178 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,181 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,182 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-09 01:42:57,183 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-09 01:42:57,195 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-09 01:42:57,195 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 6 variables, input treesize:245, output treesize:178 [2018-12-09 01:42:57,476 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 101 treesize of output 95 [2018-12-09 01:42:57,478 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 13 treesize of output 5 [2018-12-09 01:42:57,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,488 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 101 treesize of output 95 [2018-12-09 01:42:57,490 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 13 treesize of output 5 [2018-12-09 01:42:57,491 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,501 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 99 treesize of output 93 [2018-12-09 01:42:57,503 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 13 treesize of output 5 [2018-12-09 01:42:57,504 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,514 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,631 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,637 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,637 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,644 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,645 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-09 01:42:57,652 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-09 01:42:57,734 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,737 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,738 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-09 01:42:57,742 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-09 01:42:57,742 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,747 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,811 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-09 01:42:57,819 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-09 01:42:57,820 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-09 01:42:57,828 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-09 01:42:57,829 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-09 01:42:57,839 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-09 01:42:57,897 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-09 01:42:57,903 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:42:57,904 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:42:57,912 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:42:57,913 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-09 01:42:57,919 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-09 01:42:57,999 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 91 treesize of output 75 [2018-12-09 01:42:58,002 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 5 [2018-12-09 01:42:58,002 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:58,006 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:58,008 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 91 treesize of output 75 [2018-12-09 01:42:58,010 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 5 [2018-12-09 01:42:58,011 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:58,015 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:58,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-12-09 01:42:58,056 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 6 variables, input treesize:209, output treesize:325 [2018-12-09 01:42:58,057 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-09 01:42:58,826 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2018-12-09 01:42:58,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:58,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:58,879 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 69 treesize of output 66 [2018-12-09 01:42:58,880 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 17 treesize of output 1 [2018-12-09 01:42:58,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:58,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:58,921 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-09 01:42:58,925 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-09 01:42:58,952 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 27 treesize of output 24 [2018-12-09 01:42:58,953 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 17 treesize of output 1 [2018-12-09 01:42:58,953 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:58,955 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:58,972 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 34 treesize of output 30 [2018-12-09 01:42:58,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-12-09 01:42:58,974 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:58,978 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:59,011 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:59,015 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:59,039 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:59,041 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:59,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 9 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 01:42:59,050 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 13 variables, input treesize:172, output treesize:24 [2018-12-09 01:42:59,271 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-09 01:42:59,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:42:59,286 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-09 01:42:59,289 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-09 01:42:59,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 65 [2018-12-09 01:42:59,321 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-09 01:42:59,321 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:59,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 48 [2018-12-09 01:42:59,340 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 43 treesize of output 35 [2018-12-09 01:42:59,340 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:59,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-12-09 01:42:59,365 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:59,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2018-12-09 01:42:59,393 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-09 01:42:59,418 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:42:59,442 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:42:59,676 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:42:59,677 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.doElimAllRec(ElimStorePlain.java:264) 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-09 01:42:59,682 INFO L168 Benchmark]: Toolchain (without parser) took 75966.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -128.2 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. [2018-12-09 01:42:59,683 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:42:59,683 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-12-09 01:42:59,683 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.06 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-09 01:42:59,684 INFO L168 Benchmark]: Boogie Preprocessor took 19.61 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-09 01:42:59,684 INFO L168 Benchmark]: RCFGBuilder took 210.99 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: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:42:59,685 INFO L168 Benchmark]: TraceAbstraction took 75443.32 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 27.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.2 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:42:59,687 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.06 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.61 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. * RCFGBuilder took 210.99 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: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 75443.32 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 27.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.2 MB). Peak memory consumption was 10.6 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-09 01:43:00,925 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:43:00,926 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:43:00,932 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:43:00,933 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:43:00,933 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:43:00,934 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:43:00,935 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:43:00,937 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:43:00,937 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:43:00,938 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:43:00,938 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:43:00,938 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:43:00,939 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:43:00,939 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:43:00,939 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:43:00,940 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:43:00,941 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:43:00,942 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:43:00,943 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:43:00,943 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:43:00,944 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:43:00,945 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:43:00,945 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:43:00,945 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:43:00,945 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:43:00,946 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:43:00,946 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:43:00,947 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:43:00,947 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:43:00,948 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:43:00,948 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:43:00,948 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:43:00,948 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:43:00,949 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:43:00,949 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:43:00,949 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 01:43:00,960 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:43:00,960 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:43:00,960 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:43:00,961 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:43:00,961 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 01:43:00,961 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 01:43:00,961 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 01:43:00,961 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 01:43:00,961 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 01:43:00,961 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 01:43:00,962 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:43:00,962 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:43:00,962 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:43:00,962 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:43:00,962 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 01:43:00,962 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:43:00,963 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 01:43:00,963 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 01:43:00,963 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 01:43:00,963 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:43:00,963 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 01:43:00,963 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:43:00,963 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 01:43:00,964 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:43:00,964 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:43:00,964 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:43:00,964 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:43:00,964 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:43:00,964 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:43:00,964 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:43:00,964 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 01:43:00,965 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 01:43:00,965 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:43:00,965 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 01:43:00,965 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 01:43:00,965 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_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:43:00,989 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:43:00,996 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:43:00,998 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:43:00,999 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:43:00,999 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:43:01,000 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:43:01,036 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/bin-2019/utaipan/data/e5a15beb6/d8f54243ed5045a6a77c5852e32af8aa/FLAGbeb9f198b [2018-12-09 01:43:01,419 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:43:01,419 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:43:01,427 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/bin-2019/utaipan/data/e5a15beb6/d8f54243ed5045a6a77c5852e32af8aa/FLAGbeb9f198b [2018-12-09 01:43:01,778 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/bin-2019/utaipan/data/e5a15beb6/d8f54243ed5045a6a77c5852e32af8aa [2018-12-09 01:43:01,780 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:43:01,781 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:43:01,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:43:01,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:43:01,784 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:43:01,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:43:01" (1/1) ... [2018-12-09 01:43:01,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33327ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:01, skipping insertion in model container [2018-12-09 01:43:01,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:43:01" (1/1) ... [2018-12-09 01:43:01,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:43:01,811 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:43:01,973 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:43:01,981 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:43:02,009 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:43:02,070 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:43:02,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:02 WrapperNode [2018-12-09 01:43:02,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:43:02,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:43:02,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:43:02,071 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:43:02,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:02" (1/1) ... [2018-12-09 01:43:02,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:02" (1/1) ... [2018-12-09 01:43:02,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:43:02,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:43:02,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:43:02,094 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:43:02,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:02" (1/1) ... [2018-12-09 01:43:02,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:02" (1/1) ... [2018-12-09 01:43:02,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:02" (1/1) ... [2018-12-09 01:43:02,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:02" (1/1) ... [2018-12-09 01:43:02,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:02" (1/1) ... [2018-12-09 01:43:02,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:02" (1/1) ... [2018-12-09 01:43:02,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:02" (1/1) ... [2018-12-09 01:43:02,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:43:02,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:43:02,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:43:02,124 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:43:02,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:43:02,156 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2018-12-09 01:43:02,157 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2018-12-09 01:43:02,157 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-12-09 01:43:02,157 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-12-09 01:43:02,157 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 01:43:02,157 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 01:43:02,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:43:02,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-09 01:43:02,157 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2018-12-09 01:43:02,157 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2018-12-09 01:43:02,157 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-09 01:43:02,158 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-09 01:43:02,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:43:02,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:43:02,158 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:43:02,158 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:43:02,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 01:43:02,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 01:43:02,158 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-12-09 01:43:02,158 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-12-09 01:43:02,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:43:02,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-09 01:43:02,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:43:02,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:43:02,421 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:43:02,422 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 01:43:02,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:43:02 BoogieIcfgContainer [2018-12-09 01:43:02,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:43:02,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:43:02,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:43:02,424 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:43:02,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:43:01" (1/3) ... [2018-12-09 01:43:02,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca5bc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:43:02, skipping insertion in model container [2018-12-09 01:43:02,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:02" (2/3) ... [2018-12-09 01:43:02,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca5bc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:43:02, skipping insertion in model container [2018-12-09 01:43:02,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:43:02" (3/3) ... [2018-12-09 01:43:02,426 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:43:02,431 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:43:02,435 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 01:43:02,444 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 01:43:02,460 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:43:02,460 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:43:02,461 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 01:43:02,461 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:43:02,461 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:43:02,461 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:43:02,461 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:43:02,461 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:43:02,461 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:43:02,470 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-12-09 01:43:02,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 01:43:02,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:02,474 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-09 01:43:02,476 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:02,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash -429725179, now seen corresponding path program 1 times [2018-12-09 01:43:02,481 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:43:02,481 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:43:02,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:02,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:02,611 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-09 01:43:02,612 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:43:02,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:43:02,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:43:02,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:43:02,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:43:02,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:43:02,631 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 5 states. [2018-12-09 01:43:02,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:02,700 INFO L93 Difference]: Finished difference Result 103 states and 137 transitions. [2018-12-09 01:43:02,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:43:02,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-09 01:43:02,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:02,709 INFO L225 Difference]: With dead ends: 103 [2018-12-09 01:43:02,709 INFO L226 Difference]: Without dead ends: 49 [2018-12-09 01:43:02,712 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-09 01:43:02,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-09 01:43:02,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-12-09 01:43:02,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 01:43:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-12-09 01:43:02,742 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 31 [2018-12-09 01:43:02,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:02,742 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-12-09 01:43:02,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:43:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-12-09 01:43:02,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 01:43:02,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:02,744 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-09 01:43:02,744 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:02,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:02,744 INFO L82 PathProgramCache]: Analyzing trace with hash 855090161, now seen corresponding path program 1 times [2018-12-09 01:43:02,745 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:43:02,745 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:43:02,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:02,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:02,862 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-09 01:43:02,862 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:43:02,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:43:02,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:43:02,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:43:02,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:43:02,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:43:02,865 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 4 states. [2018-12-09 01:43:02,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:02,906 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2018-12-09 01:43:02,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:43:02,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-12-09 01:43:02,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:02,908 INFO L225 Difference]: With dead ends: 66 [2018-12-09 01:43:02,908 INFO L226 Difference]: Without dead ends: 54 [2018-12-09 01:43:02,909 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-09 01:43:02,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-09 01:43:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-12-09 01:43:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 01:43:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-12-09 01:43:02,916 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 41 [2018-12-09 01:43:02,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:02,916 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-12-09 01:43:02,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:43:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-12-09 01:43:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 01:43:02,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:02,918 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-09 01:43:02,918 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:02,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:02,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1918785159, now seen corresponding path program 1 times [2018-12-09 01:43:02,919 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:43:02,919 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:43:02,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:03,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:03,075 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-09 01:43:03,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:43:03,121 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-09 01:43:03,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:03,123 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:43:03,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:03,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:03,329 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-09 01:43:03,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 01:43:03,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:03,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:03,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:03,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 01:43:03,635 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-09 01:43:03,639 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-09 01:43:03,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:03,656 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-09 01:43:03,656 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:03,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:03,667 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-09 01:43:03,667 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-12-09 01:43:03,704 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-09 01:43:03,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:43:04,653 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-09 01:43:04,659 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-09 01:43:04,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:04,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:04,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:43:04,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:10 [2018-12-09 01:43:04,997 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-09 01:43:05,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:43:05,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 21, 12] total 34 [2018-12-09 01:43:05,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-09 01:43:05,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-09 01:43:05,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1015, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 01:43:05,027 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 34 states. [2018-12-09 01:43:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:08,314 INFO L93 Difference]: Finished difference Result 95 states and 120 transitions. [2018-12-09 01:43:08,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 01:43:08,315 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 49 [2018-12-09 01:43:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:08,317 INFO L225 Difference]: With dead ends: 95 [2018-12-09 01:43:08,317 INFO L226 Difference]: Without dead ends: 83 [2018-12-09 01:43:08,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=211, Invalid=1951, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 01:43:08,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-09 01:43:08,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 49. [2018-12-09 01:43:08,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 01:43:08,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-12-09 01:43:08,324 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 49 [2018-12-09 01:43:08,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:08,324 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-12-09 01:43:08,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-09 01:43:08,324 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-12-09 01:43:08,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 01:43:08,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:08,325 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-09 01:43:08,325 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:08,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:08,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1628181277, now seen corresponding path program 2 times [2018-12-09 01:43:08,326 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:43:08,326 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:43:08,339 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 01:43:08,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:43:08,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:43:08,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:08,505 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-09 01:43:08,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:43:08,565 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-09 01:43:08,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:08,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:43:08,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:43:08,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:43:08,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:43:08,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:08,830 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-09 01:43:08,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:43:08,865 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-09 01:43:08,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:43:08,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-09 01:43:08,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:43:08,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:43:08,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:43:08,882 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 9 states. [2018-12-09 01:43:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:08,993 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2018-12-09 01:43:08,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:43:08,993 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-12-09 01:43:08,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:08,994 INFO L225 Difference]: With dead ends: 94 [2018-12-09 01:43:08,994 INFO L226 Difference]: Without dead ends: 72 [2018-12-09 01:43:08,995 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-09 01:43:08,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-09 01:43:09,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2018-12-09 01:43:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-09 01:43:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-12-09 01:43:09,003 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 57 [2018-12-09 01:43:09,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:09,003 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-12-09 01:43:09,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:43:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-12-09 01:43:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 01:43:09,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:09,004 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-09 01:43:09,004 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:09,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:09,005 INFO L82 PathProgramCache]: Analyzing trace with hash -625261382, now seen corresponding path program 1 times [2018-12-09 01:43:09,005 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:43:09,005 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:43:09,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:43:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:09,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:09,193 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-09 01:43:09,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:09,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:09,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:43:09,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:09,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:09,272 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-09 01:43:09,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:09,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:09,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2018-12-09 01:43:09,314 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-09 01:43:09,316 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-09 01:43:09,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:09,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:09,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:09,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-12-09 01:43:09,368 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-09 01:43:09,371 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-09 01:43:09,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:09,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:09,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:09,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-09 01:43:09,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:09,466 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-09 01:43:09,471 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-09 01:43:09,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:09,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:09,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:09,499 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-09 01:43:09,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:09,535 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-09 01:43:09,536 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-09 01:43:09,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:09,573 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-09 01:43:09,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:09,587 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:72, output treesize:51 [2018-12-09 01:43:09,904 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-09 01:43:09,907 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-09 01:43:09,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:09,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:09,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:09,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-09 01:43:10,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:10,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:10,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:10,012 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-09 01:43:10,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:10,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:10,092 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-09 01:43:10,093 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-09 01:43:10,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:10,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:10,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:82, output treesize:63 [2018-12-09 01:43:11,950 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-09 01:43:11,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:11,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:11,963 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-09 01:43:11,993 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-09 01:43:11,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:12,010 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-09 01:43:12,011 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-09 01:43:12,029 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-09 01:43:12,066 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-09 01:43:12,069 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-09 01:43:12,069 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:12,078 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:12,094 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-09 01:43:12,094 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:84, output treesize:18 [2018-12-09 01:43:14,536 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-09 01:43:14,539 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-09 01:43:14,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:14,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:14,551 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-09 01:43:14,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-09 01:43:14,601 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-09 01:43:14,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:43:17,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:17,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:43:17,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:17,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:17,495 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-09 01:43:17,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:17,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:17,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:43:17,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:17,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:17,717 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-09 01:43:17,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:17,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:17,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-12-09 01:43:17,804 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-09 01:43:17,805 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-09 01:43:17,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:17,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:17,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:17,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-09 01:43:17,945 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-09 01:43:17,948 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-09 01:43:17,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:17,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:17,977 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-09 01:43:17,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-12-09 01:43:18,245 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-09 01:43:18,253 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-09 01:43:18,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:18,282 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-09 01:43:18,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:18,288 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-09 01:43:18,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:18,303 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:18,315 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-09 01:43:18,331 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-09 01:43:18,331 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:49 [2018-12-09 01:43:18,878 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-09 01:43:18,881 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-09 01:43:18,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:18,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:18,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:18,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-09 01:43:18,915 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-09 01:43:18,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:18,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:18,926 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-09 01:43:18,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:18,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:18,957 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-09 01:43:18,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:50 [2018-12-09 01:43:19,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:19,155 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-09 01:43:19,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 01:43:19,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:19,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:19,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:19,206 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-09 01:43:19,210 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-09 01:43:19,211 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:43:19,229 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-09 01:43:19,229 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:19,236 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-09 01:43:19,250 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-09 01:43:19,250 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:71, output treesize:18 [2018-12-09 01:43:21,315 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-09 01:43:21,317 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-09 01:43:21,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:21,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:21,330 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-09 01:43:21,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-09 01:43:21,337 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-09 01:43:21,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:43:23,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:43:23,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 46 [2018-12-09 01:43:23,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-09 01:43:23,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-09 01:43:23,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2501, Unknown=3, NotChecked=100, Total=2756 [2018-12-09 01:43:23,764 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 46 states. [2018-12-09 01:43:54,512 WARN L180 SmtUtils]: Spent 1.73 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 01:43:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:59,692 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2018-12-09 01:43:59,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-09 01:43:59,693 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 58 [2018-12-09 01:43:59,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:59,694 INFO L225 Difference]: With dead ends: 111 [2018-12-09 01:43:59,694 INFO L226 Difference]: Without dead ends: 108 [2018-12-09 01:43:59,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 36.9s TimeCoverageRelationStatistics Valid=338, Invalid=5053, Unknown=15, NotChecked=144, Total=5550 [2018-12-09 01:43:59,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-09 01:43:59,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2018-12-09 01:43:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-09 01:43:59,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2018-12-09 01:43:59,706 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 58 [2018-12-09 01:43:59,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:59,706 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2018-12-09 01:43:59,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-09 01:43:59,706 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2018-12-09 01:43:59,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 01:43:59,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:59,707 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-09 01:43:59,707 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:59,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:59,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1469266884, now seen corresponding path program 1 times [2018-12-09 01:43:59,707 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:43:59,707 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:43:59,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:59,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:59,771 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-09 01:43:59,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:43:59,832 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-09 01:43:59,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:59,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:43:59,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:59,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:59,865 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-09 01:43:59,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:43:59,933 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-09 01:43:59,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:43:59,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 6 [2018-12-09 01:43:59,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:43:59,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:43:59,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:43:59,949 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand 6 states. [2018-12-09 01:44:00,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:00,069 INFO L93 Difference]: Finished difference Result 143 states and 172 transitions. [2018-12-09 01:44:00,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:44:00,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-09 01:44:00,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:00,071 INFO L225 Difference]: With dead ends: 143 [2018-12-09 01:44:00,071 INFO L226 Difference]: Without dead ends: 95 [2018-12-09 01:44:00,071 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-09 01:44:00,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-09 01:44:00,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-09 01:44:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-09 01:44:00,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2018-12-09 01:44:00,087 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 58 [2018-12-09 01:44:00,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:00,087 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2018-12-09 01:44:00,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:44:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2018-12-09 01:44:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 01:44:00,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:00,089 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-09 01:44:00,089 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:00,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:00,089 INFO L82 PathProgramCache]: Analyzing trace with hash -602214656, now seen corresponding path program 1 times [2018-12-09 01:44:00,089 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:44:00,090 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:44:00,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:00,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:00,209 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-09 01:44:00,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:44:00,244 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-09 01:44:00,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:44:00,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-12-09 01:44:00,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:44:00,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:44:00,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:44:00,247 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 7 states. [2018-12-09 01:44:00,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:00,292 INFO L93 Difference]: Finished difference Result 130 states and 158 transitions. [2018-12-09 01:44:00,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:44:00,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-12-09 01:44:00,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:00,294 INFO L225 Difference]: With dead ends: 130 [2018-12-09 01:44:00,294 INFO L226 Difference]: Without dead ends: 106 [2018-12-09 01:44:00,294 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-09 01:44:00,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-09 01:44:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2018-12-09 01:44:00,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-09 01:44:00,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2018-12-09 01:44:00,308 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 59 [2018-12-09 01:44:00,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:00,308 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2018-12-09 01:44:00,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:44:00,308 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2018-12-09 01:44:00,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 01:44:00,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:00,309 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-09 01:44:00,310 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:00,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:00,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1762507075, now seen corresponding path program 2 times [2018-12-09 01:44:00,310 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:44:00,310 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:44:00,323 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 01:44:00,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:44:00,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:44:00,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:00,511 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-09 01:44:00,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:44:00,617 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-09 01:44:00,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:44:00,620 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:44:00,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:44:00,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:44:00,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:44:00,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:00,950 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-09 01:44:00,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:44:01,280 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-09 01:44:01,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:44:01,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-09 01:44:01,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 01:44:01,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 01:44:01,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-09 01:44:01,297 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 18 states. [2018-12-09 01:44:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:02,201 INFO L93 Difference]: Finished difference Result 185 states and 242 transitions. [2018-12-09 01:44:02,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 01:44:02,202 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2018-12-09 01:44:02,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:02,203 INFO L225 Difference]: With dead ends: 185 [2018-12-09 01:44:02,203 INFO L226 Difference]: Without dead ends: 151 [2018-12-09 01:44:02,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-12-09 01:44:02,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-09 01:44:02,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 112. [2018-12-09 01:44:02,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-09 01:44:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 143 transitions. [2018-12-09 01:44:02,219 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 143 transitions. Word has length 59 [2018-12-09 01:44:02,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:02,219 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 143 transitions. [2018-12-09 01:44:02,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 01:44:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2018-12-09 01:44:02,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 01:44:02,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:02,220 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-09 01:44:02,220 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:02,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:02,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1102743158, now seen corresponding path program 1 times [2018-12-09 01:44:02,220 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:44:02,221 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:44:02,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:44:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:02,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:02,349 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-09 01:44:02,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:44:02,409 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-09 01:44:02,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:44:02,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:44:02,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:02,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:02,448 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-09 01:44:02,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:44:02,473 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-09 01:44:02,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:44:02,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-09 01:44:02,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:44:02,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:44:02,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:44:02,489 INFO L87 Difference]: Start difference. First operand 112 states and 143 transitions. Second operand 9 states. [2018-12-09 01:44:02,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:02,619 INFO L93 Difference]: Finished difference Result 162 states and 205 transitions. [2018-12-09 01:44:02,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:44:02,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-12-09 01:44:02,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:02,621 INFO L225 Difference]: With dead ends: 162 [2018-12-09 01:44:02,621 INFO L226 Difference]: Without dead ends: 134 [2018-12-09 01:44:02,621 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-09 01:44:02,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-09 01:44:02,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2018-12-09 01:44:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-09 01:44:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2018-12-09 01:44:02,634 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 67 [2018-12-09 01:44:02,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:02,634 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2018-12-09 01:44:02,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:44:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2018-12-09 01:44:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 01:44:02,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:02,635 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-09 01:44:02,635 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:02,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:02,635 INFO L82 PathProgramCache]: Analyzing trace with hash 195796967, now seen corresponding path program 3 times [2018-12-09 01:44:02,636 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:44:02,636 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:44:02,653 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-09 01:44:02,913 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 01:44:02,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:44:02,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:02,950 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-09 01:44:02,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:44:03,059 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-09 01:44:03,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:44:03,062 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:44:03,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 01:44:18,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 01:44:18,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:44:18,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:18,877 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-09 01:44:18,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:44:19,101 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-09 01:44:19,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:44:19,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8, 12] total 18 [2018-12-09 01:44:19,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 01:44:19,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 01:44:19,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-12-09 01:44:19,124 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand 18 states. [2018-12-09 01:44:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:19,251 INFO L93 Difference]: Finished difference Result 175 states and 208 transitions. [2018-12-09 01:44:19,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:44:19,252 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-12-09 01:44:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:19,252 INFO L225 Difference]: With dead ends: 175 [2018-12-09 01:44:19,252 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 01:44:19,253 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-09 01:44:19,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 01:44:19,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-12-09 01:44:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-09 01:44:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2018-12-09 01:44:19,263 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 67 [2018-12-09 01:44:19,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:19,263 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2018-12-09 01:44:19,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 01:44:19,263 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2018-12-09 01:44:19,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 01:44:19,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:19,264 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-09 01:44:19,264 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:19,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:19,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1775719472, now seen corresponding path program 1 times [2018-12-09 01:44:19,265 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:44:19,265 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:44:19,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:44:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:19,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:19,542 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-09 01:44:19,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:19,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:19,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:44:19,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:19,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:19,619 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-09 01:44:19,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:19,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:19,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2018-12-09 01:44:19,657 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-09 01:44:19,660 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-09 01:44:19,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:19,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:19,684 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-09 01:44:19,686 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-09 01:44:19,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:19,688 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:19,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:19,702 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-12-09 01:44:19,757 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-09 01:44:19,759 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-09 01:44:19,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:19,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:19,796 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-09 01:44:19,799 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-09 01:44:19,799 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:19,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:19,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:19,821 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:47 [2018-12-09 01:44:19,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:19,939 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-09 01:44:19,945 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-09 01:44:19,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:20,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:20,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:20,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:20,072 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-09 01:44:20,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:20,148 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-09 01:44:20,149 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-09 01:44:20,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:20,307 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-09 01:44:20,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:20,401 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-09 01:44:20,404 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-09 01:44:20,405 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:20,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:20,442 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-09 01:44:20,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:20,446 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-09 01:44:20,447 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:20,464 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:20,475 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-09 01:44:20,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:20,509 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:143, output treesize:109 [2018-12-09 01:44:20,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:20,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:20,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:20,968 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-09 01:44:20,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:20,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:21,083 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-09 01:44:21,084 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-09 01:44:21,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:21,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:21,279 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-09 01:44:21,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:21,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:21,288 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-09 01:44:21,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:21,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:21,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:21,339 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:147, output treesize:109 [2018-12-09 01:44:21,759 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-09 01:44:21,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 18 treesize of output 17 [2018-12-09 01:44:21,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:21,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:21,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:21,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:104, output treesize:96 [2018-12-09 01:44:21,976 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:44:21,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:21,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:22,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:22,027 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-09 01:44:22,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:22,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:22,112 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-09 01:44:22,113 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-09 01:44:22,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:22,274 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:44:22,304 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-09 01:44:22,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:22,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:22,318 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-09 01:44:22,318 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:22,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:22,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:22,364 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:205, output treesize:131 [2018-12-09 01:44:23,815 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-09 01:44:23,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 01:44:23,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:23,851 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:44:23,851 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-09 01:44:23,851 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:23,875 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:44:23,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-09 01:44:23,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:23,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:24,002 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-09 01:44:24,015 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 16 xjuncts. [2018-12-09 01:44:24,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:24,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:24,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:24,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:24,119 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-09 01:44:24,157 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-09 01:44:24,158 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-09 01:44:24,313 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-09 01:44:24,314 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:24,386 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-09 01:44:24,387 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:24,535 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-09 01:44:24,535 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:24,581 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-09 01:44:24,581 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:24,597 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-09 01:44:24,597 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:24,601 INFO L267 ElimStorePlain]: Start of recursive call 7: 11 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:24,605 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-09 01:44:24,605 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:263, output treesize:11 [2018-12-09 01:44:24,731 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-09 01:44:24,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:44:26,163 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-09 01:44:26,273 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-09 01:44:26,361 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-09 01:44:26,387 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-09 01:44:26,388 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-09 01:44:26,410 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-09 01:44:26,411 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-09 01:44:26,431 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-09 01:44:26,431 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-09 01:44:26,452 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-09 01:44:26,647 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-09 01:44:26,669 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-09 01:44:26,670 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-09 01:44:26,691 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-09 01:44:26,692 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-09 01:44:26,713 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-09 01:44:26,714 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-09 01:44:26,737 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-09 01:44:26,934 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-09 01:44:26,939 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-09 01:44:26,939 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:26,943 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:26,947 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-09 01:44:26,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 5 [2018-12-09 01:44:26,951 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:26,955 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:26,960 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-09 01:44:26,965 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-09 01:44:26,965 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:26,968 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:26,996 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-09 01:44:26,997 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 3 variables, input treesize:122, output treesize:72 [2018-12-09 01:44:27,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:44:27,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:44:27,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:27,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:27,253 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-09 01:44:27,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:27,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:27,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:44:27,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:27,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:27,358 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-09 01:44:27,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:27,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:27,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:14 [2018-12-09 01:44:27,473 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-09 01:44:27,476 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-09 01:44:27,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:27,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:27,496 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-09 01:44:27,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 8 treesize of output 7 [2018-12-09 01:44:27,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:27,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:27,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:27,510 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-12-09 01:44:27,654 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-09 01:44:27,656 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-09 01:44:27,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:27,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:27,690 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-09 01:44:27,692 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-09 01:44:27,692 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:27,699 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:27,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:27,712 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-09 01:44:28,017 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-09 01:44:28,027 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-09 01:44:28,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:28,097 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-09 01:44:28,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:28,109 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-09 01:44:28,109 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:28,144 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:28,176 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-09 01:44:28,247 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-09 01:44:28,253 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-09 01:44:28,253 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:28,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:28,286 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-09 01:44:28,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:28,291 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-09 01:44:28,292 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:28,311 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:28,329 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-09 01:44:28,359 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-09 01:44:28,359 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:135, output treesize:92 [2018-12-09 01:44:28,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:28,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:28,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:28,972 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-09 01:44:28,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:28,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:28,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:29,123 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-09 01:44:29,124 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-09 01:44:29,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:29,293 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-09 01:44:29,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:29,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:29,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:29,317 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-09 01:44:29,317 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:29,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:29,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:29,361 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:138, output treesize:104 [2018-12-09 01:44:30,301 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-09 01:44:30,307 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-09 01:44:30,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:30,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:30,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:30,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:107, output treesize:99 [2018-12-09 01:44:30,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:30,694 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-09 01:44:30,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:30,740 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-09 01:44:30,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:44:30,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:44:30,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:30,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:31,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:31,009 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-09 01:44:31,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:32,627 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-09 01:44:32,629 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-09 01:44:32,834 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-09 01:44:32,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:32,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:32,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:32,853 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-09 01:44:32,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:32,914 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-09 01:44:32,915 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-09 01:44:33,011 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-09 01:44:33,370 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-09 01:44:33,370 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:205, output treesize:1027 [2018-12-09 01:44:34,070 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 55 [2018-12-09 01:44:34,501 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-09 01:44:35,754 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-12-09 01:44:36,417 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2018-12-09 01:44:39,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:39,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:39,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:39,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:39,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:39,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:39,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:39,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:39,325 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-09 01:44:39,388 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-09 01:44:39,391 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-09 01:44:39,787 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-09 01:44:39,787 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:40,070 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-09 01:44:40,071 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-09 01:44:40,210 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-09 01:44:40,212 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-09 01:44:41,036 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-09 01:44:41,037 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-09 01:44:42,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:42,453 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-09 01:44:42,453 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:42,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:42,460 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-09 01:44:42,460 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:42,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:42,467 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-09 01:44:42,467 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:42,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:42,476 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-09 01:44:42,476 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:43,005 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-09 01:44:44,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:44,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:44,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:44,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:44,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:44,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:44,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:44,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:44,649 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-09 01:44:44,727 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-09 01:44:44,730 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-09 01:44:45,130 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-09 01:44:45,132 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-09 01:44:45,678 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-09 01:44:45,678 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:45,690 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-09 01:44:45,690 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:45,703 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-09 01:44:45,703 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:45,714 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-09 01:44:45,714 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:46,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-09 01:44:46,126 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-09 01:44:46,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, 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-09 01:44:46,131 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-09 01:44:46,140 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-09 01:44:46,140 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-09 01:44:46,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-09 01:44:46,147 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-09 01:44:46,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:46,587 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-09 01:44:46,588 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:46,996 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-09 01:44:46,997 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-09 01:44:49,364 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-09 01:44:52,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:52,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:52,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:52,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:52,849 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-09 01:44:52,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:52,919 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-09 01:44:52,926 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-09 01:44:53,062 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-09 01:44:53,062 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-09 01:44:53,105 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-09 01:44:53,105 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:53,138 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-09 01:44:53,138 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:53,163 INFO L267 ElimStorePlain]: Start of recursive call 25: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:53,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:53,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:53,168 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-09 01:44:53,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:53,187 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-09 01:44:53,188 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-09 01:44:53,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:53,217 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-09 01:44:53,217 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:53,232 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:53,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:53,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:53,236 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-09 01:44:53,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:53,256 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-09 01:44:53,257 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-09 01:44:53,286 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-09 01:44:53,286 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:53,298 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:53,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:53,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:53,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:53,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:53,320 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-09 01:44:53,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:53,398 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-09 01:44:53,407 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-09 01:44:53,565 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-09 01:44:53,566 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-09 01:44:53,612 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-09 01:44:53,612 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:53,646 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-09 01:44:53,646 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:53,683 INFO L267 ElimStorePlain]: Start of recursive call 36: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:53,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:53,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:53,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:53,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:53,701 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-09 01:44:53,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:53,765 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-09 01:44:53,775 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-09 01:44:53,928 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-09 01:44:53,929 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-09 01:44:53,980 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-09 01:44:53,980 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:54,012 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-09 01:44:54,012 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:54,038 INFO L267 ElimStorePlain]: Start of recursive call 41: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:54,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:54,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:54,044 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-09 01:44:54,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:54,069 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-09 01:44:54,070 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-09 01:44:54,103 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-09 01:44:54,103 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:54,117 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:54,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:54,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:54,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:54,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:54,131 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-09 01:44:54,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:54,194 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-09 01:44:54,200 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-09 01:44:54,351 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-09 01:44:54,351 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:54,397 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-09 01:44:54,398 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-09 01:44:54,441 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-09 01:44:54,441 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:54,466 INFO L267 ElimStorePlain]: Start of recursive call 49: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:54,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:54,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:54,470 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-09 01:44:54,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:54,495 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-09 01:44:54,496 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-09 01:44:54,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:54,525 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-09 01:44:54,525 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:54,538 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:57,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,220 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-09 01:44:57,229 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-09 01:44:57,229 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-09 01:44:57,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 01:44:57,286 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:57,340 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-09 01:44:57,341 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:57,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-12-09 01:44:57,379 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:57,403 INFO L267 ElimStorePlain]: Start of recursive call 57: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:57,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,409 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-09 01:44:57,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,432 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-09 01:44:57,433 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-09 01:44:57,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,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, 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-09 01:44:57,454 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:57,466 INFO L267 ElimStorePlain]: Start of recursive call 62: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:57,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,481 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-09 01:44:57,495 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-09 01:44:57,496 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:57,559 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-09 01:44:57,560 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-09 01:44:57,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,611 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-09 01:44:57,611 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:57,648 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-09 01:44:57,649 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:57,678 INFO L267 ElimStorePlain]: Start of recursive call 65: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:57,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,683 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-09 01:44:57,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,707 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-09 01:44:57,708 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-09 01:44:57,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,737 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-09 01:44:57,737 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:57,750 INFO L267 ElimStorePlain]: Start of recursive call 70: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:57,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,756 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-09 01:44:57,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,775 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-09 01:44:57,776 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-09 01:44:57,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-09 01:44:57,804 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:57,814 INFO L267 ElimStorePlain]: Start of recursive call 73: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:57,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,832 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-09 01:44:57,842 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-09 01:44:57,842 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-09 01:44:57,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 01:44:57,911 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:57,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:57,965 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-09 01:44:57,966 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:58,009 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-09 01:44:58,009 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:58,041 INFO L267 ElimStorePlain]: Start of recursive call 76: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:58,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:58,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:58,047 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-09 01:44:58,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:58,077 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-09 01:44:58,077 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-09 01:44:58,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:58,106 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-09 01:44:58,106 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:58,121 INFO L267 ElimStorePlain]: Start of recursive call 81: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:58,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:58,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:58,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:58,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:58,143 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-09 01:44:58,156 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-09 01:44:58,156 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-09 01:44:58,227 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-09 01:44:58,227 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:58,271 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-09 01:44:58,271 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:58,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:58,309 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-09 01:44:58,309 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:58,337 INFO L267 ElimStorePlain]: Start of recursive call 84: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:00,446 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-09 01:45:00,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, 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-09 01:45:00,451 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:00,588 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-09 01:45:00,588 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:00,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 01:45:00,716 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:00,796 INFO L267 ElimStorePlain]: Start of recursive call 89: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:02,806 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-09 01:45:02,811 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-09 01:45:02,811 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:03,049 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-09 01:45:03,050 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:03,272 INFO L267 ElimStorePlain]: Start of recursive call 93: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:05,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:05,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:05,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:05,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:05,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:05,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:05,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:05,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:05,195 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-09 01:45:05,199 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-09 01:45:05,200 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:05,334 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-09 01:45:05,334 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:05,489 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-09 01:45:05,489 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:05,560 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-09 01:45:05,561 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-09 01:45:05,623 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-09 01:45:05,624 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-09 01:45:05,742 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-09 01:45:05,743 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-09 01:45:05,797 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-09 01:45:05,797 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:05,851 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-09 01:45:07,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:07,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:07,867 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-09 01:45:07,869 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:07,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:07,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:07,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:07,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:07,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:07,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:07,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:07,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:07,885 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-09 01:45:07,888 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:09,688 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-09 01:45:09,692 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-09 01:45:09,693 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:09,717 INFO L267 ElimStorePlain]: Start of recursive call 106: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:09,721 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-09 01:45:09,725 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-09 01:45:09,725 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:09,748 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:09,750 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-09 01:45:09,752 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-09 01:45:09,752 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:09,763 INFO L267 ElimStorePlain]: Start of recursive call 110: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:09,768 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-09 01:45:09,772 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-09 01:45:09,772 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:09,800 INFO L267 ElimStorePlain]: Start of recursive call 112: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:09,802 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-09 01:45:09,804 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-09 01:45:09,804 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:09,814 INFO L267 ElimStorePlain]: Start of recursive call 114: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:09,820 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-09 01:45:09,826 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-09 01:45:09,826 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:09,851 INFO L267 ElimStorePlain]: Start of recursive call 116: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:09,854 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-09 01:45:09,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 13 treesize of output 5 [2018-12-09 01:45:09,857 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:09,867 INFO L267 ElimStorePlain]: Start of recursive call 118: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:09,869 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-09 01:45:09,871 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-09 01:45:09,871 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:09,879 INFO L267 ElimStorePlain]: Start of recursive call 120: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:11,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:11,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:11,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, 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-09 01:45:11,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, 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-09 01:45:11,351 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-09 01:45:14,777 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-09 01:45:14,777 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-09 01:45:17,727 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-09 01:45:17,728 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:20,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:20,511 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-09 01:45:20,512 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:22,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 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-09 01:45:22,437 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:24,117 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-09 01:45:24,118 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-09 01:45:27,225 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-09 01:45:27,225 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:28,768 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-09 01:45:28,769 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:30,951 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-09 01:45:30,952 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:31,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:31,957 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-09 01:45:31,957 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:32,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, 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-09 01:45:32,997 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-09 01:45:34,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, 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-09 01:45:34,027 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-09 01:45:35,950 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-09 01:45:35,950 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-09 01:45:36,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:36,959 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-09 01:45:36,960 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:37,915 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-09 01:45:37,915 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:39,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-09 01:45:39,643 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-09 01:45:41,416 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-09 01:45:41,416 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:43,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-09 01:45:43,131 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:43,981 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-09 01:45:43,982 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-09 01:45:44,771 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-09 01:45:44,772 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:45,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, 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-09 01:45:45,507 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-09 01:45:47,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:47,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 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-09 01:45:47,011 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:47,711 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-09 01:45:47,712 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-09 01:45:49,172 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-09 01:45:49,172 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:50,452 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-09 01:45:53,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:53,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:53,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:53,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:53,428 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-09 01:45:53,506 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-09 01:45:53,507 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-09 01:45:54,504 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-09 01:45:54,505 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 2 xjuncts. [2018-12-09 01:45:54,704 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-09 01:45:54,705 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 2 xjuncts. [2018-12-09 01:45:54,982 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-09 01:45:54,986 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 32 xjuncts. [2018-12-09 01:45:55,148 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-09 01:45:55,149 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-09 01:45:55,149 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 2 xjuncts. [2018-12-09 01:45:55,168 INFO L267 ElimStorePlain]: Start of recursive call 147: 14 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:55,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:55,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:55,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:55,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:55,248 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-09 01:45:55,312 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-09 01:45:55,313 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-09 01:45:55,702 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-09 01:45:55,702 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 2 xjuncts. [2018-12-09 01:45:55,898 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-09 01:45:55,898 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:56,059 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-09 01:45:56,062 INFO L267 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 32 xjuncts. [2018-12-09 01:45:56,356 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-09 01:45:56,357 INFO L267 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 4 xjuncts. [2018-12-09 01:45:56,542 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-09 01:45:56,543 INFO L267 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 4 xjuncts. [2018-12-09 01:45:56,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, 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-09 01:45:56,663 INFO L267 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:56,684 INFO L267 ElimStorePlain]: Start of recursive call 153: 14 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:56,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:56,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:56,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:56,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:56,752 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-09 01:45:56,823 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-09 01:45:56,824 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-09 01:45:57,144 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-09 01:45:57,148 INFO L267 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 32 xjuncts. [2018-12-09 01:45:57,467 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-09 01:45:57,467 INFO L267 ElimStorePlain]: Start of recursive call 164: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:57,973 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-09 01:45:57,974 INFO L267 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:58,111 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-09 01:45:58,111 INFO L267 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 2 xjuncts. [2018-12-09 01:45:58,232 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-09 01:45:58,233 INFO L267 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 4 xjuncts. [2018-12-09 01:45:58,347 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-09 01:45:58,348 INFO L267 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 2 xjuncts. [2018-12-09 01:45:58,365 INFO L267 ElimStorePlain]: Start of recursive call 161: 11 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:58,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:58,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:58,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:58,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:58,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:58,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:58,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:58,427 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-09 01:45:58,595 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-09 01:45:58,595 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-12-09 01:45:58,598 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-09 01:45:59,065 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-09 01:45:59,066 INFO L267 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 4 xjuncts. [2018-12-09 01:45:59,281 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-09 01:45:59,282 INFO L267 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 2 xjuncts. [2018-12-09 01:45:59,453 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-09 01:45:59,454 INFO L267 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 2 xjuncts. [2018-12-09 01:45:59,503 INFO L267 ElimStorePlain]: Start of recursive call 169: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:59,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:59,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:59,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:59,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:59,594 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-09 01:45:59,600 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-09 01:45:59,600 INFO L267 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:59,924 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-09 01:45:59,925 INFO L267 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 4 xjuncts. [2018-12-09 01:46:00,920 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 74 treesize of output 59 [2018-12-09 01:46:00,920 INFO L267 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:01,126 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-09 01:46:01,126 INFO L267 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 4 xjuncts. [2018-12-09 01:46:01,302 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 34 treesize of output 19 [2018-12-09 01:46:01,302 INFO L267 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:01,535 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-09 01:46:01,535 INFO L267 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 2 xjuncts. [2018-12-09 01:46:01,635 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-09 01:46:01,639 INFO L267 ElimStorePlain]: Start of recursive call 181: End of recursive call: and 32 xjuncts. [2018-12-09 01:46:01,697 INFO L267 ElimStorePlain]: Start of recursive call 174: 14 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:01,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:01,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:01,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:01,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:01,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:01,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:01,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:01,752 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-09 01:46:01,756 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-09 01:46:01,756 INFO L267 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:02,000 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-09 01:46:02,000 INFO L267 ElimStorePlain]: Start of recursive call 184: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:02,293 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-09 01:46:02,294 INFO L267 ElimStorePlain]: Start of recursive call 185: End of recursive call: and 4 xjuncts. [2018-12-09 01:46:02,459 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-09 01:46:02,460 INFO L267 ElimStorePlain]: Start of recursive call 186: End of recursive call: and 4 xjuncts. [2018-12-09 01:46:02,563 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-09 01:46:02,563 INFO L267 ElimStorePlain]: Start of recursive call 187: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:02,605 INFO L267 ElimStorePlain]: Start of recursive call 182: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:02,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:02,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:02,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:02,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:02,696 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-09 01:46:02,703 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-09 01:46:02,703 INFO L267 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:03,824 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-09 01:46:03,825 INFO L267 ElimStorePlain]: Start of recursive call 190: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:04,066 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-09 01:46:04,066 INFO L267 ElimStorePlain]: Start of recursive call 191: End of recursive call: and 2 xjuncts. [2018-12-09 01:46:04,317 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-09 01:46:04,320 INFO L267 ElimStorePlain]: Start of recursive call 192: End of recursive call: and 32 xjuncts. [2018-12-09 01:46:04,586 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 43 treesize of output 51 [2018-12-09 01:46:04,587 INFO L267 ElimStorePlain]: Start of recursive call 193: End of recursive call: and 2 xjuncts. [2018-12-09 01:46:04,633 INFO L267 ElimStorePlain]: Start of recursive call 188: 17 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:04,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:04,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:04,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:04,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:04,728 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-09 01:46:04,804 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-09 01:46:04,805 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-09 01:46:05,289 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-09 01:46:05,289 INFO L267 ElimStorePlain]: Start of recursive call 196: End of recursive call: and 4 xjuncts. [2018-12-09 01:46:05,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 65 [2018-12-09 01:46:05,541 INFO L267 ElimStorePlain]: Start of recursive call 197: End of recursive call: and 4 xjuncts. [2018-12-09 01:46:05,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 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-09 01:46:05,698 INFO L267 ElimStorePlain]: Start of recursive call 198: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:05,837 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-09 01:46:05,837 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-09 01:46:05,837 INFO L267 ElimStorePlain]: Start of recursive call 199: End of recursive call: and 2 xjuncts. [2018-12-09 01:46:05,924 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-09 01:46:05,927 INFO L267 ElimStorePlain]: Start of recursive call 200: End of recursive call: and 32 xjuncts. [2018-12-09 01:46:06,000 INFO L267 ElimStorePlain]: Start of recursive call 194: 14 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:06,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:06,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:06,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:06,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:06,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:06,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:06,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:06,056 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-09 01:46:06,059 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-09 01:46:06,060 INFO L267 ElimStorePlain]: Start of recursive call 202: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:06,902 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-09 01:46:06,903 INFO L267 ElimStorePlain]: Start of recursive call 203: End of recursive call: and 4 xjuncts. [2018-12-09 01:46:07,076 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 74 treesize of output 59 [2018-12-09 01:46:07,077 INFO L267 ElimStorePlain]: Start of recursive call 204: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:07,252 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-09 01:46:07,253 INFO L267 ElimStorePlain]: Start of recursive call 205: End of recursive call: and 2 xjuncts. [2018-12-09 01:46:07,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 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-09 01:46:07,375 INFO L267 ElimStorePlain]: Start of recursive call 206: End of recursive call: and 4 xjuncts. [2018-12-09 01:46:07,497 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-09 01:46:07,498 INFO L267 ElimStorePlain]: Start of recursive call 207: End of recursive call: and 2 xjuncts. [2018-12-09 01:46:07,521 INFO L267 ElimStorePlain]: Start of recursive call 201: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:07,643 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-09 01:46:07,643 INFO L202 ElimStorePlain]: Needed 207 recursive calls to eliminate 24 variables, input treesize:821, output treesize:15 [2018-12-09 01:46:07,740 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-09 01:46:07,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:46:10,305 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-09 01:46:10,580 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-09 01:46:10,728 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-09 01:46:10,840 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-09 01:46:10,849 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-09 01:46:10,855 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-09 01:46:10,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:10,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:10,930 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-09 01:46:10,936 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-09 01:46:10,936 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:10,941 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:10,942 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:10,947 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:10,993 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:10,997 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:10,998 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:11,000 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:11,001 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-09 01:46:11,005 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-09 01:46:11,041 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-09 01:46:11,041 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:130, output treesize:99 [2018-12-09 01:46:11,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:46:11,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 55 [2018-12-09 01:46:11,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-09 01:46:11,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-09 01:46:11,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=4829, Unknown=1, NotChecked=0, Total=5112 [2018-12-09 01:46:11,387 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 55 states. [2018-12-09 01:46:14,247 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-12-09 01:46:17,068 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2018-12-09 01:46:18,292 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 54 [2018-12-09 01:46:19,070 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 65 [2018-12-09 01:46:19,539 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 56 [2018-12-09 01:46:20,188 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 62 [2018-12-09 01:46:20,692 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 68 [2018-12-09 01:46:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:46:21,284 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-12-09 01:46:21,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-09 01:46:21,284 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 68 [2018-12-09 01:46:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:46:21,285 INFO L225 Difference]: With dead ends: 109 [2018-12-09 01:46:21,285 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 01:46:21,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 104 SyntacticMatches, 7 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2329 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=537, Invalid=8018, Unknown=1, NotChecked=0, Total=8556 [2018-12-09 01:46:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 01:46:21,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-12-09 01:46:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-09 01:46:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2018-12-09 01:46:21,297 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 68 [2018-12-09 01:46:21,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:46:21,297 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2018-12-09 01:46:21,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-09 01:46:21,297 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2018-12-09 01:46:21,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 01:46:21,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:46:21,297 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-09 01:46:21,298 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:46:21,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:46:21,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1621997390, now seen corresponding path program 4 times [2018-12-09 01:46:21,298 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:46:21,298 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:46:21,312 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 01:46:21,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 01:46:21,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:46:21,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:46:21,440 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-09 01:46:21,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:46:21,547 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-09 01:46:21,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:46:21,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:46:21,557 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 01:46:21,584 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 01:46:21,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:46:21,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:46:21,592 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-09 01:46:21,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:46:21,627 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-09 01:46:21,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:46:21,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-09 01:46:21,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:46:21,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:46:21,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:46:21,643 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 9 states. [2018-12-09 01:46:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:46:21,783 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2018-12-09 01:46:21,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:46:21,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-12-09 01:46:21,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:46:21,784 INFO L225 Difference]: With dead ends: 117 [2018-12-09 01:46:21,784 INFO L226 Difference]: Without dead ends: 65 [2018-12-09 01:46:21,785 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-09 01:46:21,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-09 01:46:21,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-09 01:46:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 01:46:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-12-09 01:46:21,792 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 68 [2018-12-09 01:46:21,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:46:21,792 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-12-09 01:46:21,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:46:21,792 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-12-09 01:46:21,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 01:46:21,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:46:21,793 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-09 01:46:21,793 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:46:21,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:46:21,793 INFO L82 PathProgramCache]: Analyzing trace with hash 813747786, now seen corresponding path program 2 times [2018-12-09 01:46:21,794 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:46:21,794 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:46:21,809 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 01:46:21,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:46:21,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:46:21,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:46:22,011 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-09 01:46:22,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:46:22,125 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-09 01:46:22,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:46:22,127 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f17deab-eab5-47b8-8d1a-408a7d3f1a19/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-09 01:46:22,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:46:23,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:46:23,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:46:23,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:46:23,183 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-09 01:46:23,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:46:23,526 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-09 01:46:23,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:46:23,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-09 01:46:23,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 01:46:23,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 01:46:23,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-09 01:46:23,544 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 18 states. [2018-12-09 01:46:24,122 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2018-12-09 01:46:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:46:24,123 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-12-09 01:46:24,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 01:46:24,123 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2018-12-09 01:46:24,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:46:24,124 INFO L225 Difference]: With dead ends: 69 [2018-12-09 01:46:24,124 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 01:46:24,124 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-09 01:46:24,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 01:46:24,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 01:46:24,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 01:46:24,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 01:46:24,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2018-12-09 01:46:24,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:46:24,125 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:46:24,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 01:46:24,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 01:46:24,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 01:46:24,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 01:46:24,935 WARN L180 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2018-12-09 01:46:25,186 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-12-09 01:46:25,641 WARN L180 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2018-12-09 01:46:26,014 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2018-12-09 01:46:26,387 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2018-12-09 01:46:26,725 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2018-12-09 01:46:26,728 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 01:46:26,728 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-12-09 01:46:26,728 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 01:46:26,728 INFO L451 ceAbstractionStarter]: At program point myexitENTRY(lines 561 563) the Hoare annotation is: true [2018-12-09 01:46:26,728 INFO L448 ceAbstractionStarter]: For program point myexitFINAL(lines 561 563) no Hoare annotation was computed. [2018-12-09 01:46:26,728 INFO L448 ceAbstractionStarter]: For program point myexitEXIT(lines 561 563) no Hoare annotation was computed. [2018-12-09 01:46:26,728 INFO L451 ceAbstractionStarter]: At program point L562(line 562) the Hoare annotation is: true [2018-12-09 01:46:26,729 INFO L451 ceAbstractionStarter]: At program point dll_circular_destroyENTRY(lines 590 600) the Hoare annotation is: true [2018-12-09 01:46:26,729 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 599) no Hoare annotation was computed. [2018-12-09 01:46:26,729 INFO L451 ceAbstractionStarter]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2018-12-09 01:46:26,729 INFO L448 ceAbstractionStarter]: For program point L593-3(lines 593 597) no Hoare annotation was computed. [2018-12-09 01:46:26,729 INFO L448 ceAbstractionStarter]: For program point L591-2(lines 590 600) no Hoare annotation was computed. [2018-12-09 01:46:26,729 INFO L448 ceAbstractionStarter]: For program point dll_circular_destroyEXIT(lines 590 600) no Hoare annotation was computed. [2018-12-09 01:46:26,729 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 01:46:26,729 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 01:46:26,729 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 01:46:26,729 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 01:46:26,729 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 632) no Hoare annotation was computed. [2018-12-09 01:46:26,729 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 615 634) no Hoare annotation was computed. [2018-12-09 01:46:26,729 INFO L448 ceAbstractionStarter]: For program point L630(line 630) no Hoare annotation was computed. [2018-12-09 01:46:26,729 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-09 01:46:26,729 INFO L448 ceAbstractionStarter]: For program point L626-1(lines 626 628) no Hoare annotation was computed. [2018-12-09 01:46:26,730 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-09 01:46:26,730 INFO L448 ceAbstractionStarter]: For program point L624-2(lines 624 629) no Hoare annotation was computed. [2018-12-09 01:46:26,730 INFO L448 ceAbstractionStarter]: For program point L622-1(lines 620 623) no Hoare annotation was computed. [2018-12-09 01:46:26,730 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-09 01:46:26,730 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 615 634) no Hoare annotation was computed. [2018-12-09 01:46:26,730 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-09 01:46:26,730 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-09 01:46:26,730 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-09 01:46:26,730 INFO L448 ceAbstractionStarter]: For program point L618-1(line 618) no Hoare annotation was computed. [2018-12-09 01:46:26,730 INFO L448 ceAbstractionStarter]: For program point L620-3(lines 620 623) no Hoare annotation was computed. [2018-12-09 01:46:26,730 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-09 01:46:26,730 INFO L444 ceAbstractionStarter]: At program point L627(lines 615 634) the Hoare annotation is: false [2018-12-09 01:46:26,730 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-09 01:46:26,731 INFO L448 ceAbstractionStarter]: For program point L609-3(lines 609 612) no Hoare annotation was computed. [2018-12-09 01:46:26,731 INFO L448 ceAbstractionStarter]: For program point dll_circular_update_atFINAL(lines 608 614) no Hoare annotation was computed. [2018-12-09 01:46:26,731 INFO L448 ceAbstractionStarter]: For program point dll_circular_update_atEXIT(lines 608 614) no Hoare annotation was computed. [2018-12-09 01:46:26,731 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-09 01:46:26,731 INFO L448 ceAbstractionStarter]: For program point L578-1(line 578) no Hoare annotation was computed. [2018-12-09 01:46:26,731 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-09 01:46:26,731 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-09 01:46:26,731 INFO L448 ceAbstractionStarter]: For program point dll_circular_createEXIT(lines 574 589) no Hoare annotation was computed. [2018-12-09 01:46:26,731 INFO L448 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-12-09 01:46:26,731 INFO L448 ceAbstractionStarter]: For program point L577-3(lines 577 585) no Hoare annotation was computed. [2018-12-09 01:46:26,731 INFO L448 ceAbstractionStarter]: For program point dll_circular_createFINAL(lines 574 589) no Hoare annotation was computed. [2018-12-09 01:46:26,731 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 582) no Hoare annotation was computed. [2018-12-09 01:46:26,731 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-09 01:46:26,731 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-09 01:46:26,731 INFO L448 ceAbstractionStarter]: For program point L580-2(lines 580 582) no Hoare annotation was computed. [2018-12-09 01:46:26,731 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-09 01:46:26,731 INFO L448 ceAbstractionStarter]: For program point node_createFINAL(lines 564 573) no Hoare annotation was computed. [2018-12-09 01:46:26,731 INFO L451 ceAbstractionStarter]: At program point L567(line 567) the Hoare annotation is: true [2018-12-09 01:46:26,731 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-12-09 01:46:26,731 INFO L448 ceAbstractionStarter]: For program point node_createEXIT(lines 564 573) no Hoare annotation was computed. [2018-12-09 01:46:26,731 INFO L448 ceAbstractionStarter]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2018-12-09 01:46:26,732 INFO L448 ceAbstractionStarter]: For program point dll_circular_get_data_atFINAL(lines 601 607) no Hoare annotation was computed. [2018-12-09 01:46:26,732 INFO L448 ceAbstractionStarter]: For program point dll_circular_get_data_atEXIT(lines 601 607) no Hoare annotation was computed. [2018-12-09 01:46:26,732 INFO L451 ceAbstractionStarter]: At program point dll_circular_get_data_atENTRY(lines 601 607) the Hoare annotation is: true [2018-12-09 01:46:26,732 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-09 01:46:26,732 INFO L448 ceAbstractionStarter]: For program point L602-3(lines 602 605) no Hoare annotation was computed. [2018-12-09 01:46:26,737 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,738 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,738 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,738 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,738 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,738 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,738 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,738 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,738 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,738 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,739 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,739 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,739 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,739 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,739 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,739 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,740 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,744 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,745 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,745 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,745 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,745 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,745 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,745 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,745 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,745 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,745 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,745 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,746 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,746 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,746 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,746 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,746 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,750 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-09 01:46:26,751 INFO L168 Benchmark]: Toolchain (without parser) took 204970.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 938.0 MB in the beginning and 834.2 MB in the end (delta: 103.8 MB). Peak memory consumption was 264.2 MB. Max. memory is 11.5 GB. [2018-12-09 01:46:26,752 INFO L168 Benchmark]: CDTParser took 0.14 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-09 01:46:26,752 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 11.5 GB. [2018-12-09 01:46:26,752 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.94 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-09 01:46:26,752 INFO L168 Benchmark]: Boogie Preprocessor took 29.14 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-09 01:46:26,752 INFO L168 Benchmark]: RCFGBuilder took 298.72 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: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-09 01:46:26,752 INFO L168 Benchmark]: TraceAbstraction took 204328.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 29.9 MB). Free memory was 1.1 GB in the beginning and 834.2 MB in the end (delta: 249.7 MB). Peak memory consumption was 279.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:46:26,754 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 288.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.94 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 298.72 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: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 204328.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 29.9 MB). Free memory was 1.1 GB in the beginning and 834.2 MB in the end (delta: 249.7 MB). Peak memory consumption was 279.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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-09 01:46:26,756 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,756 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,756 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,756 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,756 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,757 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,757 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,757 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,757 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,757 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,757 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,757 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,757 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,757 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,757 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,757 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,760 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,760 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,760 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,760 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,760 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,760 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,760 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,760 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,760 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,760 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,761 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,761 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,761 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,761 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 01:46:26,761 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,761 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 01:46:26,761 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,761 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,761 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,761 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,761 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:46:26,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 01:46:26,763 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...