./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-buckets_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-buckets_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec7b34841527490886cd362d78588ff0f0e72200 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-buckets_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec7b34841527490886cd362d78588ff0f0e72200 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_8 input size 44 context size 44 output size 44 --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:00:54,047 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:00:54,048 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:00:54,054 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:00:54,054 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:00:54,055 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:00:54,055 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:00:54,056 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:00:54,057 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:00:54,057 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:00:54,058 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:00:54,058 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:00:54,058 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:00:54,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:00:54,059 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:00:54,060 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:00:54,060 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:00:54,061 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:00:54,062 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:00:54,063 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:00:54,064 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:00:54,065 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:00:54,066 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:00:54,066 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:00:54,066 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:00:54,066 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:00:54,067 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:00:54,067 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:00:54,068 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:00:54,069 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:00:54,070 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:00:54,070 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:00:54,070 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:00:54,070 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:00:54,071 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:00:54,071 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:00:54,072 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2018-11-23 15:00:54,079 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:00:54,079 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:00:54,079 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:00:54,080 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:00:54,080 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 15:00:54,080 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 15:00:54,080 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 15:00:54,080 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 15:00:54,080 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 15:00:54,080 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 15:00:54,081 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 15:00:54,081 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 15:00:54,081 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 15:00:54,081 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:00:54,081 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:00:54,082 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:00:54,082 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:00:54,082 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:00:54,082 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:00:54,082 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:00:54,082 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:00:54,082 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 15:00:54,082 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 15:00:54,083 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:00:54,083 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:00:54,083 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:00:54,083 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:00:54,083 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:00:54,083 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:00:54,083 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:00:54,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:00:54,084 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:00:54,084 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:00:54,084 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 15:00:54,084 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:00:54,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 15:00:54,087 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_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/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 valid-memcleanup) ) 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 -> ec7b34841527490886cd362d78588ff0f0e72200 [2018-11-23 15:00:54,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:00:54,120 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:00:54,122 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:00:54,123 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:00:54,124 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:00:54,124 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/sll-buckets_false-unreach-call_false-valid-memcleanup.i [2018-11-23 15:00:54,165 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/data/2e5738918/c2ab9c54f4db4f9890c47566e40d3baa/FLAGaa5f11449 [2018-11-23 15:00:54,624 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:00:54,624 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/sv-benchmarks/c/forester-heap/sll-buckets_false-unreach-call_false-valid-memcleanup.i [2018-11-23 15:00:54,630 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/data/2e5738918/c2ab9c54f4db4f9890c47566e40d3baa/FLAGaa5f11449 [2018-11-23 15:00:55,140 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/data/2e5738918/c2ab9c54f4db4f9890c47566e40d3baa [2018-11-23 15:00:55,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:00:55,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:00:55,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:00:55,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:00:55,147 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:00:55,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:00:55" (1/1) ... [2018-11-23 15:00:55,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ed6b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:55, skipping insertion in model container [2018-11-23 15:00:55,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:00:55" (1/1) ... [2018-11-23 15:00:55,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:00:55,185 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:00:55,373 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:00:55,381 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:00:55,463 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:00:55,494 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:00:55,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:55 WrapperNode [2018-11-23 15:00:55,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:00:55,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:00:55,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:00:55,495 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:00:55,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:55" (1/1) ... [2018-11-23 15:00:55,513 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:55" (1/1) ... [2018-11-23 15:00:55,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:00:55,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:00:55,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:00:55,518 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:00:55,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:55" (1/1) ... [2018-11-23 15:00:55,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:55" (1/1) ... [2018-11-23 15:00:55,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:55" (1/1) ... [2018-11-23 15:00:55,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:55" (1/1) ... [2018-11-23 15:00:55,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:55" (1/1) ... [2018-11-23 15:00:55,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:55" (1/1) ... [2018-11-23 15:00:55,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:55" (1/1) ... [2018-11-23 15:00:55,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:00:55,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:00:55,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:00:55,542 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:00:55,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:00:55,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:00:55,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:00:55,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:00:55,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:00:55,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:00:55,580 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:00:55,580 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:00:55,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 15:00:55,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 15:00:55,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:00:55,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:00:55,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:00:55,999 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:00:55,999 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-11-23 15:00:56,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:00:55 BoogieIcfgContainer [2018-11-23 15:00:56,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:00:56,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:00:56,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:00:56,002 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:00:56,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:00:55" (1/3) ... [2018-11-23 15:00:56,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234410aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:00:56, skipping insertion in model container [2018-11-23 15:00:56,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:55" (2/3) ... [2018-11-23 15:00:56,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234410aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:00:56, skipping insertion in model container [2018-11-23 15:00:56,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:00:55" (3/3) ... [2018-11-23 15:00:56,005 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets_false-unreach-call_false-valid-memcleanup.i [2018-11-23 15:00:56,011 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:00:56,015 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-11-23 15:00:56,025 INFO L257 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2018-11-23 15:00:56,042 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:00:56,042 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 15:00:56,042 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:00:56,042 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:00:56,043 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:00:56,043 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:00:56,043 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:00:56,043 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:00:56,054 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-11-23 15:00:56,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 15:00:56,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:00:56,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:00:56,063 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 15:00:56,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:00:56,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1890133367, now seen corresponding path program 1 times [2018-11-23 15:00:56,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:00:56,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:56,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:00:56,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:56,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:00:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:00:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:00:56,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:00:56,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:00:56,167 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:00:56,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:00:56,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:00:56,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:00:56,179 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2018-11-23 15:00:56,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:00:56,356 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2018-11-23 15:00:56,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:00:56,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 15:00:56,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:00:56,367 INFO L225 Difference]: With dead ends: 172 [2018-11-23 15:00:56,367 INFO L226 Difference]: Without dead ends: 168 [2018-11-23 15:00:56,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:00:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-23 15:00:56,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2018-11-23 15:00:56,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-23 15:00:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-11-23 15:00:56,402 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 7 [2018-11-23 15:00:56,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:00:56,402 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-11-23 15:00:56,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:00:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-11-23 15:00:56,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 15:00:56,403 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:00:56,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:00:56,403 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 15:00:56,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:00:56,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1890133368, now seen corresponding path program 1 times [2018-11-23 15:00:56,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:00:56,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:56,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:00:56,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:56,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:00:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:00:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:00:56,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:00:56,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:00:56,438 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:00:56,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:00:56,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:00:56,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:00:56,439 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 3 states. [2018-11-23 15:00:56,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:00:56,545 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2018-11-23 15:00:56,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:00:56,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 15:00:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:00:56,547 INFO L225 Difference]: With dead ends: 167 [2018-11-23 15:00:56,548 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 15:00:56,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:00:56,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 15:00:56,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 133. [2018-11-23 15:00:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-23 15:00:56,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2018-11-23 15:00:56,556 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 7 [2018-11-23 15:00:56,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:00:56,556 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2018-11-23 15:00:56,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:00:56,556 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2018-11-23 15:00:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 15:00:56,557 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:00:56,557 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:00:56,557 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 15:00:56,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:00:56,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1185125342, now seen corresponding path program 1 times [2018-11-23 15:00:56,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:00:56,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:56,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:00:56,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:56,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:00:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:00:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:00:56,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:00:56,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:00:56,629 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:00:56,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:00:56,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:00:56,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:00:56,630 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand 6 states. [2018-11-23 15:00:56,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:00:56,856 INFO L93 Difference]: Finished difference Result 173 states and 182 transitions. [2018-11-23 15:00:56,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 15:00:56,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 15:00:56,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:00:56,857 INFO L225 Difference]: With dead ends: 173 [2018-11-23 15:00:56,857 INFO L226 Difference]: Without dead ends: 173 [2018-11-23 15:00:56,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 15:00:56,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-23 15:00:56,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 131. [2018-11-23 15:00:56,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 15:00:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2018-11-23 15:00:56,865 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 13 [2018-11-23 15:00:56,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:00:56,865 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2018-11-23 15:00:56,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:00:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2018-11-23 15:00:56,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 15:00:56,866 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:00:56,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:00:56,867 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 15:00:56,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:00:56,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1185125343, now seen corresponding path program 1 times [2018-11-23 15:00:56,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:00:56,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:56,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:00:56,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:56,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:00:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:00:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:00:56,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:00:56,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:00:56,930 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:00:56,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:00:56,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:00:56,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:00:56,931 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand 6 states. [2018-11-23 15:00:57,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:00:57,124 INFO L93 Difference]: Finished difference Result 177 states and 200 transitions. [2018-11-23 15:00:57,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:00:57,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 15:00:57,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:00:57,126 INFO L225 Difference]: With dead ends: 177 [2018-11-23 15:00:57,126 INFO L226 Difference]: Without dead ends: 177 [2018-11-23 15:00:57,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 15:00:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-23 15:00:57,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 127. [2018-11-23 15:00:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 15:00:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2018-11-23 15:00:57,133 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 13 [2018-11-23 15:00:57,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:00:57,133 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2018-11-23 15:00:57,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:00:57,133 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2018-11-23 15:00:57,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 15:00:57,134 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:00:57,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:00:57,134 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 15:00:57,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:00:57,135 INFO L82 PathProgramCache]: Analyzing trace with hash -2015031739, now seen corresponding path program 1 times [2018-11-23 15:00:57,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:00:57,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:57,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:00:57,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:57,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:00:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:00:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:00:57,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:00:57,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:00:57,192 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:00:57,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:00:57,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:00:57,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:00:57,192 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand 6 states. [2018-11-23 15:00:57,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:00:57,365 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2018-11-23 15:00:57,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:00:57,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 15:00:57,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:00:57,365 INFO L225 Difference]: With dead ends: 168 [2018-11-23 15:00:57,366 INFO L226 Difference]: Without dead ends: 168 [2018-11-23 15:00:57,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:00:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-23 15:00:57,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 126. [2018-11-23 15:00:57,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 15:00:57,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2018-11-23 15:00:57,370 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 19 [2018-11-23 15:00:57,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:00:57,371 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2018-11-23 15:00:57,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:00:57,371 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2018-11-23 15:00:57,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 15:00:57,371 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:00:57,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:00:57,372 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 15:00:57,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:00:57,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2015031738, now seen corresponding path program 1 times [2018-11-23 15:00:57,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:00:57,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:57,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:00:57,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:57,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:00:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:00:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:00:57,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:00:57,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:00:57,462 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:00:57,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:00:57,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:00:57,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:00:57,463 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand 6 states. [2018-11-23 15:00:57,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:00:57,601 INFO L93 Difference]: Finished difference Result 173 states and 196 transitions. [2018-11-23 15:00:57,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:00:57,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 15:00:57,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:00:57,603 INFO L225 Difference]: With dead ends: 173 [2018-11-23 15:00:57,603 INFO L226 Difference]: Without dead ends: 173 [2018-11-23 15:00:57,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:00:57,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-23 15:00:57,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 123. [2018-11-23 15:00:57,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 15:00:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2018-11-23 15:00:57,607 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 19 [2018-11-23 15:00:57,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:00:57,607 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2018-11-23 15:00:57,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:00:57,608 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2018-11-23 15:00:57,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 15:00:57,608 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:00:57,608 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] [2018-11-23 15:00:57,608 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 15:00:57,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:00:57,609 INFO L82 PathProgramCache]: Analyzing trace with hash 771067182, now seen corresponding path program 1 times [2018-11-23 15:00:57,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:00:57,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:57,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:00:57,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:57,610 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:00:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:00:57,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:00:57,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:00:57,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:00:57,643 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:00:57,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:00:57,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:00:57,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:00:57,644 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand 3 states. [2018-11-23 15:00:57,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:00:57,702 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2018-11-23 15:00:57,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:00:57,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 15:00:57,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:00:57,703 INFO L225 Difference]: With dead ends: 129 [2018-11-23 15:00:57,703 INFO L226 Difference]: Without dead ends: 129 [2018-11-23 15:00:57,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:00:57,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-23 15:00:57,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2018-11-23 15:00:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 15:00:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2018-11-23 15:00:57,706 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 25 [2018-11-23 15:00:57,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:00:57,707 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2018-11-23 15:00:57,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:00:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2018-11-23 15:00:57,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 15:00:57,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:00:57,707 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] [2018-11-23 15:00:57,707 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 15:00:57,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:00:57,708 INFO L82 PathProgramCache]: Analyzing trace with hash 771067183, now seen corresponding path program 1 times [2018-11-23 15:00:57,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:00:57,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:57,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:00:57,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:57,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:00:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:00:57,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:00:57,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:00:57,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:00:57,748 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:00:57,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:00:57,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:00:57,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:00:57,749 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand 3 states. [2018-11-23 15:00:57,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:00:57,813 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2018-11-23 15:00:57,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:00:57,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 15:00:57,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:00:57,814 INFO L225 Difference]: With dead ends: 124 [2018-11-23 15:00:57,814 INFO L226 Difference]: Without dead ends: 124 [2018-11-23 15:00:57,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:00:57,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-23 15:00:57,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 113. [2018-11-23 15:00:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 15:00:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-11-23 15:00:57,819 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 25 [2018-11-23 15:00:57,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:00:57,819 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-11-23 15:00:57,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:00:57,819 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-11-23 15:00:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 15:00:57,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:00:57,820 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] [2018-11-23 15:00:57,820 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 15:00:57,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:00:57,822 INFO L82 PathProgramCache]: Analyzing trace with hash -2033706762, now seen corresponding path program 1 times [2018-11-23 15:00:57,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:00:57,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:57,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:00:57,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:57,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:00:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:00:57,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:00:57,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:00:57,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 15:00:57,928 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:00:57,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 15:00:57,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 15:00:57,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 15:00:57,928 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 8 states. [2018-11-23 15:00:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:00:58,066 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2018-11-23 15:00:58,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:00:58,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 15:00:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:00:58,068 INFO L225 Difference]: With dead ends: 148 [2018-11-23 15:00:58,068 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 15:00:58,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:00:58,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 15:00:58,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 115. [2018-11-23 15:00:58,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 15:00:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2018-11-23 15:00:58,070 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 27 [2018-11-23 15:00:58,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:00:58,070 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2018-11-23 15:00:58,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 15:00:58,070 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2018-11-23 15:00:58,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 15:00:58,071 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:00:58,071 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] [2018-11-23 15:00:58,071 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 15:00:58,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:00:58,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2033706761, now seen corresponding path program 1 times [2018-11-23 15:00:58,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:00:58,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:58,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:00:58,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:58,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:00:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:00:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:00:58,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:00:58,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 15:00:58,231 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:00:58,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 15:00:58,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:00:58,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:00:58,232 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand 7 states. [2018-11-23 15:00:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:00:58,412 INFO L93 Difference]: Finished difference Result 188 states and 208 transitions. [2018-11-23 15:00:58,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 15:00:58,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-23 15:00:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:00:58,417 INFO L225 Difference]: With dead ends: 188 [2018-11-23 15:00:58,417 INFO L226 Difference]: Without dead ends: 188 [2018-11-23 15:00:58,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-23 15:00:58,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-23 15:00:58,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 150. [2018-11-23 15:00:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 15:00:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 181 transitions. [2018-11-23 15:00:58,420 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 181 transitions. Word has length 27 [2018-11-23 15:00:58,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:00:58,420 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 181 transitions. [2018-11-23 15:00:58,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 15:00:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 181 transitions. [2018-11-23 15:00:58,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 15:00:58,421 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:00:58,421 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] [2018-11-23 15:00:58,421 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 15:00:58,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:00:58,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1379600496, now seen corresponding path program 1 times [2018-11-23 15:00:58,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:00:58,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:58,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:00:58,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:58,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:00:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:00:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:00:58,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:00:58,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:00:58,453 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:00:58,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:00:58,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:00:58,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:00:58,454 INFO L87 Difference]: Start difference. First operand 150 states and 181 transitions. Second operand 4 states. [2018-11-23 15:00:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:00:58,513 INFO L93 Difference]: Finished difference Result 183 states and 209 transitions. [2018-11-23 15:00:58,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:00:58,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 15:00:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:00:58,515 INFO L225 Difference]: With dead ends: 183 [2018-11-23 15:00:58,515 INFO L226 Difference]: Without dead ends: 183 [2018-11-23 15:00:58,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:00:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-23 15:00:58,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 150. [2018-11-23 15:00:58,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 15:00:58,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 180 transitions. [2018-11-23 15:00:58,517 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 180 transitions. Word has length 28 [2018-11-23 15:00:58,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:00:58,518 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 180 transitions. [2018-11-23 15:00:58,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:00:58,518 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 180 transitions. [2018-11-23 15:00:58,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 15:00:58,518 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:00:58,518 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-11-23 15:00:58,519 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 15:00:58,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:00:58,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1121357240, now seen corresponding path program 1 times [2018-11-23 15:00:58,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:00:58,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:58,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:00:58,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:58,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:00:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:00:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:00:58,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:00:58,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-23 15:00:58,818 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:00:58,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 15:00:58,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 15:00:58,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-11-23 15:00:58,819 INFO L87 Difference]: Start difference. First operand 150 states and 180 transitions. Second operand 16 states. [2018-11-23 15:00:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:00:59,800 INFO L93 Difference]: Finished difference Result 178 states and 207 transitions. [2018-11-23 15:00:59,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 15:00:59,801 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-11-23 15:00:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:00:59,803 INFO L225 Difference]: With dead ends: 178 [2018-11-23 15:00:59,803 INFO L226 Difference]: Without dead ends: 178 [2018-11-23 15:00:59,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 15:00:59,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-23 15:00:59,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 158. [2018-11-23 15:00:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-23 15:00:59,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 189 transitions. [2018-11-23 15:00:59,807 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 189 transitions. Word has length 31 [2018-11-23 15:00:59,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:00:59,807 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 189 transitions. [2018-11-23 15:00:59,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 15:00:59,807 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 189 transitions. [2018-11-23 15:00:59,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 15:00:59,808 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:00:59,808 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 15:00:59,808 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 15:00:59,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:00:59,809 INFO L82 PathProgramCache]: Analyzing trace with hash 114271884, now seen corresponding path program 1 times [2018-11-23 15:00:59,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:00:59,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:59,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:00:59,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:00:59,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:00:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:01:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:01:00,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:01:00,066 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:01:00,066 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-23 15:01:00,067 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [19], [20], [23], [26], [27], [30], [33], [34], [37], [40], [43], [48], [51], [187], [196], [197], [198], [200], [201], [210], [252], [256], [261], [262], [265], [267], [269], [276], [277], [278] [2018-11-23 15:01:00,090 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 15:01:00,090 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 15:01:00,219 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 15:01:00,220 INFO L272 AbstractInterpreter]: Visited 38 different actions 38 times. Never merged. Never widened. Performed 346 root evaluator evaluations with a maximum evaluation depth of 3. Performed 346 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 37 variables. [2018-11-23 15:01:00,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:01:00,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 15:01:00,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:01:00,225 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:01:00,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:01:00,233 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 15:01:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:01:00,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:01:00,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:01:00,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 15:01:00,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:00,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:00,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 15:01:00,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-23 15:01:00,345 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-11-23 15:01:00,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 15:01:00,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-11-23 15:01:00,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:00,418 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 35 treesize of output 36 [2018-11-23 15:01:00,420 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-11-23 15:01:00,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:21 [2018-11-23 15:01:00,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:00,433 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 29 treesize of output 30 [2018-11-23 15:01:00,434 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-11-23 15:01:00,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-11-23 15:01:00,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:00,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:00,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 15:01:00,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:29 [2018-11-23 15:01:00,500 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:00,503 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-11-23 15:01:00,505 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:00,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 15:01:00,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:38 [2018-11-23 15:01:00,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:00,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 80 [2018-11-23 15:01:00,610 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 82 treesize of output 66 [2018-11-23 15:01:00,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:00,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 57 [2018-11-23 15:01:00,649 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-23 15:01:00,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 15:01:00,697 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 3 xjuncts. [2018-11-23 15:01:00,697 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:73, output treesize:107 [2018-11-23 15:01:00,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 68 [2018-11-23 15:01:00,764 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 64 treesize of output 63 [2018-11-23 15:01:00,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,787 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:00,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 62 [2018-11-23 15:01:00,795 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 15:01:00,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:01:00,863 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 38 [2018-11-23 15:01:00,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:00,867 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 18 treesize of output 27 [2018-11-23 15:01:00,867 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,875 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,917 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 38 [2018-11-23 15:01:00,920 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 9 [2018-11-23 15:01:00,920 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,925 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:01:00,944 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:146, output treesize:86 [2018-11-23 15:01:00,986 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-11-23 15:01:00,988 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:00,989 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 31 [2018-11-23 15:01:00,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:00,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:01,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 75 [2018-11-23 15:01:01,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:01,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:01,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 71 [2018-11-23 15:01:01,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 15:01:01,076 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:01,076 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 66 treesize of output 81 [2018-11-23 15:01:01,077 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:01,094 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:01:01,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-23 15:01:01,112 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:138, output treesize:160 [2018-11-23 15:01:01,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 69 [2018-11-23 15:01:01,685 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:01,687 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 73 treesize of output 90 [2018-11-23 15:01:01,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:01,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:01,726 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 55 treesize of output 45 [2018-11-23 15:01:01,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:01,731 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 44 treesize of output 57 [2018-11-23 15:01:01,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:01,741 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:01,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 15:01:01,761 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:144, output treesize:136 [2018-11-23 15:01:03,819 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 15:01:03,882 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 64 [2018-11-23 15:01:03,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:03,888 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 51 treesize of output 41 [2018-11-23 15:01:03,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:03,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:03,923 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2018-11-23 15:01:03,924 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:03,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:03,943 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 38 treesize of output 32 [2018-11-23 15:01:03,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:03,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:03,962 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:03,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 44 [2018-11-23 15:01:03,971 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-23 15:01:03,997 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:04,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-11-23 15:01:04,001 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:04,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:04,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:04,016 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:150, output treesize:10 [2018-11-23 15:01:04,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:04,030 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 12 treesize of output 21 [2018-11-23 15:01:04,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:04,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:04,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-11-23 15:01:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:01:04,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:01:04,234 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:04,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:04,241 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:04,248 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:04,249 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:04,253 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:04,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-23 15:01:04,267 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:46, output treesize:105 [2018-11-23 15:01:14,136 WARN L180 SmtUtils]: Spent 9.77 s on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2018-11-23 15:01:18,822 WARN L180 SmtUtils]: Spent 4.65 s on a formula simplification that was a NOOP. DAG size: 36 [2018-11-23 15:01:25,238 WARN L180 SmtUtils]: Spent 6.37 s on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 15:01:25,270 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 42 treesize of output 37 [2018-11-23 15:01:25,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:25,272 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 41 treesize of output 34 [2018-11-23 15:01:25,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:25,291 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 41 treesize of output 36 [2018-11-23 15:01:25,291 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:25,293 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 40 treesize of output 34 [2018-11-23 15:01:25,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:25,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-23 15:01:25,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:90, output treesize:101 [2018-11-23 15:01:31,801 WARN L180 SmtUtils]: Spent 6.44 s on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2018-11-23 15:01:33,857 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 15:01:33,918 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:33,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:33,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:33,954 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:33,973 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:33,977 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:33,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-11-23 15:01:33,989 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:149, output treesize:108 [2018-11-23 15:01:38,115 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2018-11-23 15:01:40,162 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-23 15:01:40,165 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 15:01:40,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:40,172 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:01:40,172 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:01:40,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-23 15:01:40,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:40,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 43 [2018-11-23 15:01:40,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 15:01:40,182 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:40,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:40,188 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:01:40,189 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 42 treesize of output 42 [2018-11-23 15:01:40,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:40,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 15:01:40,215 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:40,222 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 8 treesize of output 6 [2018-11-23 15:01:40,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 15:01:40,223 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:40,224 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:40,227 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:40,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:40,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:40,232 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:92, output treesize:4 [2018-11-23 15:01:40,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:01:40,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:01:40,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 18] total 47 [2018-11-23 15:01:40,279 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:01:40,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 15:01:40,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 15:01:40,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2035, Unknown=5, NotChecked=0, Total=2256 [2018-11-23 15:01:40,281 INFO L87 Difference]: Start difference. First operand 158 states and 189 transitions. Second operand 35 states. [2018-11-23 15:01:44,652 WARN L180 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2018-11-23 15:01:44,854 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2018-11-23 15:01:45,273 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2018-11-23 15:01:45,441 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2018-11-23 15:01:45,586 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-11-23 15:01:46,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:01:46,285 INFO L93 Difference]: Finished difference Result 233 states and 250 transitions. [2018-11-23 15:01:46,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 15:01:46,286 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 39 [2018-11-23 15:01:46,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:01:46,286 INFO L225 Difference]: With dead ends: 233 [2018-11-23 15:01:46,287 INFO L226 Difference]: Without dead ends: 233 [2018-11-23 15:01:46,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 43.8s TimeCoverageRelationStatistics Valid=739, Invalid=4654, Unknown=9, NotChecked=0, Total=5402 [2018-11-23 15:01:46,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-23 15:01:46,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 167. [2018-11-23 15:01:46,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-23 15:01:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 200 transitions. [2018-11-23 15:01:46,292 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 200 transitions. Word has length 39 [2018-11-23 15:01:46,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:01:46,293 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 200 transitions. [2018-11-23 15:01:46,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 15:01:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 200 transitions. [2018-11-23 15:01:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 15:01:46,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:01:46,294 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 15:01:46,294 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 15:01:46,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:01:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash 114271885, now seen corresponding path program 1 times [2018-11-23 15:01:46,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:01:46,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:01:46,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:01:46,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:01:46,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:01:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:01:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:01:46,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:01:46,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:01:46,626 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-23 15:01:46,626 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [19], [20], [23], [26], [27], [30], [33], [34], [37], [40], [43], [48], [51], [187], [196], [197], [199], [200], [201], [210], [252], [256], [261], [262], [265], [267], [269], [276], [277], [278] [2018-11-23 15:01:46,628 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 15:01:46,628 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 15:01:46,682 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 15:01:46,683 INFO L272 AbstractInterpreter]: Visited 38 different actions 38 times. Never merged. Never widened. Performed 350 root evaluator evaluations with a maximum evaluation depth of 3. Performed 350 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 37 variables. [2018-11-23 15:01:46,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:01:46,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 15:01:46,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:01:46,689 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:01:46,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:01:46,706 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 15:01:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:01:46,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:01:46,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:01:46,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:46,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:46,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 15:01:46,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:46,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:46,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 15:01:46,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:46,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:46,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-11-23 15:01:46,786 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-11-23 15:01:46,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 15:01:46,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:46,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:46,798 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-11-23 15:01:46,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 15:01:46,799 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:46,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:46,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:46,806 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-23 15:01:46,861 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:46,864 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 27 treesize of output 32 [2018-11-23 15:01:46,866 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 20 treesize of output 19 [2018-11-23 15:01:46,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:46,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:46,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:46,884 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 44 treesize of output 45 [2018-11-23 15:01:46,888 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-11-23 15:01:46,889 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:46,894 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:46,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:46,901 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:82, output treesize:44 [2018-11-23 15:01:46,925 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:46,929 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 26 [2018-11-23 15:01:46,931 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-11-23 15:01:46,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:46,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:46,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:46,952 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 51 treesize of output 52 [2018-11-23 15:01:46,954 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-11-23 15:01:46,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:46,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:46,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:46,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:71 [2018-11-23 15:01:47,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,022 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 14 treesize of output 21 [2018-11-23 15:01:47,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,041 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-23 15:01:47,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:78 [2018-11-23 15:01:47,088 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-11-23 15:01:47,090 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,091 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 31 [2018-11-23 15:01:47,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,114 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,117 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 78 [2018-11-23 15:01:47,119 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 15:01:47,121 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,144 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:100, output treesize:90 [2018-11-23 15:01:47,229 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,238 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 117 treesize of output 113 [2018-11-23 15:01:47,240 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-11-23 15:01:47,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,272 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 65 [2018-11-23 15:01:47,273 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 24 treesize of output 23 [2018-11-23 15:01:47,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,291 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 1 xjuncts. [2018-11-23 15:01:47,292 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:148, output treesize:94 [2018-11-23 15:01:47,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,322 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,327 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 111 treesize of output 107 [2018-11-23 15:01:47,329 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-11-23 15:01:47,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,372 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 59 [2018-11-23 15:01:47,374 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-11-23 15:01:47,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,395 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 1 xjuncts. [2018-11-23 15:01:47,396 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:136, output treesize:128 [2018-11-23 15:01:47,437 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 132 [2018-11-23 15:01:47,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,441 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-11-23 15:01:47,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,482 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 80 [2018-11-23 15:01:47,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,485 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-11-23 15:01:47,485 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:47,510 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:187, output treesize:163 [2018-11-23 15:01:47,611 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 125 [2018-11-23 15:01:47,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,616 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 137 treesize of output 166 [2018-11-23 15:01:47,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,667 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 97 [2018-11-23 15:01:47,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,670 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-11-23 15:01:47,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:47,703 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:189, output treesize:181 [2018-11-23 15:01:47,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 104 [2018-11-23 15:01:47,770 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 15:01:47,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,790 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-11-23 15:01:47,792 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,807 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,808 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2018-11-23 15:01:47,809 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:47,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:47,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2018-11-23 15:01:47,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 15:01:47,841 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:01:47,850 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 18 treesize of output 10 [2018-11-23 15:01:47,850 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 15:01:47,857 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,858 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:47,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:47,866 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:195, output treesize:18 [2018-11-23 15:01:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:01:47,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:01:48,273 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:48,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:48,285 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:48,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:48,303 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:48,308 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:48,364 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:48,370 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:48,371 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:48,378 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:48,431 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:48,436 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:48,437 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:48,440 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:48,441 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:48,445 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:01:48,483 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:48,486 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:48,487 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 15:01:48,489 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:01:48,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 13 dim-0 vars, and 5 xjuncts. [2018-11-23 15:01:48,518 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 6 variables, input treesize:146, output treesize:228 [2018-11-23 15:01:55,649 WARN L180 SmtUtils]: Spent 6.98 s on a formula simplification. DAG size of input: 104 DAG size of output: 56 [2018-11-23 15:02:01,887 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-23 15:02:07,413 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 59 [2018-11-23 15:02:15,743 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 69 [2018-11-23 15:02:18,137 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 85 [2018-11-23 15:02:18,573 WARN L180 SmtUtils]: Spent 432.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2018-11-23 15:02:18,590 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 116 treesize of output 114 [2018-11-23 15:02:18,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:02:18,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 131 [2018-11-23 15:02:18,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:02:18,600 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 183 treesize of output 181 [2018-11-23 15:02:18,600 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:02:20,277 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 1 case distinctions, treesize of input 283 treesize of output 361 [2018-11-23 15:02:20,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 15:02:20,283 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 250 treesize of output 249 [2018-11-23 15:02:20,284 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:02:20,345 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 266 treesize of output 354 [2018-11-23 15:02:20,347 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 8 xjuncts. [2018-11-23 15:02:20,361 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 207 treesize of output 205 [2018-11-23 15:02:20,362 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 15:02:20,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 237 [2018-11-23 15:02:20,387 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-23 15:02:20,394 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 240 treesize of output 239 [2018-11-23 15:02:20,395 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 15:02:20,415 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 223 treesize of output 227 [2018-11-23 15:02:20,416 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-23 15:02:20,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 188 [2018-11-23 15:02:20,421 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 15:02:21,319 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,343 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,344 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,370 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,371 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,399 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,400 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,428 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,429 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,444 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,445 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,462 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,463 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,482 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,483 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,505 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,506 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,526 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,527 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,553 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,554 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-23 15:02:21,574 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:02:21,575 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:21,611 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,397 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,417 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,418 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,433 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,434 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,449 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,450 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,471 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,472 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,491 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,492 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,501 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,502 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,516 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,517 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,528 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,529 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-23 15:02:23,538 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:02:23,539 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,554 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,555 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,572 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,574 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:23,588 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:26,296 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:26,308 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:26,310 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:26,325 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:02:31,889 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-23 15:02:31,898 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:02:31,899 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-23 15:02:31,911 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:02:35,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, 4 dim-2 vars, End of recursive call: 97 dim-0 vars, and 14 xjuncts. [2018-11-23 15:02:35,374 INFO L202 ElimStorePlain]: Needed 68 recursive calls to eliminate 17 variables, input treesize:361, output treesize:2079 [2018-11-23 15:03:21,903 WARN L180 SmtUtils]: Spent 38.01 s on a formula simplification. DAG size of input: 566 DAG size of output: 479 [2018-11-23 15:03:55,046 WARN L180 SmtUtils]: Spent 16.48 s on a formula simplification that was a NOOP. DAG size: 479 [2018-11-23 15:04:36,380 WARN L180 SmtUtils]: Spent 28.74 s on a formula simplification. DAG size of input: 480 DAG size of output: 407 [2018-11-23 15:04:36,407 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 286 treesize of output 247 [2018-11-23 15:04:36,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 15:04:36,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:36,527 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,529 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 89 [2018-11-23 15:04:36,629 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 62 treesize of output 65 [2018-11-23 15:04:36,631 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,633 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-23 15:04:36,636 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,636 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,636 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-11-23 15:04:36,640 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:36,650 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:36,664 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:36,718 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 68 [2018-11-23 15:04:36,722 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,723 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,729 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 1 case distinctions, treesize of input 61 treesize of output 76 [2018-11-23 15:04:36,732 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,734 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,734 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,734 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,740 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 69 [2018-11-23 15:04:36,742 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:36,769 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:36,803 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,804 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 71 [2018-11-23 15:04:36,808 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,808 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,809 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,811 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 55 [2018-11-23 15:04:36,813 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:36,841 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:36,879 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:04:36,938 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,940 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 62 treesize of output 55 [2018-11-23 15:04:36,943 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,943 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,945 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,945 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,945 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,950 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 39 [2018-11-23 15:04:36,955 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-23 15:04:36,992 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 19 treesize of output 23 [2018-11-23 15:04:36,994 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:36,996 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-23 15:04:37,006 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 15:04:37,006 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:37,010 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:37,011 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:37,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-23 15:04:37,019 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-11-23 15:04:37,051 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:04:37,057 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:04:37,080 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 15:04:37,083 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:37,084 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 69 treesize of output 62 [2018-11-23 15:04:37,087 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:37,087 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:37,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-11-23 15:04:37,091 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:37,109 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 19 treesize of output 23 [2018-11-23 15:04:37,111 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:37,113 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-23 15:04:37,124 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:37,124 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:37,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, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-11-23 15:04:37,130 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-11-23 15:04:37,132 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 15:04:37,132 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:37,146 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:04:37,150 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:04:37,165 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:04:37,244 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:37,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 62 [2018-11-23 15:04:37,255 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 40 treesize of output 43 [2018-11-23 15:04:37,258 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:37,259 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-23 15:04:37,272 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 15:04:37,272 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:37,277 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:37,278 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:37,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-23 15:04:37,286 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-11-23 15:04:37,301 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:04:37,314 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:04:37,355 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 46 treesize of output 49 [2018-11-23 15:04:37,358 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:37,360 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-23 15:04:37,388 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 15:04:37,389 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:37,394 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:37,395 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:37,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-23 15:04:37,407 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-11-23 15:04:37,427 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:04:37,439 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:04:37,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-23 15:04:37,486 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:37,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-11-23 15:04:37,489 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:37,729 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:04:37,729 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: nested self-update not yet implemented: (store (store v_arrayElimCell_76 (+ v_prenex_88 8) v_DerPreprocessor_66) (+ v_prenex_88 4) 0) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:219) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:208) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.convert(DerPreprocessor.java:191) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:211) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 15:04:37,732 INFO L168 Benchmark]: Toolchain (without parser) took 222588.87 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 231.7 MB). Free memory was 956.6 MB in the beginning and 961.4 MB in the end (delta: -4.9 MB). Peak memory consumption was 371.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:04:37,732 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:04:37,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:04:37,733 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:04:37,733 INFO L168 Benchmark]: Boogie Preprocessor took 24.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:04:37,733 INFO L168 Benchmark]: RCFGBuilder took 457.93 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: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:04:37,733 INFO L168 Benchmark]: TraceAbstraction took 221731.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.3 MB). Free memory was 1.1 GB in the beginning and 961.4 MB in the end (delta: 105.4 MB). Peak memory consumption was 353.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:04:37,735 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 350.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 457.93 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: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 221731.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.3 MB). Free memory was 1.1 GB in the beginning and 961.4 MB in the end (delta: 105.4 MB). Peak memory consumption was 353.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store (store v_arrayElimCell_76 (+ v_prenex_88 8) v_DerPreprocessor_66) (+ v_prenex_88 4) 0) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: nested self-update not yet implemented: (store (store v_arrayElimCell_76 (+ v_prenex_88 8) v_DerPreprocessor_66) (+ v_prenex_88 4) 0): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 15:04:39,060 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:04:39,061 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:04:39,069 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:04:39,069 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:04:39,070 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:04:39,070 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:04:39,071 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:04:39,073 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:04:39,074 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:04:39,074 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:04:39,074 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:04:39,075 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:04:39,076 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:04:39,077 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:04:39,078 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:04:39,078 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:04:39,080 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:04:39,081 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:04:39,083 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:04:39,083 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:04:39,084 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:04:39,086 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:04:39,086 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:04:39,086 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:04:39,087 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:04:39,088 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:04:39,089 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:04:39,089 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:04:39,090 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:04:39,090 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:04:39,091 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:04:39,091 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:04:39,091 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:04:39,091 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:04:39,092 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:04:39,093 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Bitvector.epf [2018-11-23 15:04:39,103 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:04:39,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:04:39,104 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:04:39,104 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:04:39,104 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 15:04:39,104 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 15:04:39,105 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 15:04:39,105 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 15:04:39,105 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 15:04:39,105 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 15:04:39,105 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:04:39,105 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:04:39,106 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:04:39,106 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:04:39,106 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:04:39,106 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:04:39,106 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:04:39,106 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:04:39,106 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 15:04:39,106 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 15:04:39,107 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:04:39,107 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 15:04:39,107 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 15:04:39,107 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:04:39,107 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:04:39,107 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:04:39,107 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:04:39,107 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:04:39,107 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:04:39,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:04:39,108 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:04:39,108 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:04:39,108 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 15:04:39,108 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:04:39,108 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 15:04:39,108 INFO L133 SettingsManager]: * Logic for external solver=AUFBV 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_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/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 valid-memcleanup) ) 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 -> ec7b34841527490886cd362d78588ff0f0e72200 [2018-11-23 15:04:39,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:04:39,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:04:39,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:04:39,148 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:04:39,148 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:04:39,149 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/sll-buckets_false-unreach-call_false-valid-memcleanup.i [2018-11-23 15:04:39,183 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/data/fba3193c0/8998102011ed49d681712989b604c6d6/FLAG89cb29e0f [2018-11-23 15:04:39,617 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:04:39,617 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/sv-benchmarks/c/forester-heap/sll-buckets_false-unreach-call_false-valid-memcleanup.i [2018-11-23 15:04:39,625 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/data/fba3193c0/8998102011ed49d681712989b604c6d6/FLAG89cb29e0f [2018-11-23 15:04:39,633 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/data/fba3193c0/8998102011ed49d681712989b604c6d6 [2018-11-23 15:04:39,635 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:04:39,636 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:04:39,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:04:39,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:04:39,639 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:04:39,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:04:39" (1/1) ... [2018-11-23 15:04:39,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e224b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:04:39, skipping insertion in model container [2018-11-23 15:04:39,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:04:39" (1/1) ... [2018-11-23 15:04:39,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:04:39,679 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:04:39,901 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:04:39,912 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:04:39,953 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:04:40,036 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:04:40,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:04:40 WrapperNode [2018-11-23 15:04:40,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:04:40,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:04:40,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:04:40,037 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:04:40,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:04:40" (1/1) ... [2018-11-23 15:04:40,052 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:04:40" (1/1) ... [2018-11-23 15:04:40,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:04:40,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:04:40,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:04:40,057 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:04:40,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:04:40" (1/1) ... [2018-11-23 15:04:40,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:04:40" (1/1) ... [2018-11-23 15:04:40,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:04:40" (1/1) ... [2018-11-23 15:04:40,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:04:40" (1/1) ... [2018-11-23 15:04:40,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:04:40" (1/1) ... [2018-11-23 15:04:40,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:04:40" (1/1) ... [2018-11-23 15:04:40,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:04:40" (1/1) ... [2018-11-23 15:04:40,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:04:40,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:04:40,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:04:40,083 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:04:40,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:04:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:04:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:04:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 15:04:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:04:40,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:04:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:04:40,116 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:04:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 15:04:40,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 15:04:40,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:04:40,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 15:04:40,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:04:40,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:04:40,687 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:04:40,688 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-11-23 15:04:40,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:04:40 BoogieIcfgContainer [2018-11-23 15:04:40,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:04:40,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:04:40,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:04:40,690 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:04:40,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:04:39" (1/3) ... [2018-11-23 15:04:40,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a0b73b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:04:40, skipping insertion in model container [2018-11-23 15:04:40,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:04:40" (2/3) ... [2018-11-23 15:04:40,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a0b73b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:04:40, skipping insertion in model container [2018-11-23 15:04:40,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:04:40" (3/3) ... [2018-11-23 15:04:40,692 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets_false-unreach-call_false-valid-memcleanup.i [2018-11-23 15:04:40,698 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:04:40,702 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-11-23 15:04:40,712 INFO L257 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2018-11-23 15:04:40,727 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:04:40,727 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:04:40,727 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 15:04:40,728 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:04:40,728 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:04:40,728 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:04:40,728 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:04:40,728 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:04:40,728 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:04:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2018-11-23 15:04:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 15:04:40,747 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:04:40,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:04:40,749 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2018-11-23 15:04:40,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:04:40,753 INFO L82 PathProgramCache]: Analyzing trace with hash 115064501, now seen corresponding path program 1 times [2018-11-23 15:04:40,755 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:04:40,756 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:04:40,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:04:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:04:40,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:04:40,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:04:40,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:40,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:40,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 15:04:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:04:40,861 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:04:40,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:04:40,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:04:40,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:04:40,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:04:40,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:04:40,876 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2018-11-23 15:04:41,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:04:41,179 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2018-11-23 15:04:41,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:04:41,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 15:04:41,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:04:41,189 INFO L225 Difference]: With dead ends: 170 [2018-11-23 15:04:41,189 INFO L226 Difference]: Without dead ends: 166 [2018-11-23 15:04:41,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:04:41,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-23 15:04:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 135. [2018-11-23 15:04:41,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 15:04:41,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2018-11-23 15:04:41,218 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 7 [2018-11-23 15:04:41,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:04:41,218 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2018-11-23 15:04:41,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:04:41,219 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2018-11-23 15:04:41,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 15:04:41,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:04:41,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:04:41,219 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2018-11-23 15:04:41,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:04:41,220 INFO L82 PathProgramCache]: Analyzing trace with hash 115064502, now seen corresponding path program 1 times [2018-11-23 15:04:41,220 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:04:41,224 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:04:41,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:04:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:04:41,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:04:41,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:04:41,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:41,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:41,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 15:04:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:04:41,304 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:04:41,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:04:41,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:04:41,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:04:41,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:04:41,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:04:41,310 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 3 states. [2018-11-23 15:04:41,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:04:41,573 INFO L93 Difference]: Finished difference Result 164 states and 173 transitions. [2018-11-23 15:04:41,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:04:41,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 15:04:41,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:04:41,575 INFO L225 Difference]: With dead ends: 164 [2018-11-23 15:04:41,575 INFO L226 Difference]: Without dead ends: 164 [2018-11-23 15:04:41,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:04:41,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-23 15:04:41,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 131. [2018-11-23 15:04:41,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 15:04:41,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-11-23 15:04:41,583 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 7 [2018-11-23 15:04:41,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:04:41,583 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-11-23 15:04:41,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:04:41,583 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-11-23 15:04:41,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 15:04:41,584 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:04:41,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:04:41,584 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2018-11-23 15:04:41,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:04:41,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1484899996, now seen corresponding path program 1 times [2018-11-23 15:04:41,585 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:04:41,585 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:04:41,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:04:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:04:41,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:04:41,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 11 [2018-11-23 15:04:41,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:41,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:41,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:11 [2018-11-23 15:04:41,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 15:04:41,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 15:04:41,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:41,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:41,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:41,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2018-11-23 15:04:41,701 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 17 treesize of output 13 [2018-11-23 15:04:41,704 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-11-23 15:04:41,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:41,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:41,713 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-11-23 15:04:41,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:13 [2018-11-23 15:04:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:04:41,739 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:04:41,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:04:41,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 15:04:41,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 15:04:41,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:04:41,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:04:41,741 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 7 states. [2018-11-23 15:04:42,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:04:42,446 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-11-23 15:04:42,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 15:04:42,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 15:04:42,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:04:42,447 INFO L225 Difference]: With dead ends: 175 [2018-11-23 15:04:42,447 INFO L226 Difference]: Without dead ends: 175 [2018-11-23 15:04:42,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-23 15:04:42,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-23 15:04:42,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 135. [2018-11-23 15:04:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 15:04:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 153 transitions. [2018-11-23 15:04:42,452 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 153 transitions. Word has length 13 [2018-11-23 15:04:42,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:04:42,453 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 153 transitions. [2018-11-23 15:04:42,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 15:04:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 153 transitions. [2018-11-23 15:04:42,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 15:04:42,453 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:04:42,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:04:42,456 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2018-11-23 15:04:42,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:04:42,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1484899997, now seen corresponding path program 1 times [2018-11-23 15:04:42,457 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:04:42,457 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:04:42,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:04:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:04:42,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:04:42,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:04:42,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:42,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:42,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 15:04:42,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 15:04:42,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 15:04:42,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:42,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:42,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 15:04:42,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 15:04:42,578 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:42,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:42,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:42,587 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-11-23 15:04:42,606 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 15 treesize of output 11 [2018-11-23 15:04:42,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 15:04:42,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:42,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:42,619 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 17 treesize of output 13 [2018-11-23 15:04:42,622 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-11-23 15:04:42,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:42,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:42,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:42,627 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-11-23 15:04:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:04:42,643 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:04:42,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:04:42,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:04:42,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:04:42,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:04:42,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:04:42,645 INFO L87 Difference]: Start difference. First operand 135 states and 153 transitions. Second operand 6 states. [2018-11-23 15:04:43,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:04:43,251 INFO L93 Difference]: Finished difference Result 185 states and 215 transitions. [2018-11-23 15:04:43,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:04:43,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 15:04:43,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:04:43,253 INFO L225 Difference]: With dead ends: 185 [2018-11-23 15:04:43,253 INFO L226 Difference]: Without dead ends: 185 [2018-11-23 15:04:43,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 15:04:43,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-23 15:04:43,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 131. [2018-11-23 15:04:43,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 15:04:43,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2018-11-23 15:04:43,260 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 13 [2018-11-23 15:04:43,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:04:43,260 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2018-11-23 15:04:43,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:04:43,260 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2018-11-23 15:04:43,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 15:04:43,261 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:04:43,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:04:43,261 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2018-11-23 15:04:43,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:04:43,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1974844035, now seen corresponding path program 1 times [2018-11-23 15:04:43,262 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:04:43,262 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:04:43,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:04:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:04:43,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:04:43,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:04:43,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:43,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:43,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 15:04:43,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 15:04:43,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 15:04:43,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:43,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:43,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:43,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-11-23 15:04:43,349 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 15 [2018-11-23 15:04:43,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 15 treesize of output 7 [2018-11-23 15:04:43,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:43,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:43,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:43,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-11-23 15:04:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:04:43,365 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:04:43,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:04:43,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:04:43,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:04:43,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:04:43,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:04:43,367 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand 6 states. [2018-11-23 15:04:43,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:04:43,929 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-11-23 15:04:43,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:04:43,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 15:04:43,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:04:43,930 INFO L225 Difference]: With dead ends: 168 [2018-11-23 15:04:43,930 INFO L226 Difference]: Without dead ends: 168 [2018-11-23 15:04:43,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:04:43,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-23 15:04:43,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 130. [2018-11-23 15:04:43,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-23 15:04:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2018-11-23 15:04:43,936 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 19 [2018-11-23 15:04:43,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:04:43,936 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2018-11-23 15:04:43,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:04:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2018-11-23 15:04:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 15:04:43,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:04:43,937 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:04:43,937 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2018-11-23 15:04:43,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:04:43,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1974844036, now seen corresponding path program 1 times [2018-11-23 15:04:43,937 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:04:43,938 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:04:43,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:04:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:04:44,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:04:44,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:04:44,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:44,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:44,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 15:04:44,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 15:04:44,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 15:04:44,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:44,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:44,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 15:04:44,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 15:04:44,059 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:44,061 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:44,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:44,067 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:19 [2018-11-23 15:04:44,077 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 15 treesize of output 11 [2018-11-23 15:04:44,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 15:04:44,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:44,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:44,091 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 15 [2018-11-23 15:04:44,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-23 15:04:44,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:44,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:44,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:44,098 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-11-23 15:04:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:04:44,114 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:04:44,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:04:44,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:04:44,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:04:44,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:04:44,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:04:44,117 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand 6 states. [2018-11-23 15:04:44,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:04:44,662 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-11-23 15:04:44,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:04:44,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 15:04:44,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:04:44,664 INFO L225 Difference]: With dead ends: 181 [2018-11-23 15:04:44,664 INFO L226 Difference]: Without dead ends: 181 [2018-11-23 15:04:44,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:04:44,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-23 15:04:44,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 127. [2018-11-23 15:04:44,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 15:04:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2018-11-23 15:04:44,668 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 19 [2018-11-23 15:04:44,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:04:44,669 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2018-11-23 15:04:44,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:04:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2018-11-23 15:04:44,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 15:04:44,669 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:04:44,669 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] [2018-11-23 15:04:44,670 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2018-11-23 15:04:44,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:04:44,670 INFO L82 PathProgramCache]: Analyzing trace with hash 415286056, now seen corresponding path program 1 times [2018-11-23 15:04:44,670 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:04:44,670 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:04:44,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:04:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:04:44,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:04:44,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:04:44,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:44,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:44,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 15:04:44,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:04:44,759 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:04:44,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:04:44,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:04:44,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:04:44,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:04:44,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:04:44,761 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand 3 states. [2018-11-23 15:04:44,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:04:44,917 INFO L93 Difference]: Finished difference Result 131 states and 150 transitions. [2018-11-23 15:04:44,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:04:44,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 15:04:44,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:04:44,918 INFO L225 Difference]: With dead ends: 131 [2018-11-23 15:04:44,918 INFO L226 Difference]: Without dead ends: 131 [2018-11-23 15:04:44,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:04:44,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-23 15:04:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2018-11-23 15:04:44,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 15:04:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 140 transitions. [2018-11-23 15:04:44,922 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 140 transitions. Word has length 24 [2018-11-23 15:04:44,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:04:44,922 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 140 transitions. [2018-11-23 15:04:44,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:04:44,922 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 140 transitions. [2018-11-23 15:04:44,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 15:04:44,923 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:04:44,923 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] [2018-11-23 15:04:44,923 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2018-11-23 15:04:44,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:04:44,923 INFO L82 PathProgramCache]: Analyzing trace with hash 415286057, now seen corresponding path program 1 times [2018-11-23 15:04:44,924 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:04:44,924 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:04:44,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:04:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:04:45,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:04:45,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:04:45,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:45,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:45,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 15:04:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:04:45,038 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:04:45,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:04:45,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:04:45,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:04:45,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:04:45,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:04:45,041 INFO L87 Difference]: Start difference. First operand 122 states and 140 transitions. Second operand 3 states. [2018-11-23 15:04:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:04:45,219 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2018-11-23 15:04:45,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:04:45,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 15:04:45,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:04:45,220 INFO L225 Difference]: With dead ends: 126 [2018-11-23 15:04:45,220 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 15:04:45,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:04:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 15:04:45,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 117. [2018-11-23 15:04:45,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 15:04:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2018-11-23 15:04:45,223 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 24 [2018-11-23 15:04:45,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:04:45,223 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2018-11-23 15:04:45,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:04:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2018-11-23 15:04:45,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 15:04:45,224 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:04:45,224 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] [2018-11-23 15:04:45,224 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2018-11-23 15:04:45,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:04:45,224 INFO L82 PathProgramCache]: Analyzing trace with hash -341986192, now seen corresponding path program 1 times [2018-11-23 15:04:45,225 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:04:45,225 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:04:45,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:04:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:04:45,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:04:45,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:04:45,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:45,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:04:45,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:45,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:45,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-23 15:04:45,373 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:45,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:45,374 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-11-23 15:04:45,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:45,384 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 12 treesize of output 15 [2018-11-23 15:04:45,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:45,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:45,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:18 [2018-11-23 15:04:45,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:45,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:45,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 15:04:45,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:45,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 15:04:45,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:45,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:04:45,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-11-23 15:04:45,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:04:45,539 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:04:45,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:04:45,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 15:04:45,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 15:04:45,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 15:04:45,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 15:04:45,542 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 8 states. [2018-11-23 15:04:46,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:04:46,681 INFO L93 Difference]: Finished difference Result 199 states and 219 transitions. [2018-11-23 15:04:46,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:04:46,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 15:04:46,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:04:46,684 INFO L225 Difference]: With dead ends: 199 [2018-11-23 15:04:46,684 INFO L226 Difference]: Without dead ends: 199 [2018-11-23 15:04:46,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-23 15:04:46,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-23 15:04:46,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 149. [2018-11-23 15:04:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-23 15:04:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 183 transitions. [2018-11-23 15:04:46,688 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 183 transitions. Word has length 26 [2018-11-23 15:04:46,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:04:46,688 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 183 transitions. [2018-11-23 15:04:46,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 15:04:46,689 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 183 transitions. [2018-11-23 15:04:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 15:04:46,689 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:04:46,689 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] [2018-11-23 15:04:46,689 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2018-11-23 15:04:46,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:04:46,690 INFO L82 PathProgramCache]: Analyzing trace with hash -2011636715, now seen corresponding path program 1 times [2018-11-23 15:04:46,690 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:04:46,690 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:04:46,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:04:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:04:46,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:04:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:04:46,774 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:04:46,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:04:46,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:04:46,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:04:46,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:04:46,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:04:46,776 INFO L87 Difference]: Start difference. First operand 149 states and 183 transitions. Second operand 4 states. [2018-11-23 15:04:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:04:46,960 INFO L93 Difference]: Finished difference Result 228 states and 274 transitions. [2018-11-23 15:04:46,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:04:46,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 15:04:46,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:04:46,961 INFO L225 Difference]: With dead ends: 228 [2018-11-23 15:04:46,962 INFO L226 Difference]: Without dead ends: 228 [2018-11-23 15:04:46,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:04:46,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-11-23 15:04:46,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2018-11-23 15:04:46,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-23 15:04:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 181 transitions. [2018-11-23 15:04:46,965 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 181 transitions. Word has length 27 [2018-11-23 15:04:46,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:04:46,965 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 181 transitions. [2018-11-23 15:04:46,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:04:46,965 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 181 transitions. [2018-11-23 15:04:46,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 15:04:46,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:04:46,966 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] [2018-11-23 15:04:46,966 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2018-11-23 15:04:46,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:04:46,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1005661135, now seen corresponding path program 1 times [2018-11-23 15:04:46,966 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:04:46,966 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:04:46,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:04:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:04:47,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:04:47,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:04:47,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 15:04:47,096 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-11-23 15:04:47,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, 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-11-23 15:04:47,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,116 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-11-23 15:04:47,119 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-11-23 15:04:47,119 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,128 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-11-23 15:04:47,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:47,151 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:47,151 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-11-23 15:04:47,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:26 [2018-11-23 15:04:47,184 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 21 treesize of output 16 [2018-11-23 15:04:47,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:47,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 15:04:47,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,234 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 21 treesize of output 16 [2018-11-23 15:04:47,237 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:47,239 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-11-23 15:04:47,240 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,247 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,261 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:35 [2018-11-23 15:04:47,324 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:47,347 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 44 treesize of output 45 [2018-11-23 15:04:47,351 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-11-23 15:04:47,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,410 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 29 treesize of output 34 [2018-11-23 15:04:47,414 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 20 treesize of output 19 [2018-11-23 15:04:47,415 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:82, output treesize:40 [2018-11-23 15:04:47,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:47,464 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 38 treesize of output 39 [2018-11-23 15:04:47,468 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-11-23 15:04:47,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,514 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 28 [2018-11-23 15:04:47,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 15:04:47,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,545 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2018-11-23 15:04:47,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:47,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:47,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 15:04:47,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:59 [2018-11-23 15:04:47,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2018-11-23 15:04:47,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:47,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 15:04:47,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 44 [2018-11-23 15:04:47,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:47,770 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 31 [2018-11-23 15:04:47,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:47,811 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:63 [2018-11-23 15:04:48,004 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:48,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 98 [2018-11-23 15:04:48,075 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 75 treesize of output 74 [2018-11-23 15:04:48,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:48,373 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 56 treesize of output 73 [2018-11-23 15:04:48,373 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 15:04:48,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:04:48,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:48,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 102 [2018-11-23 15:04:48,544 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 104 treesize of output 88 [2018-11-23 15:04:48,544 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:48,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:48,826 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 4 case distinctions, treesize of input 71 treesize of output 79 [2018-11-23 15:04:48,826 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-23 15:04:48,906 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 15:04:48,910 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:48,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 84 [2018-11-23 15:04:48,940 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:48,940 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:04:48,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2018-11-23 15:04:48,952 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:48,981 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:49,063 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 3 xjuncts. [2018-11-23 15:04:49,064 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:117, output treesize:175 [2018-11-23 15:04:49,225 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-23 15:04:49,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 141 [2018-11-23 15:04:49,301 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 118 treesize of output 117 [2018-11-23 15:04:49,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:49,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:51,351 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 81 treesize of output 76 [2018-11-23 15:04:51,357 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:51,358 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 22 treesize of output 35 [2018-11-23 15:04:51,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:51,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:52,345 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:52,358 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 71 [2018-11-23 15:04:52,365 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 26 treesize of output 14 [2018-11-23 15:04:52,365 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:52,391 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:52,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 104 [2018-11-23 15:04:52,853 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 106 treesize of output 105 [2018-11-23 15:04:52,854 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:53,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:53,067 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 79 treesize of output 92 [2018-11-23 15:04:53,068 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-23 15:04:53,181 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:04:53,540 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 55 treesize of output 56 [2018-11-23 15:04:53,543 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-11-23 15:04:53,543 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:53,560 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:53,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:04:53,712 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:253, output treesize:153 [2018-11-23 15:04:53,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 126 [2018-11-23 15:04:53,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:53,930 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:54,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 128 [2018-11-23 15:04:54,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 15:04:54,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:54,558 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 135 treesize of output 150 [2018-11-23 15:04:54,558 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:54,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:04:55,463 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 94 treesize of output 81 [2018-11-23 15:04:55,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:55,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 31 [2018-11-23 15:04:55,468 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:55,495 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:55,931 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 86 treesize of output 76 [2018-11-23 15:04:55,935 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:55,936 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 31 [2018-11-23 15:04:55,936 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:55,955 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:56,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 162 [2018-11-23 15:04:56,328 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:56,329 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 139 treesize of output 154 [2018-11-23 15:04:56,329 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:56,521 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:56,530 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 89 treesize of output 76 [2018-11-23 15:04:56,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:56,535 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 31 [2018-11-23 15:04:56,535 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:56,563 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:56,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-23 15:04:56,738 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:251, output treesize:289 [2018-11-23 15:04:57,126 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2018-11-23 15:04:57,289 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 85 treesize of output 68 [2018-11-23 15:04:57,292 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:57,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 15:04:57,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:57,312 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 24 [2018-11-23 15:04:57,313 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:04:57,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:04:57,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-23 15:04:57,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 15:04:57,400 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:57,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:57,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 15:04:57,414 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:57,419 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:57,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 129 [2018-11-23 15:04:57,493 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 125 treesize of output 118 [2018-11-23 15:04:57,494 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:57,611 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 102 [2018-11-23 15:04:57,611 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:57,699 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:57,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 102 treesize of output 89 [2018-11-23 15:04:57,704 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:57,799 INFO L267 ElimStorePlain]: Start of recursive call 8: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:57,854 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 63 [2018-11-23 15:04:57,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:57,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:57,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 54 [2018-11-23 15:04:57,885 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-23 15:04:57,958 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 30 treesize of output 21 [2018-11-23 15:04:57,958 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:57,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2018-11-23 15:04:57,960 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:58,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:58,014 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-11-23 15:04:58,014 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:58,049 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 32 treesize of output 23 [2018-11-23 15:04:58,050 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:58,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:04:58,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 15:04:58,078 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 15:04:58,087 INFO L267 ElimStorePlain]: Start of recursive call 12: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:58,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:04:58,092 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 9 variables, input treesize:225, output treesize:7 [2018-11-23 15:04:58,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:04:58,170 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:04:58,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:04:58,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-23 15:04:58,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 15:04:58,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 15:04:58,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=285, Unknown=5, NotChecked=0, Total=342 [2018-11-23 15:04:58,172 INFO L87 Difference]: Start difference. First operand 149 states and 181 transitions. Second operand 19 states. [2018-11-23 15:05:15,683 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2018-11-23 15:05:18,029 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-11-23 15:05:18,776 WARN L180 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2018-11-23 15:05:21,087 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2018-11-23 15:05:21,863 WARN L180 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 118 [2018-11-23 15:05:23,167 WARN L180 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 122 [2018-11-23 15:05:26,384 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-23 15:05:27,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:05:27,851 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2018-11-23 15:05:27,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 15:05:27,852 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-11-23 15:05:27,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:05:27,852 INFO L225 Difference]: With dead ends: 160 [2018-11-23 15:05:27,852 INFO L226 Difference]: Without dead ends: 160 [2018-11-23 15:05:27,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=245, Invalid=1081, Unknown=6, NotChecked=0, Total=1332 [2018-11-23 15:05:27,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-23 15:05:27,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 130. [2018-11-23 15:05:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-23 15:05:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2018-11-23 15:05:27,855 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 30 [2018-11-23 15:05:27,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:05:27,855 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2018-11-23 15:05:27,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 15:05:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2018-11-23 15:05:27,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 15:05:27,856 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:05:27,856 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-11-23 15:05:27,856 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2018-11-23 15:05:27,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:05:27,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1346897253, now seen corresponding path program 1 times [2018-11-23 15:05:27,857 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:05:27,857 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:05:27,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:05:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:05:27,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:05:28,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:05:28,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:28,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:05:28,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:28,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:05:28,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-23 15:05:28,037 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:28,038 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 12 treesize of output 15 [2018-11-23 15:05:28,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:28,048 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:28,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:28,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 15:05:28,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:28,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:05:28,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:18 [2018-11-23 15:05:28,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:28,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 15:05:28,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:28,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:28,111 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:28,112 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 19 treesize of output 23 [2018-11-23 15:05:28,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:28,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:05:28,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:38 [2018-11-23 15:05:28,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:28,184 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:05:28,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 15:05:28,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:28,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:28,207 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 17 treesize of output 34 [2018-11-23 15:05:28,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:28,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 15:05:28,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:23 [2018-11-23 15:05:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:05:28,268 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:05:28,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:05:28,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 15:05:28,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 15:05:28,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:05:28,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:05:28,270 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand 9 states. [2018-11-23 15:05:29,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:05:29,405 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2018-11-23 15:05:29,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:05:29,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-23 15:05:29,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:05:29,407 INFO L225 Difference]: With dead ends: 203 [2018-11-23 15:05:29,407 INFO L226 Difference]: Without dead ends: 203 [2018-11-23 15:05:29,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 15:05:29,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-23 15:05:29,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 161. [2018-11-23 15:05:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-23 15:05:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 193 transitions. [2018-11-23 15:05:29,410 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 193 transitions. Word has length 32 [2018-11-23 15:05:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:05:29,411 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 193 transitions. [2018-11-23 15:05:29,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 15:05:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 193 transitions. [2018-11-23 15:05:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 15:05:29,411 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:05:29,411 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, 1, 1, 1, 1, 1] [2018-11-23 15:05:29,412 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2018-11-23 15:05:29,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:05:29,412 INFO L82 PathProgramCache]: Analyzing trace with hash -731762077, now seen corresponding path program 1 times [2018-11-23 15:05:29,412 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:05:29,412 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97ec05c7-5c7b-4ba0-b0a6-436536837a4e/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:05:29,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:05:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:05:29,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:05:29,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:05:29,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:29,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:05:29,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 15:05:29,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:29,562 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:29,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 15:05:29,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:29,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:05:29,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-23 15:05:29,575 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-11-23 15:05:29,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 15:05:29,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:29,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:05:29,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:05:29,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-11-23 15:05:29,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:29,633 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 35 treesize of output 36 [2018-11-23 15:05:29,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 16 treesize of output 1 [2018-11-23 15:05:29,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:29,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:05:29,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:05:29,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:22 [2018-11-23 15:05:29,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:29,669 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 29 treesize of output 30 [2018-11-23 15:05:29,671 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-11-23 15:05:29,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:29,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:05:29,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:05:29,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:31 [2018-11-23 15:05:29,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:29,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:29,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 15:05:29,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:29,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:05:29,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:28 [2018-11-23 15:05:29,776 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-23 15:05:29,780 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:29,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 15:05:29,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:29,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:05:29,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:05:29,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-11-23 15:05:29,925 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:29,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 82 [2018-11-23 15:05:29,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 68 [2018-11-23 15:05:29,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:30,099 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:30,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 59 [2018-11-23 15:05:30,345 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-23 15:05:30,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 15:05:30,484 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 3 xjuncts. [2018-11-23 15:05:30,484 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:78, output treesize:122 [2018-11-23 15:05:30,627 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 46 treesize of output 41 [2018-11-23 15:05:30,631 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 9 [2018-11-23 15:05:30,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:30,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:05:30,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 71 [2018-11-23 15:05:30,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:30,906 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 54 treesize of output 69 [2018-11-23 15:05:30,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 15:05:31,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-11-23 15:05:31,082 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:31,170 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:05:31,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:05:31,222 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:155, output treesize:92 [2018-11-23 15:05:31,328 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 55 treesize of output 45 [2018-11-23 15:05:31,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:31,332 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 31 [2018-11-23 15:05:31,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:31,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:05:31,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 80 [2018-11-23 15:05:31,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:31,479 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 87 treesize of output 102 [2018-11-23 15:05:31,479 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:31,607 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:31,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:31,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 76 [2018-11-23 15:05:31,664 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-23 15:05:31,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:05:31,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-23 15:05:31,956 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:148, output treesize:175 [2018-11-23 15:05:32,203 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-23 15:05:32,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:32,214 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:32,214 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 62 treesize of output 74 [2018-11-23 15:05:32,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:32,308 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 64 treesize of output 63 [2018-11-23 15:05:32,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:32,312 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 95 treesize of output 94 [2018-11-23 15:05:32,312 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:32,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:32,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:32,396 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 94 treesize of output 106 [2018-11-23 15:05:32,396 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:32,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 15:05:32,474 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:158, output treesize:160 [2018-11-23 15:05:32,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 113 treesize of output 122 [2018-11-23 15:05:32,723 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 15:05:32,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:33,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:05:34,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 91 [2018-11-23 15:05:34,539 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:05:35,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 107 [2018-11-23 15:05:35,078 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:35,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 15:05:35,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 85 [2018-11-23 15:05:35,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 68 [2018-11-23 15:05:35,767 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:05:35,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2018-11-23 15:05:35,948 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:36,012 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:05:36,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2018-11-23 15:05:36,299 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:194, output treesize:439 [2018-11-23 15:05:36,817 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 98 [2018-11-23 15:05:36,837 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 69 treesize of output 64 [2018-11-23 15:05:36,841 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:36,843 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 22 treesize of output 14 [2018-11-23 15:05:36,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:36,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:05:37,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 126 treesize of output 133 [2018-11-23 15:05:37,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:37,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 109 [2018-11-23 15:05:37,791 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:05:38,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:38,864 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:38,980 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 130 [2018-11-23 15:05:38,980 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-23 15:05:40,589 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:05:41,334 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:41,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 115 [2018-11-23 15:05:41,338 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:41,733 INFO L267 ElimStorePlain]: Start of recursive call 4: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-23 15:05:43,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 96 [2018-11-23 15:05:43,211 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:43,214 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 94 treesize of output 86 [2018-11-23 15:05:43,214 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:43,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:43,357 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 3 case distinctions, treesize of input 75 treesize of output 72 [2018-11-23 15:05:43,357 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:05:43,423 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:05:44,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 88 [2018-11-23 15:05:44,548 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:44,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 15:05:44,550 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:44,581 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:05:45,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-2 vars, End of recursive call: 25 dim-0 vars, and 9 xjuncts. [2018-11-23 15:05:45,500 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 16 variables, input treesize:383, output treesize:787 [2018-11-23 15:05:46,480 WARN L180 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 186 [2018-11-23 15:05:47,000 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-11-23 15:05:47,035 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 15:05:47,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:47,297 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:47,298 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:47,299 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 82 [2018-11-23 15:05:47,299 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:05:47,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:47,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:47,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 115 [2018-11-23 15:05:47,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:05:48,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:48,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:48,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 103 [2018-11-23 15:05:48,023 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:05:48,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 19 dim-0 vars, 7 dim-1 vars, End of recursive call: 12 dim-0 vars, and 3 xjuncts. [2018-11-23 15:05:48,371 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 26 variables, input treesize:584, output treesize:289 [2018-11-23 15:05:49,916 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2018-11-23 15:05:49,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2018-11-23 15:05:49,940 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-11-23 15:05:49,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:49,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:49,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 15:05:49,977 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:49,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-11-23 15:05:49,991 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:49,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:05:50,154 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 87 [2018-11-23 15:05:50,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:50,164 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2018-11-23 15:05:50,164 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:50,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2018-11-23 15:05:50,401 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:50,595 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:50,595 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 42 treesize of output 31 [2018-11-23 15:05:50,596 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:50,708 INFO L267 ElimStorePlain]: Start of recursive call 6: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:05:50,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 59 [2018-11-23 15:05:50,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 15:05:50,779 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:50,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:05:50,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-23 15:05:50,805 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:05:50,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-23 15:05:50,822 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 15:05:50,831 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:05:50,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-23 15:05:50,862 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 15 variables, input treesize:280, output treesize:52 [2018-11-23 15:05:51,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:05:51,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:05:51,396 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:05:51,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:05:51,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:05:51,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:28 [2018-11-23 15:05:55,802 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 12 treesize of output 10 [2018-11-23 15:05:55,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:05:55,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-11-23 15:05:55,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:77 [2018-11-23 15:06:14,568 WARN L180 SmtUtils]: Spent 8.23 s on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-11-23 15:06:45,117 WARN L180 SmtUtils]: Spent 4.77 s on a formula simplification that was a NOOP. DAG size: 53 [2018-11-23 15:07:00,207 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-23 15:07:00,632 WARN L180 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2018-11-23 15:07:00,633 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:07:00,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:07:00,655 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:07:00,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:07:00,674 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:07:00,708 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:07:01,108 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:07:01,140 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:07:01,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 17 dim-0 vars, and 4 xjuncts. [2018-11-23 15:07:01,455 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:152, output treesize:249 [2018-11-23 15:08:26,182 WARN L180 SmtUtils]: Spent 1.04 m on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2018-11-23 15:08:50,571 WARN L180 SmtUtils]: Spent 6.16 s on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2018-11-23 15:09:22,042 WARN L180 SmtUtils]: Spent 6.85 s on a formula simplification that was a NOOP. DAG size: 67 [2018-11-23 15:09:22,408 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2018-11-23 15:09:22,412 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:09:22,412 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:09:22,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:09:22,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 82 [2018-11-23 15:09:22,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:22,544 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:09:22,544 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:09:22,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:09:22,548 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 157 [2018-11-23 15:09:22,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:22,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2018-11-23 15:09:22,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:159, output treesize:240 [2018-11-23 15:09:23,872 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2018-11-23 15:09:51,643 WARN L180 SmtUtils]: Spent 4.35 s on a formula simplification that was a NOOP. DAG size: 53 [2018-11-23 15:09:53,656 WARN L832 $PredicateComparison]: unable to prove that (and (or (forall ((v_prenex_87 (_ BitVec 32))) (not (= (select |c_#valid| v_prenex_87) (_ bv0 1)))) (not (bvsle (bvadd c_main_~bucket~0.offset (_ bv12 32)) (_ bv8 32))) (= c_main_~bucket~0.base c_main_~bcki~0.base)) (forall ((v_prenex_76 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_main_~item~0.base_31 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_prenex_77 (_ BitVec 32)) (|v_main_#t~malloc3.base_3| (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_main_~bcki~0.base (store (store (select |c_#memory_$Pointer$.base| c_main_~bcki~0.base) (bvadd c_main_~bcki~0.offset (_ bv4 32)) (_ bv0 32)) c_main_~bcki~0.offset |v_main_#t~malloc3.base_3|)))) (let ((.cse2 (store (store (store (select .cse1 |v_main_#t~malloc3.base_3|) (bvadd v_subst_2 (_ bv8 32)) v_DerPreprocessor_12) (bvadd v_subst_2 (_ bv4 32)) (_ bv0 32)) v_subst_2 (_ bv0 32)))) (store (store .cse1 |v_main_#t~malloc3.base_3| .cse2) v_main_~item~0.base_31 (store (store .cse2 v_prenex_77 (_ bv0 32)) (bvadd v_prenex_77 (_ bv4 32)) v_prenex_76)))) c_main_~bucket~0.base) c_main_~bucket~0.offset))) (or (= v_main_~item~0.base_31 c_main_~bcki~0.base) (not (= (select |c_#valid| |v_main_#t~malloc3.base_3|) (_ bv0 1))) (= .cse0 v_main_~item~0.base_31) (= .cse0 c_main_~bcki~0.base) (= v_main_~item~0.base_31 c_main_~bucket~0.base))))) is different from false [2018-11-23 15:09:54,161 WARN L180 SmtUtils]: Spent 495.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-23 15:09:54,162 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:09:54,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:09:54,466 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:09:54,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:09:54,523 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:09:54,690 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:09:57,709 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:57,719 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:10:00,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 24 dim-0 vars, and 4 xjuncts. [2018-11-23 15:10:00,438 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:250, output treesize:759 [2018-11-23 15:11:01,260 WARN L180 SmtUtils]: Spent 16.75 s on a formula simplification that was a NOOP. DAG size: 142 [2018-11-23 15:11:52,821 WARN L180 SmtUtils]: Spent 18.77 s on a formula simplification that was a NOOP. DAG size: 142 [2018-11-23 15:12:27,633 WARN L180 SmtUtils]: Spent 14.23 s on a formula simplification that was a NOOP. DAG size: 143 [2018-11-23 15:12:27,655 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:12:27,655 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:12:27,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 547 treesize of output 538 [2018-11-23 15:12:27,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:12:30,159 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:12:30,160 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:12:30,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 281 [2018-11-23 15:12:30,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:12:30,915 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:12:30,915 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:12:30,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-23 15:12:30,916 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:12:33,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 281 treesize of output 194 [2018-11-23 15:12:33,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 15:12:33,333 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:12:33,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:12:33,406 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:12:33,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 159 [2018-11-23 15:12:33,669 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 80 [2018-11-23 15:12:33,671 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-11-23 15:12:34,100 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 137 treesize of output 126 [2018-11-23 15:12:34,106 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 95 treesize of output 83 [2018-11-23 15:12:34,112 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:12:34,119 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 78 [2018-11-23 15:12:34,126 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:12:34,127 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:12:34,128 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:12:34,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 82 [2018-11-23 15:12:34,157 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:12:34,157 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:12:34,164 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:12:34,430 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:12:34,431 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_8 input size 44 context size 44 output size 44 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) 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-11-23 15:12:34,433 INFO L168 Benchmark]: Toolchain (without parser) took 474797.77 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.3 MB). Free memory was 945.4 MB in the beginning and 1.0 GB in the end (delta: -96.3 MB). Peak memory consumption was 212.0 MB. Max. memory is 11.5 GB. [2018-11-23 15:12:34,433 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:12:34,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 945.4 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. [2018-11-23 15:12:34,434 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:12:34,434 INFO L168 Benchmark]: Boogie Preprocessor took 25.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:12:34,434 INFO L168 Benchmark]: RCFGBuilder took 605.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.4 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:12:34,434 INFO L168 Benchmark]: TraceAbstraction took 473744.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 247.2 kB). Peak memory consumption was 179.6 MB. Max. memory is 11.5 GB. [2018-11-23 15:12:34,435 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 400.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 945.4 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.27 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 605.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.4 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 473744.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 247.2 kB). Peak memory consumption was 179.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_8 input size 44 context size 44 output size 44 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_8 input size 44 context size 44 output size 44: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...