./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety-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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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_9395824f-c7b9-4460-947e-03caee15622a/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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_9395824f-c7b9-4460-947e-03caee15622a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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_9395824f-c7b9-4460-947e-03caee15622a/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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_arrayElimCell_92 term size 22 --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:18:54,191 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:18:54,192 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:18:54,200 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:18:54,201 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:18:54,201 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:18:54,202 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:18:54,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:18:54,204 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:18:54,205 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:18:54,205 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:18:54,206 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:18:54,206 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:18:54,207 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:18:54,208 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:18:54,208 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:18:54,209 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:18:54,210 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:18:54,212 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:18:54,213 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:18:54,213 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:18:54,214 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:18:54,216 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:18:54,216 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:18:54,216 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:18:54,217 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:18:54,217 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:18:54,218 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:18:54,218 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:18:54,219 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:18:54,219 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:18:54,220 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:18:54,220 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:18:54,220 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:18:54,221 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:18:54,221 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:18:54,222 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2018-11-18 10:18:54,232 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:18:54,233 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:18:54,233 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 10:18:54,233 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 10:18:54,234 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 10:18:54,234 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 10:18:54,234 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 10:18:54,234 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 10:18:54,234 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 10:18:54,234 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 10:18:54,234 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 10:18:54,235 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 10:18:54,235 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 10:18:54,235 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:18:54,235 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:18:54,236 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:18:54,236 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:18:54,236 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:18:54,236 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:18:54,236 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:18:54,236 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:18:54,236 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-18 10:18:54,237 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-18 10:18:54,237 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 10:18:54,237 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:18:54,237 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:18:54,237 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:18:54,237 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:18:54,237 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 10:18:54,238 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 10:18:54,238 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:18:54,238 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:18:54,238 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 10:18:54,238 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 10:18:54,238 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 10:18:54,238 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 10:18:54,239 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_9395824f-c7b9-4460-947e-03caee15622a/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-18 10:18:54,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:18:54,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:18:54,273 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:18:54,274 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:18:54,275 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:18:54,275 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/sll-buckets_false-unreach-call_false-valid-memcleanup.i [2018-11-18 10:18:54,316 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/bin-2019/utaipan/data/de58788a6/ea595cee769b4a29b4d7e5a8e408c2c8/FLAGb3c2d280f [2018-11-18 10:18:54,771 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:18:54,771 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/sv-benchmarks/c/forester-heap/sll-buckets_false-unreach-call_false-valid-memcleanup.i [2018-11-18 10:18:54,780 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/bin-2019/utaipan/data/de58788a6/ea595cee769b4a29b4d7e5a8e408c2c8/FLAGb3c2d280f [2018-11-18 10:18:54,789 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/bin-2019/utaipan/data/de58788a6/ea595cee769b4a29b4d7e5a8e408c2c8 [2018-11-18 10:18:54,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:18:54,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:18:54,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:18:54,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:18:54,795 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:18:54,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:18:54" (1/1) ... [2018-11-18 10:18:54,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d1e80f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:54, skipping insertion in model container [2018-11-18 10:18:54,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:18:54" (1/1) ... [2018-11-18 10:18:54,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:18:54,831 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:18:55,018 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:18:55,025 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:18:55,053 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:18:55,130 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:18:55,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:55 WrapperNode [2018-11-18 10:18:55,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:18:55,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:18:55,131 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:18:55,131 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:18:55,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:55" (1/1) ... [2018-11-18 10:18:55,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:55" (1/1) ... [2018-11-18 10:18:55,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:18:55,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:18:55,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:18:55,149 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:18:55,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:55" (1/1) ... [2018-11-18 10:18:55,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:55" (1/1) ... [2018-11-18 10:18:55,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:55" (1/1) ... [2018-11-18 10:18:55,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:55" (1/1) ... [2018-11-18 10:18:55,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:55" (1/1) ... [2018-11-18 10:18:55,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:55" (1/1) ... [2018-11-18 10:18:55,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:55" (1/1) ... [2018-11-18 10:18:55,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:18:55,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:18:55,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:18:55,174 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:18:55,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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-18 10:18:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 10:18:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 10:18:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 10:18:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 10:18:55,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 10:18:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 10:18:55,207 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 10:18:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 10:18:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 10:18:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 10:18:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:18:55,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:18:55,600 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:18:55,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:18:55 BoogieIcfgContainer [2018-11-18 10:18:55,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:18:55,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 10:18:55,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 10:18:55,603 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 10:18:55,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:18:54" (1/3) ... [2018-11-18 10:18:55,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a93d182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:18:55, skipping insertion in model container [2018-11-18 10:18:55,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:55" (2/3) ... [2018-11-18 10:18:55,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a93d182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:18:55, skipping insertion in model container [2018-11-18 10:18:55,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:18:55" (3/3) ... [2018-11-18 10:18:55,605 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets_false-unreach-call_false-valid-memcleanup.i [2018-11-18 10:18:55,610 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 10:18:55,615 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-11-18 10:18:55,623 INFO L257 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2018-11-18 10:18:55,642 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 10:18:55,642 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-18 10:18:55,642 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 10:18:55,642 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:18:55,642 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:18:55,642 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 10:18:55,642 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:18:55,643 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 10:18:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2018-11-18 10:18:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 10:18:55,661 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:18:55,662 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:18:55,664 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2018-11-18 10:18:55,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:55,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1976719322, now seen corresponding path program 1 times [2018-11-18 10:18:55,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:18:55,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:55,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:18:55,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:55,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:18:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:55,759 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-18 10:18:55,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:18:55,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:18:55,761 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:18:55,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:18:55,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:18:55,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:18:55,773 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 3 states. [2018-11-18 10:18:55,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:18:55,927 INFO L93 Difference]: Finished difference Result 186 states and 195 transitions. [2018-11-18 10:18:55,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:18:55,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 10:18:55,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:18:55,934 INFO L225 Difference]: With dead ends: 186 [2018-11-18 10:18:55,934 INFO L226 Difference]: Without dead ends: 182 [2018-11-18 10:18:55,935 INFO L604 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-18 10:18:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-18 10:18:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 147. [2018-11-18 10:18:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-18 10:18:55,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 154 transitions. [2018-11-18 10:18:55,960 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 154 transitions. Word has length 7 [2018-11-18 10:18:55,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:18:55,960 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 154 transitions. [2018-11-18 10:18:55,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:18:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 154 transitions. [2018-11-18 10:18:55,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 10:18:55,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:18:55,961 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:18:55,961 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2018-11-18 10:18:55,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:55,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1976719321, now seen corresponding path program 1 times [2018-11-18 10:18:55,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:18:55,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:55,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:18:55,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:55,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:18:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:55,992 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-18 10:18:55,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:18:55,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:18:55,992 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:18:55,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:18:55,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:18:55,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:18:55,994 INFO L87 Difference]: Start difference. First operand 147 states and 154 transitions. Second operand 3 states. [2018-11-18 10:18:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:18:56,100 INFO L93 Difference]: Finished difference Result 182 states and 191 transitions. [2018-11-18 10:18:56,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:18:56,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 10:18:56,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:18:56,102 INFO L225 Difference]: With dead ends: 182 [2018-11-18 10:18:56,102 INFO L226 Difference]: Without dead ends: 182 [2018-11-18 10:18:56,102 INFO L604 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-18 10:18:56,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-18 10:18:56,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 143. [2018-11-18 10:18:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-18 10:18:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2018-11-18 10:18:56,110 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 7 [2018-11-18 10:18:56,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:18:56,110 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2018-11-18 10:18:56,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:18:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2018-11-18 10:18:56,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 10:18:56,110 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:18:56,111 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:18:56,111 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2018-11-18 10:18:56,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:56,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1084299085, now seen corresponding path program 1 times [2018-11-18 10:18:56,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:18:56,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:56,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:18:56,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:56,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:18:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:56,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-18 10:18:56,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:18:56,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:18:56,170 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:18:56,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:18:56,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:18:56,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:18:56,171 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand 6 states. [2018-11-18 10:18:56,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:18:56,414 INFO L93 Difference]: Finished difference Result 190 states and 199 transitions. [2018-11-18 10:18:56,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:18:56,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-18 10:18:56,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:18:56,416 INFO L225 Difference]: With dead ends: 190 [2018-11-18 10:18:56,416 INFO L226 Difference]: Without dead ends: 190 [2018-11-18 10:18:56,417 INFO L604 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-18 10:18:56,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-18 10:18:56,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 144. [2018-11-18 10:18:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-18 10:18:56,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2018-11-18 10:18:56,424 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 13 [2018-11-18 10:18:56,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:18:56,424 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2018-11-18 10:18:56,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:18:56,424 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2018-11-18 10:18:56,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 10:18:56,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:18:56,425 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:18:56,425 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2018-11-18 10:18:56,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:56,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1084299086, now seen corresponding path program 1 times [2018-11-18 10:18:56,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:18:56,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:56,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:18:56,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:56,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:18:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:56,487 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-18 10:18:56,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:18:56,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:18:56,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:18:56,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:18:56,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:18:56,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:18:56,488 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand 6 states. [2018-11-18 10:18:56,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:18:56,668 INFO L93 Difference]: Finished difference Result 198 states and 221 transitions. [2018-11-18 10:18:56,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:18:56,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-18 10:18:56,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:18:56,669 INFO L225 Difference]: With dead ends: 198 [2018-11-18 10:18:56,670 INFO L226 Difference]: Without dead ends: 198 [2018-11-18 10:18:56,670 INFO L604 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-18 10:18:56,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-18 10:18:56,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 140. [2018-11-18 10:18:56,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-18 10:18:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2018-11-18 10:18:56,674 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 13 [2018-11-18 10:18:56,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:18:56,674 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2018-11-18 10:18:56,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:18:56,674 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2018-11-18 10:18:56,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 10:18:56,675 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:18:56,675 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:18:56,675 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2018-11-18 10:18:56,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:56,676 INFO L82 PathProgramCache]: Analyzing trace with hash 273154676, now seen corresponding path program 1 times [2018-11-18 10:18:56,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:18:56,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:56,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:18:56,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:56,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:18:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:56,724 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-18 10:18:56,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:18:56,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:18:56,724 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:18:56,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:18:56,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:18:56,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:18:56,725 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 6 states. [2018-11-18 10:18:56,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:18:56,893 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2018-11-18 10:18:56,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:18:56,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-18 10:18:56,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:18:56,894 INFO L225 Difference]: With dead ends: 185 [2018-11-18 10:18:56,894 INFO L226 Difference]: Without dead ends: 185 [2018-11-18 10:18:56,894 INFO L604 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-18 10:18:56,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-18 10:18:56,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 139. [2018-11-18 10:18:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 10:18:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2018-11-18 10:18:56,897 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 19 [2018-11-18 10:18:56,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:18:56,897 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2018-11-18 10:18:56,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:18:56,897 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2018-11-18 10:18:56,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 10:18:56,898 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:18:56,898 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:18:56,898 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2018-11-18 10:18:56,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:56,898 INFO L82 PathProgramCache]: Analyzing trace with hash 273154677, now seen corresponding path program 1 times [2018-11-18 10:18:56,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:18:56,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:56,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:18:56,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:56,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:18:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:56,944 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-18 10:18:56,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:18:56,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:18:56,945 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:18:56,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:18:56,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:18:56,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:18:56,945 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand 6 states. [2018-11-18 10:18:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:18:57,074 INFO L93 Difference]: Finished difference Result 194 states and 217 transitions. [2018-11-18 10:18:57,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:18:57,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-18 10:18:57,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:18:57,075 INFO L225 Difference]: With dead ends: 194 [2018-11-18 10:18:57,075 INFO L226 Difference]: Without dead ends: 194 [2018-11-18 10:18:57,076 INFO L604 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-18 10:18:57,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-18 10:18:57,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 136. [2018-11-18 10:18:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-18 10:18:57,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2018-11-18 10:18:57,080 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 19 [2018-11-18 10:18:57,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:18:57,080 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2018-11-18 10:18:57,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:18:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2018-11-18 10:18:57,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 10:18:57,081 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:18:57,081 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:18:57,081 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2018-11-18 10:18:57,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:57,081 INFO L82 PathProgramCache]: Analyzing trace with hash -415932871, now seen corresponding path program 1 times [2018-11-18 10:18:57,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:18:57,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:57,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:18:57,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:57,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:18:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:57,131 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-18 10:18:57,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:18:57,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:18:57,131 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:18:57,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:18:57,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:18:57,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:18:57,132 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand 3 states. [2018-11-18 10:18:57,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:18:57,194 INFO L93 Difference]: Finished difference Result 144 states and 159 transitions. [2018-11-18 10:18:57,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:18:57,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 10:18:57,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:18:57,196 INFO L225 Difference]: With dead ends: 144 [2018-11-18 10:18:57,196 INFO L226 Difference]: Without dead ends: 144 [2018-11-18 10:18:57,196 INFO L604 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-18 10:18:57,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-18 10:18:57,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 131. [2018-11-18 10:18:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-18 10:18:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2018-11-18 10:18:57,199 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 26 [2018-11-18 10:18:57,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:18:57,200 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2018-11-18 10:18:57,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:18:57,200 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2018-11-18 10:18:57,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 10:18:57,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:18:57,200 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:18:57,201 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2018-11-18 10:18:57,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:57,201 INFO L82 PathProgramCache]: Analyzing trace with hash -415932870, now seen corresponding path program 1 times [2018-11-18 10:18:57,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:18:57,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:57,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:18:57,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:57,207 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:18:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:57,241 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-18 10:18:57,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:18:57,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:18:57,241 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:18:57,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:18:57,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:18:57,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:18:57,242 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand 3 states. [2018-11-18 10:18:57,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:18:57,304 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2018-11-18 10:18:57,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:18:57,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 10:18:57,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:18:57,305 INFO L225 Difference]: With dead ends: 139 [2018-11-18 10:18:57,305 INFO L226 Difference]: Without dead ends: 139 [2018-11-18 10:18:57,305 INFO L604 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-18 10:18:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-18 10:18:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 126. [2018-11-18 10:18:57,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-18 10:18:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2018-11-18 10:18:57,307 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 26 [2018-11-18 10:18:57,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:18:57,308 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2018-11-18 10:18:57,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:18:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2018-11-18 10:18:57,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 10:18:57,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:18:57,308 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:18:57,308 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2018-11-18 10:18:57,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:57,309 INFO L82 PathProgramCache]: Analyzing trace with hash -72988509, now seen corresponding path program 1 times [2018-11-18 10:18:57,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:18:57,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:57,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:18:57,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:57,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:18:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:57,399 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-18 10:18:57,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:18:57,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 10:18:57,400 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:18:57,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 10:18:57,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 10:18:57,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:18:57,401 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand 8 states. [2018-11-18 10:18:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:18:57,569 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2018-11-18 10:18:57,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:18:57,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-18 10:18:57,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:18:57,570 INFO L225 Difference]: With dead ends: 166 [2018-11-18 10:18:57,571 INFO L226 Difference]: Without dead ends: 166 [2018-11-18 10:18:57,571 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:18:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-18 10:18:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 130. [2018-11-18 10:18:57,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-18 10:18:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2018-11-18 10:18:57,573 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 29 [2018-11-18 10:18:57,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:18:57,574 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2018-11-18 10:18:57,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 10:18:57,574 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2018-11-18 10:18:57,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 10:18:57,575 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:18:57,575 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:18:57,575 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2018-11-18 10:18:57,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:57,576 INFO L82 PathProgramCache]: Analyzing trace with hash -72988508, now seen corresponding path program 1 times [2018-11-18 10:18:57,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:18:57,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:57,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:18:57,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:57,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:18:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:57,749 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-18 10:18:57,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:18:57,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:18:57,750 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:18:57,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 10:18:57,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:18:57,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:18:57,750 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand 7 states. [2018-11-18 10:18:57,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:18:57,958 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2018-11-18 10:18:57,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:18:57,964 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-11-18 10:18:57,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:18:57,965 INFO L225 Difference]: With dead ends: 212 [2018-11-18 10:18:57,965 INFO L226 Difference]: Without dead ends: 212 [2018-11-18 10:18:57,966 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:18:57,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-18 10:18:57,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 172. [2018-11-18 10:18:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-18 10:18:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 203 transitions. [2018-11-18 10:18:57,969 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 203 transitions. Word has length 29 [2018-11-18 10:18:57,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:18:57,969 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 203 transitions. [2018-11-18 10:18:57,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 10:18:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 203 transitions. [2018-11-18 10:18:57,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 10:18:57,970 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:18:57,970 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:18:57,971 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2018-11-18 10:18:57,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:57,971 INFO L82 PathProgramCache]: Analyzing trace with hash 2032324365, now seen corresponding path program 1 times [2018-11-18 10:18:57,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:18:57,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:57,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:18:57,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:57,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:18:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:58,003 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-18 10:18:58,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:18:58,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:18:58,003 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:18:58,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:18:58,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:18:58,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:18:58,004 INFO L87 Difference]: Start difference. First operand 172 states and 203 transitions. Second operand 4 states. [2018-11-18 10:18:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:18:58,070 INFO L93 Difference]: Finished difference Result 207 states and 233 transitions. [2018-11-18 10:18:58,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:18:58,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-18 10:18:58,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:18:58,072 INFO L225 Difference]: With dead ends: 207 [2018-11-18 10:18:58,072 INFO L226 Difference]: Without dead ends: 207 [2018-11-18 10:18:58,072 INFO L604 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-18 10:18:58,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-18 10:18:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 172. [2018-11-18 10:18:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-18 10:18:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 202 transitions. [2018-11-18 10:18:58,076 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 202 transitions. Word has length 30 [2018-11-18 10:18:58,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:18:58,076 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 202 transitions. [2018-11-18 10:18:58,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:18:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 202 transitions. [2018-11-18 10:18:58,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 10:18:58,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:18:58,077 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:18:58,077 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2018-11-18 10:18:58,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:58,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1500137784, now seen corresponding path program 1 times [2018-11-18 10:18:58,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:18:58,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:58,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:18:58,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:58,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:18:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:58,345 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-18 10:18:58,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:18:58,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-18 10:18:58,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:18:58,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 10:18:58,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 10:18:58,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-11-18 10:18:58,346 INFO L87 Difference]: Start difference. First operand 172 states and 202 transitions. Second operand 16 states. [2018-11-18 10:18:59,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:18:59,268 INFO L93 Difference]: Finished difference Result 269 states and 304 transitions. [2018-11-18 10:18:59,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 10:18:59,268 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-11-18 10:18:59,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:18:59,270 INFO L225 Difference]: With dead ends: 269 [2018-11-18 10:18:59,270 INFO L226 Difference]: Without dead ends: 269 [2018-11-18 10:18:59,270 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=301, Invalid=959, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 10:18:59,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-11-18 10:18:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 183. [2018-11-18 10:18:59,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-18 10:18:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 214 transitions. [2018-11-18 10:18:59,274 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 214 transitions. Word has length 34 [2018-11-18 10:18:59,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:18:59,274 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 214 transitions. [2018-11-18 10:18:59,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 10:18:59,275 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 214 transitions. [2018-11-18 10:18:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 10:18:59,275 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:18:59,275 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:18:59,276 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2018-11-18 10:18:59,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:59,276 INFO L82 PathProgramCache]: Analyzing trace with hash 619055763, now seen corresponding path program 1 times [2018-11-18 10:18:59,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:18:59,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:59,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:18:59,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:59,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:18:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:18:59,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:18:59,576 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:18:59,576 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-11-18 10:18:59,578 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [19], [20], [23], [26], [27], [30], [33], [34], [37], [40], [43], [47], [49], [52], [196], [200], [206], [207], [208], [210], [211], [217], [221], [261], [266], [270], [276], [277], [280], [282], [284], [291], [292], [293] [2018-11-18 10:18:59,604 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:18:59,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:18:59,751 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 10:18:59,752 INFO L272 AbstractInterpreter]: Visited 42 different actions 42 times. Never merged. Never widened. Performed 318 root evaluator evaluations with a maximum evaluation depth of 3. Performed 318 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-18 10:18:59,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:59,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 10:18:59,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:18:59,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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-18 10:18:59,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:18:59,776 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 10:18:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:59,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:18:59,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 10:18:59,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:18:59,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:18:59,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 10:18:59,878 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:18:59,882 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:18:59,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 10:18:59,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:18:59,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:18:59,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-18 10:18:59,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 10:18:59,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 10:18:59,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:18:59,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:18:59,910 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-18 10:18:59,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-11-18 10:18:59,954 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:18:59,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-18 10:18:59,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 10:18:59,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:18:59,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:18:59,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:18:59,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-11-18 10:18:59,988 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:18:59,989 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:18:59,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 10:18:59,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:18:59,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:18:59,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:29 [2018-11-18 10:19:00,012 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:00,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-11-18 10:19:00,017 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:00,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 10:19:00,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:00,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:00,032 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-18 10:19:00,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:38 [2018-11-18 10:19:00,102 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:00,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 74 [2018-11-18 10:19:00,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2018-11-18 10:19:00,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:00,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:00,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 62 [2018-11-18 10:19:00,175 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 10:19:00,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:19:00,216 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 2 xjuncts. [2018-11-18 10:19:00,216 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:67, output treesize:99 [2018-11-18 10:19:00,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 75 [2018-11-18 10:19:00,281 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:00,282 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:00,293 INFO L477 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-18 10:19:00,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 10:19:00,327 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:00,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 81 [2018-11-18 10:19:00,328 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:00,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:19:00,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2018-11-18 10:19:00,382 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:00,383 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:00,384 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:00,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-11-18 10:19:00,385 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:00,394 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:00,417 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-18 10:19:00,417 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:151, output treesize:173 [2018-11-18 10:19:02,657 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2018-11-18 10:19:02,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 69 [2018-11-18 10:19:02,738 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:02,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2018-11-18 10:19:02,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:02,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:02,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2018-11-18 10:19:02,771 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:02,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 57 [2018-11-18 10:19:02,772 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:02,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:02,797 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-18 10:19:02,797 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:144, output treesize:136 [2018-11-18 10:19:02,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 64 [2018-11-18 10:19:02,965 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:02,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2018-11-18 10:19:02,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:02,985 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:02,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-18 10:19:02,986 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:03,001 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:03,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2018-11-18 10:19:03,002 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:03,014 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:03,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-11-18 10:19:03,015 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:03,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:03,028 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-18 10:19:03,028 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:150, output treesize:10 [2018-11-18 10:19:03,040 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:03,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-18 10:19:03,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:03,044 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-18 10:19:03,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-11-18 10:19:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:19:03,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:19:05,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-11-18 10:19:05,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:05,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2018-11-18 10:19:05,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:05,402 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 2 xjuncts. [2018-11-18 10:19:05,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:100, output treesize:84 [2018-11-18 10:19:06,810 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:06,811 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:06,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 78 [2018-11-18 10:19:06,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:06,827 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:06,827 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:06,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 77 [2018-11-18 10:19:06,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:06,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 55 [2018-11-18 10:19:06,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-18 10:19:06,847 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:06,853 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:06,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2018-11-18 10:19:06,868 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:06,868 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:06,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 27 [2018-11-18 10:19:06,868 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:06,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-18 10:19:06,881 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:06,881 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:06,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-18 10:19:06,882 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:06,884 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:06,886 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-18 10:19:06,889 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-18 10:19:06,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 54 [2018-11-18 10:19:06,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-18 10:19:06,900 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:06,906 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:06,906 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:06,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 50 [2018-11-18 10:19:06,918 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:06,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-18 10:19:06,919 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:06,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-18 10:19:06,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-18 10:19:06,928 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:06,931 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:06,933 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:06,936 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:06,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:06,944 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 12 variables, input treesize:174, output treesize:4 [2018-11-18 10:19:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:19:06,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 10:19:06,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 17] total 43 [2018-11-18 10:19:06,992 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 10:19:06,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-18 10:19:06,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-18 10:19:06,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1702, Unknown=4, NotChecked=0, Total=1892 [2018-11-18 10:19:06,993 INFO L87 Difference]: Start difference. First operand 183 states and 214 transitions. Second operand 34 states. [2018-11-18 10:19:07,935 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2018-11-18 10:19:08,603 WARN L180 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2018-11-18 10:19:10,780 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2018-11-18 10:19:11,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:19:11,478 INFO L93 Difference]: Finished difference Result 263 states and 280 transitions. [2018-11-18 10:19:11,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-18 10:19:11,478 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 44 [2018-11-18 10:19:11,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:19:11,479 INFO L225 Difference]: With dead ends: 263 [2018-11-18 10:19:11,479 INFO L226 Difference]: Without dead ends: 263 [2018-11-18 10:19:11,480 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 57 SyntacticMatches, 9 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1449 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=683, Invalid=4143, Unknown=4, NotChecked=0, Total=4830 [2018-11-18 10:19:11,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-18 10:19:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 194. [2018-11-18 10:19:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-18 10:19:11,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 227 transitions. [2018-11-18 10:19:11,483 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 227 transitions. Word has length 44 [2018-11-18 10:19:11,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:19:11,483 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 227 transitions. [2018-11-18 10:19:11,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-18 10:19:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 227 transitions. [2018-11-18 10:19:11,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 10:19:11,486 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:19:11,487 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:19:11,487 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2018-11-18 10:19:11,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:19:11,487 INFO L82 PathProgramCache]: Analyzing trace with hash 619055764, now seen corresponding path program 1 times [2018-11-18 10:19:11,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:19:11,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:19:11,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:19:11,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:19:11,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:19:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:19:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:19:11,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:19:11,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:19:11,838 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-11-18 10:19:11,838 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [19], [20], [23], [26], [27], [30], [33], [34], [37], [40], [43], [47], [49], [52], [196], [200], [206], [207], [209], [210], [211], [217], [221], [261], [266], [270], [276], [277], [280], [282], [284], [291], [292], [293] [2018-11-18 10:19:11,839 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:19:11,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:19:11,886 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 10:19:11,886 INFO L272 AbstractInterpreter]: Visited 42 different actions 42 times. Never merged. Never widened. Performed 322 root evaluator evaluations with a maximum evaluation depth of 3. Performed 322 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-18 10:19:11,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:19:11,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 10:19:11,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:19:11,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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-18 10:19:11,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:19:11,906 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 10:19:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:19:11,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:19:11,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 10:19:11,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:11,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:11,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 10:19:11,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 10:19:11,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:11,951 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:11,952 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:11,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 10:19:11,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:11,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:11,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-11-18 10:19:11,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 10:19:11,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 10:19:11,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:11,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:11,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 10:19:11,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 10:19:11,992 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:11,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,002 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-18 10:19:12,002 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39 [2018-11-18 10:19:12,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-11-18 10:19:12,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-18 10:19:12,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,085 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-11-18 10:19:12,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 10:19:12,094 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,110 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:68 [2018-11-18 10:19:12,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 10:19:12,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,146 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,146 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,147 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-18 10:19:12,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:71 [2018-11-18 10:19:12,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-11-18 10:19:12,188 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-18 10:19:12,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-11-18 10:19:12,223 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 10:19:12,225 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,234 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,245 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-18 10:19:12,245 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:83 [2018-11-18 10:19:12,348 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,349 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 59 [2018-11-18 10:19:12,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-18 10:19:12,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,393 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,394 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 118 [2018-11-18 10:19:12,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 10:19:12,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,419 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,436 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-18 10:19:12,436 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:129, output treesize:121 [2018-11-18 10:19:12,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 130 [2018-11-18 10:19:12,492 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-11-18 10:19:12,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 80 [2018-11-18 10:19:12,545 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-11-18 10:19:12,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,554 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,572 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-18 10:19:12,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:180, output treesize:156 [2018-11-18 10:19:12,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 123 [2018-11-18 10:19:12,691 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 164 [2018-11-18 10:19:12,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 97 [2018-11-18 10:19:12,739 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 10:19:12,739 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,765 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-18 10:19:12,765 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:182, output treesize:174 [2018-11-18 10:19:12,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 102 [2018-11-18 10:19:12,825 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2018-11-18 10:19:12,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,849 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-18 10:19:12,850 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,870 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2018-11-18 10:19:12,872 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-18 10:19:12,887 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-18 10:19:12,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2018-11-18 10:19:12,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 10:19:12,912 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,927 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-18 10:19:12,928 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,934 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:12,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-18 10:19:12,935 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,937 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:12,945 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-18 10:19:12,945 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:188, output treesize:18 [2018-11-18 10:19:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:19:13,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:19:24,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 150 [2018-11-18 10:19:24,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-18 10:19:24,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:24,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 148 [2018-11-18 10:19:24,266 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-18 10:19:24,267 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:24,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 216 [2018-11-18 10:19:24,272 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:24,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 121 [2018-11-18 10:19:24,275 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:24,296 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:24,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 121 [2018-11-18 10:19:24,302 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:24,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-11-18 10:19:24,304 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:24,318 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:24,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 124 [2018-11-18 10:19:24,419 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:24,420 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:24,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 134 [2018-11-18 10:19:24,421 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:24,449 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:24,452 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:24,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 133 [2018-11-18 10:19:24,460 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-18 10:19:24,500 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 10:19:24,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 112 [2018-11-18 10:19:24,559 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:24,559 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:24,561 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:24,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 107 [2018-11-18 10:19:24,567 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-18 10:19:24,598 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:19:24,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-11-18 10:19:24,602 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:24,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 88 [2018-11-18 10:19:24,605 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:24,611 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:24,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 114 [2018-11-18 10:19:24,615 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:24,616 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:24,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 102 [2018-11-18 10:19:24,616 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:24,627 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:24,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 114 [2018-11-18 10:19:24,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 89 [2018-11-18 10:19:24,693 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:24,919 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:19:24,919 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_arrayElimCell_47 term size 48 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.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:429) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 10:19:24,921 INFO L168 Benchmark]: Toolchain (without parser) took 30130.06 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 239.6 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -129.4 MB). Peak memory consumption was 110.2 MB. Max. memory is 11.5 GB. [2018-11-18 10:19:24,922 INFO L168 Benchmark]: CDTParser took 0.18 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-18 10:19:24,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. [2018-11-18 10:19:24,922 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:19:24,922 INFO L168 Benchmark]: Boogie Preprocessor took 24.09 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-18 10:19:24,922 INFO L168 Benchmark]: RCFGBuilder took 427.14 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. [2018-11-18 10:19:24,922 INFO L168 Benchmark]: TraceAbstraction took 29319.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 110.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -12.4 MB). Peak memory consumption was 97.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:19:24,924 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.09 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 427.14 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29319.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 110.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -12.4 MB). Peak memory consumption was 97.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_47 term size 48 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_47 term size 48: 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... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 10:19:26,262 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:19:26,263 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:19:26,272 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:19:26,272 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:19:26,273 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:19:26,273 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:19:26,275 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:19:26,276 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:19:26,276 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:19:26,277 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:19:26,277 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:19:26,278 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:19:26,279 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:19:26,280 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:19:26,280 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:19:26,281 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:19:26,282 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:19:26,284 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:19:26,285 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:19:26,285 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:19:26,287 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:19:26,288 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:19:26,288 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:19:26,289 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:19:26,289 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:19:26,290 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:19:26,291 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:19:26,291 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:19:26,292 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:19:26,292 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:19:26,293 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:19:26,293 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:19:26,293 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:19:26,294 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:19:26,295 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:19:26,295 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Bitvector.epf [2018-11-18 10:19:26,306 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:19:26,306 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:19:26,307 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 10:19:26,307 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 10:19:26,307 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 10:19:26,307 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 10:19:26,307 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 10:19:26,308 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 10:19:26,308 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 10:19:26,308 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 10:19:26,308 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:19:26,308 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:19:26,309 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:19:26,309 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:19:26,309 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:19:26,309 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:19:26,309 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:19:26,309 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:19:26,310 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-18 10:19:26,310 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-18 10:19:26,312 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 10:19:26,312 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 10:19:26,312 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 10:19:26,312 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:19:26,312 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:19:26,312 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:19:26,312 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:19:26,313 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 10:19:26,313 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 10:19:26,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:19:26,313 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:19:26,313 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 10:19:26,313 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 10:19:26,314 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 10:19:26,314 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 10:19:26,314 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_9395824f-c7b9-4460-947e-03caee15622a/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-18 10:19:26,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:19:26,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:19:26,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:19:26,359 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:19:26,360 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:19:26,360 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/sll-buckets_false-unreach-call_false-valid-memcleanup.i [2018-11-18 10:19:26,404 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/bin-2019/utaipan/data/3faf46574/e5524f216ecf4f96a9eb249b0c292e09/FLAG7e9c9ef9e [2018-11-18 10:19:26,764 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:19:26,764 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/sv-benchmarks/c/forester-heap/sll-buckets_false-unreach-call_false-valid-memcleanup.i [2018-11-18 10:19:26,773 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/bin-2019/utaipan/data/3faf46574/e5524f216ecf4f96a9eb249b0c292e09/FLAG7e9c9ef9e [2018-11-18 10:19:27,159 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/bin-2019/utaipan/data/3faf46574/e5524f216ecf4f96a9eb249b0c292e09 [2018-11-18 10:19:27,162 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:19:27,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:19:27,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:19:27,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:19:27,166 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:19:27,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:19:27" (1/1) ... [2018-11-18 10:19:27,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@363fa465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:27, skipping insertion in model container [2018-11-18 10:19:27,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:19:27" (1/1) ... [2018-11-18 10:19:27,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:19:27,206 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:19:27,420 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:19:27,430 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:19:27,465 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:19:27,541 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:19:27,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:27 WrapperNode [2018-11-18 10:19:27,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:19:27,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:19:27,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:19:27,543 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:19:27,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:27" (1/1) ... [2018-11-18 10:19:27,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:27" (1/1) ... [2018-11-18 10:19:27,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:19:27,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:19:27,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:19:27,562 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:19:27,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:27" (1/1) ... [2018-11-18 10:19:27,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:27" (1/1) ... [2018-11-18 10:19:27,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:27" (1/1) ... [2018-11-18 10:19:27,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:27" (1/1) ... [2018-11-18 10:19:27,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:27" (1/1) ... [2018-11-18 10:19:27,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:27" (1/1) ... [2018-11-18 10:19:27,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:27" (1/1) ... [2018-11-18 10:19:27,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:19:27,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:19:27,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:19:27,586 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:19:27,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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-18 10:19:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 10:19:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 10:19:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 10:19:27,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 10:19:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 10:19:27,620 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 10:19:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 10:19:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 10:19:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 10:19:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 10:19:27,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:19:27,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:19:28,137 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:19:28,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:19:28 BoogieIcfgContainer [2018-11-18 10:19:28,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:19:28,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 10:19:28,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 10:19:28,140 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 10:19:28,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:19:27" (1/3) ... [2018-11-18 10:19:28,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a827a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:19:28, skipping insertion in model container [2018-11-18 10:19:28,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:27" (2/3) ... [2018-11-18 10:19:28,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a827a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:19:28, skipping insertion in model container [2018-11-18 10:19:28,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:19:28" (3/3) ... [2018-11-18 10:19:28,142 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets_false-unreach-call_false-valid-memcleanup.i [2018-11-18 10:19:28,148 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 10:19:28,153 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-11-18 10:19:28,162 INFO L257 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2018-11-18 10:19:28,178 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:19:28,179 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 10:19:28,179 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-18 10:19:28,179 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 10:19:28,179 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:19:28,179 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:19:28,179 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 10:19:28,179 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:19:28,179 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 10:19:28,191 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2018-11-18 10:19:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 10:19:28,197 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:19:28,198 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:19:28,200 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 10:19:28,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:19:28,204 INFO L82 PathProgramCache]: Analyzing trace with hash 543179108, now seen corresponding path program 1 times [2018-11-18 10:19:28,206 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:19:28,206 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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-18 10:19:28,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:19:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:19:28,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:19:28,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 10:19:28,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:28,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:28,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 10:19:28,295 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-18 10:19:28,295 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:19:28,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:19:28,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:19:28,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:19:28,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:19:28,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:19:28,309 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2018-11-18 10:19:28,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:19:28,558 INFO L93 Difference]: Finished difference Result 184 states and 193 transitions. [2018-11-18 10:19:28,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:19:28,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 10:19:28,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:19:28,567 INFO L225 Difference]: With dead ends: 184 [2018-11-18 10:19:28,568 INFO L226 Difference]: Without dead ends: 180 [2018-11-18 10:19:28,569 INFO L604 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-18 10:19:28,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-18 10:19:28,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 145. [2018-11-18 10:19:28,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-18 10:19:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2018-11-18 10:19:28,600 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 152 transitions. Word has length 7 [2018-11-18 10:19:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:19:28,600 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 152 transitions. [2018-11-18 10:19:28,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:19:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2018-11-18 10:19:28,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 10:19:28,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:19:28,601 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:19:28,601 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 10:19:28,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:19:28,602 INFO L82 PathProgramCache]: Analyzing trace with hash 543179109, now seen corresponding path program 1 times [2018-11-18 10:19:28,602 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:19:28,602 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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-18 10:19:28,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:19:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:19:28,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:19:28,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 10:19:28,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:28,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:28,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 10:19:28,659 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-18 10:19:28,659 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:19:28,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:19:28,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:19:28,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:19:28,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:19:28,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:19:28,664 INFO L87 Difference]: Start difference. First operand 145 states and 152 transitions. Second operand 3 states. [2018-11-18 10:19:28,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:19:28,898 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2018-11-18 10:19:28,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:19:28,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 10:19:28,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:19:28,901 INFO L225 Difference]: With dead ends: 179 [2018-11-18 10:19:28,901 INFO L226 Difference]: Without dead ends: 179 [2018-11-18 10:19:28,902 INFO L604 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-18 10:19:28,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-18 10:19:28,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 141. [2018-11-18 10:19:28,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-18 10:19:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 148 transitions. [2018-11-18 10:19:28,909 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 148 transitions. Word has length 7 [2018-11-18 10:19:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:19:28,910 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 148 transitions. [2018-11-18 10:19:28,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:19:28,910 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 148 transitions. [2018-11-18 10:19:28,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 10:19:28,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:19:28,910 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:19:28,911 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 10:19:28,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:19:28,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1384073739, now seen corresponding path program 1 times [2018-11-18 10:19:28,911 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:19:28,912 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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-18 10:19:28,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:19:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:19:28,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:19:28,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 10:19:28,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:28,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:28,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:11 [2018-11-18 10:19:29,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 10:19:29,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 10:19:29,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:29,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:29,021 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-18 10:19:29,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2018-11-18 10:19:29,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 10:19:29,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-18 10:19:29,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:29,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:29,053 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-18 10:19:29,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:13 [2018-11-18 10:19:29,074 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-18 10:19:29,074 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:19:29,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:19:29,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:19:29,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 10:19:29,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:19:29,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:19:29,076 INFO L87 Difference]: Start difference. First operand 141 states and 148 transitions. Second operand 7 states. [2018-11-18 10:19:29,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:19:29,637 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2018-11-18 10:19:29,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 10:19:29,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-18 10:19:29,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:19:29,639 INFO L225 Difference]: With dead ends: 193 [2018-11-18 10:19:29,639 INFO L226 Difference]: Without dead ends: 193 [2018-11-18 10:19:29,640 INFO L604 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-18 10:19:29,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-18 10:19:29,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 150. [2018-11-18 10:19:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-18 10:19:29,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 168 transitions. [2018-11-18 10:19:29,647 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 168 transitions. Word has length 13 [2018-11-18 10:19:29,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:19:29,648 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 168 transitions. [2018-11-18 10:19:29,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 10:19:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 168 transitions. [2018-11-18 10:19:29,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 10:19:29,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:19:29,649 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:19:29,650 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 10:19:29,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:19:29,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1384073740, now seen corresponding path program 1 times [2018-11-18 10:19:29,652 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:19:29,652 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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-18 10:19:29,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:19:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:19:29,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:19:29,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 10:19:29,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:29,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:29,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 10:19:29,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 10:19:29,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 10:19:29,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:29,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:29,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 10:19:29,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 10:19:29,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:29,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:29,744 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-18 10:19:29,744 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-11-18 10:19:29,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 10:19:29,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 10:19:29,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:29,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:29,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 10:19:29,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-18 10:19:29,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:29,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:29,775 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-18 10:19:29,775 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-11-18 10:19:29,792 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-18 10:19:29,792 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:19:29,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:19:29,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:19:29,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:19:29,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:19:29,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:19:29,799 INFO L87 Difference]: Start difference. First operand 150 states and 168 transitions. Second operand 6 states. [2018-11-18 10:19:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:19:30,235 INFO L93 Difference]: Finished difference Result 209 states and 239 transitions. [2018-11-18 10:19:30,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:19:30,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-18 10:19:30,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:19:30,236 INFO L225 Difference]: With dead ends: 209 [2018-11-18 10:19:30,236 INFO L226 Difference]: Without dead ends: 209 [2018-11-18 10:19:30,237 INFO L604 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-18 10:19:30,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-18 10:19:30,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 146. [2018-11-18 10:19:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-18 10:19:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2018-11-18 10:19:30,243 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 13 [2018-11-18 10:19:30,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:19:30,243 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2018-11-18 10:19:30,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:19:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2018-11-18 10:19:30,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 10:19:30,244 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:19:30,244 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:19:30,245 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 10:19:30,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:19:30,245 INFO L82 PathProgramCache]: Analyzing trace with hash -31936846, now seen corresponding path program 1 times [2018-11-18 10:19:30,245 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:19:30,245 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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-18 10:19:30,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:19:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:19:30,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:19:30,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 10:19:30,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:30,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:30,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 10:19:30,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 10:19:30,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 10:19:30,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:30,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:30,319 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-18 10:19:30,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-11-18 10:19:30,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-18 10:19:30,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-18 10:19:30,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:30,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:30,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:30,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-11-18 10:19:30,346 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-18 10:19:30,346 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:19:30,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:19:30,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:19:30,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:19:30,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:19:30,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:19:30,348 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand 6 states. [2018-11-18 10:19:30,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:19:30,707 INFO L93 Difference]: Finished difference Result 186 states and 197 transitions. [2018-11-18 10:19:30,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:19:30,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-18 10:19:30,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:19:30,708 INFO L225 Difference]: With dead ends: 186 [2018-11-18 10:19:30,708 INFO L226 Difference]: Without dead ends: 186 [2018-11-18 10:19:30,708 INFO L604 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-18 10:19:30,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-18 10:19:30,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 145. [2018-11-18 10:19:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-18 10:19:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 163 transitions. [2018-11-18 10:19:30,712 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 163 transitions. Word has length 19 [2018-11-18 10:19:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:19:30,712 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 163 transitions. [2018-11-18 10:19:30,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:19:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 163 transitions. [2018-11-18 10:19:30,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 10:19:30,713 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:19:30,713 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:19:30,713 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 10:19:30,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:19:30,713 INFO L82 PathProgramCache]: Analyzing trace with hash -31936845, now seen corresponding path program 1 times [2018-11-18 10:19:30,714 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:19:30,714 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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-18 10:19:30,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:19:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:19:30,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:19:30,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 10:19:30,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:30,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:30,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 10:19:30,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 10:19:30,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 10:19:30,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:30,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:30,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 10:19:30,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 10:19:30,824 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:30,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:30,832 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-18 10:19:30,833 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:19 [2018-11-18 10:19:30,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 10:19:30,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 10:19:30,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:30,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:30,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-18 10:19:30,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-18 10:19:30,861 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:30,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:30,866 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-18 10:19:30,866 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-11-18 10:19:30,881 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-18 10:19:30,881 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:19:30,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:19:30,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:19:30,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:19:30,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:19:30,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:19:30,883 INFO L87 Difference]: Start difference. First operand 145 states and 163 transitions. Second operand 6 states. [2018-11-18 10:19:31,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:19:31,255 INFO L93 Difference]: Finished difference Result 205 states and 235 transitions. [2018-11-18 10:19:31,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:19:31,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-18 10:19:31,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:19:31,256 INFO L225 Difference]: With dead ends: 205 [2018-11-18 10:19:31,256 INFO L226 Difference]: Without dead ends: 205 [2018-11-18 10:19:31,256 INFO L604 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-18 10:19:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-18 10:19:31,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 142. [2018-11-18 10:19:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-18 10:19:31,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2018-11-18 10:19:31,260 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 19 [2018-11-18 10:19:31,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:19:31,260 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2018-11-18 10:19:31,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:19:31,260 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2018-11-18 10:19:31,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 10:19:31,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:19:31,261 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:19:31,261 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 10:19:31,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:19:31,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1559782426, now seen corresponding path program 1 times [2018-11-18 10:19:31,262 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:19:31,262 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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-18 10:19:31,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:19:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:19:31,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:19:31,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-18 10:19:31,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:31,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:31,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 10:19:31,354 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-18 10:19:31,354 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:19:31,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:19:31,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:19:31,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:19:31,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:19:31,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:19:31,356 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand 3 states. [2018-11-18 10:19:31,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:19:31,467 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2018-11-18 10:19:31,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:19:31,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 10:19:31,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:19:31,468 INFO L225 Difference]: With dead ends: 148 [2018-11-18 10:19:31,468 INFO L226 Difference]: Without dead ends: 148 [2018-11-18 10:19:31,469 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-18 10:19:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-18 10:19:31,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 137. [2018-11-18 10:19:31,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-18 10:19:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 155 transitions. [2018-11-18 10:19:31,471 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 155 transitions. Word has length 25 [2018-11-18 10:19:31,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:19:31,471 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 155 transitions. [2018-11-18 10:19:31,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:19:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2018-11-18 10:19:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 10:19:31,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:19:31,472 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:19:31,472 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 10:19:31,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:19:31,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1559782427, now seen corresponding path program 1 times [2018-11-18 10:19:31,473 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:19:31,473 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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-18 10:19:31,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:19:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:19:31,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:19:31,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 10:19:31,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:31,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:31,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 10:19:31,562 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-18 10:19:31,562 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:19:31,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:19:31,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:19:31,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:19:31,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:19:31,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:19:31,568 INFO L87 Difference]: Start difference. First operand 137 states and 155 transitions. Second operand 3 states. [2018-11-18 10:19:31,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:19:31,694 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2018-11-18 10:19:31,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:19:31,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 10:19:31,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:19:31,695 INFO L225 Difference]: With dead ends: 143 [2018-11-18 10:19:31,695 INFO L226 Difference]: Without dead ends: 143 [2018-11-18 10:19:31,695 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-18 10:19:31,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-18 10:19:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 132. [2018-11-18 10:19:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-18 10:19:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 150 transitions. [2018-11-18 10:19:31,698 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 150 transitions. Word has length 25 [2018-11-18 10:19:31,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:19:31,698 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 150 transitions. [2018-11-18 10:19:31,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:19:31,698 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 150 transitions. [2018-11-18 10:19:31,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 10:19:31,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:19:31,699 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:19:31,699 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 10:19:31,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:19:31,699 INFO L82 PathProgramCache]: Analyzing trace with hash 229568258, now seen corresponding path program 1 times [2018-11-18 10:19:31,700 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:19:31,700 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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-18 10:19:31,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:19:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:19:31,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:19:31,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 10:19:31,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:31,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 10:19:31,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:31,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:31,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-18 10:19:31,822 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:31,823 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:31,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 10:19:31,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:31,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-18 10:19:31,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:31,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:31,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:18 [2018-11-18 10:19:31,891 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:31,893 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:31,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 10:19:31,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:31,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-18 10:19:31,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:31,927 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-18 10:19:31,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-11-18 10:19:31,994 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-18 10:19:31,994 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:19:31,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:19:31,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 10:19:31,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 10:19:31,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 10:19:31,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:19:31,999 INFO L87 Difference]: Start difference. First operand 132 states and 150 transitions. Second operand 8 states. [2018-11-18 10:19:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:19:32,671 INFO L93 Difference]: Finished difference Result 225 states and 245 transitions. [2018-11-18 10:19:32,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:19:32,672 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-18 10:19:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:19:32,673 INFO L225 Difference]: With dead ends: 225 [2018-11-18 10:19:32,674 INFO L226 Difference]: Without dead ends: 225 [2018-11-18 10:19:32,674 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:19:32,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-18 10:19:32,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 172. [2018-11-18 10:19:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-18 10:19:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 206 transitions. [2018-11-18 10:19:32,677 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 206 transitions. Word has length 28 [2018-11-18 10:19:32,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:19:32,677 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 206 transitions. [2018-11-18 10:19:32,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 10:19:32,677 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 206 transitions. [2018-11-18 10:19:32,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 10:19:32,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:19:32,678 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:19:32,678 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 10:19:32,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:19:32,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1473317779, now seen corresponding path program 1 times [2018-11-18 10:19:32,679 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:19:32,679 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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-18 10:19:32,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:19:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:19:32,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:19:32,720 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-18 10:19:32,720 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:19:32,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:19:32,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:19:32,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:19:32,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:19:32,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:19:32,722 INFO L87 Difference]: Start difference. First operand 172 states and 206 transitions. Second operand 4 states. [2018-11-18 10:19:32,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:19:32,884 INFO L93 Difference]: Finished difference Result 260 states and 306 transitions. [2018-11-18 10:19:32,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:19:32,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-18 10:19:32,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:19:32,885 INFO L225 Difference]: With dead ends: 260 [2018-11-18 10:19:32,885 INFO L226 Difference]: Without dead ends: 260 [2018-11-18 10:19:32,885 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-18 10:19:32,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-18 10:19:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 172. [2018-11-18 10:19:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-18 10:19:32,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 204 transitions. [2018-11-18 10:19:32,889 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 204 transitions. Word has length 29 [2018-11-18 10:19:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:19:32,889 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 204 transitions. [2018-11-18 10:19:32,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:19:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 204 transitions. [2018-11-18 10:19:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 10:19:32,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:19:32,890 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:19:32,890 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 10:19:32,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:19:32,890 INFO L82 PathProgramCache]: Analyzing trace with hash 824430105, now seen corresponding path program 1 times [2018-11-18 10:19:32,892 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:19:32,893 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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-18 10:19:32,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:19:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:19:33,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:19:33,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 10:19:33,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 10:19:33,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 10:19:33,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 10:19:33,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 10:19:33,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 10:19:33,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,041 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-11-18 10:19:33,053 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:33,054 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:33,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 10:19:33,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:26 [2018-11-18 10:19:33,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-18 10:19:33,086 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:33,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 10:19:33,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-18 10:19:33,126 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:33,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 10:19:33,127 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,134 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,146 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-18 10:19:33,146 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:30 [2018-11-18 10:19:33,208 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:33,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-11-18 10:19:33,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-18 10:19:33,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,261 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:33,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-11-18 10:19:33,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 10:19:33,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,303 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2018-11-18 10:19:33,344 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:33,345 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:33,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 10:19:33,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:59 [2018-11-18 10:19:33,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 44 [2018-11-18 10:19:33,434 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:33,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-18 10:19:33,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-11-18 10:19:33,518 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:33,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 10:19:33,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,546 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,579 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-18 10:19:33,579 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:63 [2018-11-18 10:19:33,765 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:33,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 92 [2018-11-18 10:19:33,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 71 [2018-11-18 10:19:33,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-18 10:19:33,949 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:33,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:34,025 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:34,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 98 [2018-11-18 10:19:34,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 105 [2018-11-18 10:19:34,084 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:34,263 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:34,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 80 [2018-11-18 10:19:34,329 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-18 10:19:34,421 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:19:34,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 10:19:34,495 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:105, output treesize:171 [2018-11-18 10:19:34,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 174 [2018-11-18 10:19:34,711 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:34,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 166 [2018-11-18 10:19:34,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:34,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:35,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 120 [2018-11-18 10:19:35,272 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:35,273 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:35,355 INFO L477 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 135 [2018-11-18 10:19:35,356 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 10:19:35,570 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:35,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 138 [2018-11-18 10:19:35,571 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:35,677 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:19:36,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 101 [2018-11-18 10:19:36,006 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:36,007 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:36,009 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:36,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-11-18 10:19:36,010 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:36,048 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:36,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 96 [2018-11-18 10:19:36,245 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:36,246 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:36,247 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:36,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-11-18 10:19:36,248 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:36,277 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:36,398 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-18 10:19:36,399 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:277, output treesize:315 [2018-11-18 10:19:36,673 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2018-11-18 10:19:36,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 105 [2018-11-18 10:19:36,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 82 [2018-11-18 10:19:36,863 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-18 10:19:36,949 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:36,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 73 [2018-11-18 10:19:36,952 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-18 10:19:37,025 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:37,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2018-11-18 10:19:37,026 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:37,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 76 [2018-11-18 10:19:37,096 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 10:19:37,161 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:37,164 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:37,186 INFO L477 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 76 treesize of output 81 [2018-11-18 10:19:37,187 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 10:19:37,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-18 10:19:37,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 69 [2018-11-18 10:19:37,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:37,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-18 10:19:37,452 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:37,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 10:19:37,478 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:37,497 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:37,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 59 [2018-11-18 10:19:37,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-11-18 10:19:37,687 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:37,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2018-11-18 10:19:37,787 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:37,866 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:37,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-11-18 10:19:37,867 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:37,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-11-18 10:19:37,927 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:37,986 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:37,987 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:37,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-11-18 10:19:37,988 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:38,019 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:38,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-11-18 10:19:38,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-18 10:19:38,038 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:38,086 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:38,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-18 10:19:38,087 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:38,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-11-18 10:19:38,128 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:38,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-11-18 10:19:38,166 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:38,203 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:38,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-11-18 10:19:38,205 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:38,217 INFO L267 ElimStorePlain]: Start of recursive call 17: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:38,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2018-11-18 10:19:38,236 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:38,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-18 10:19:38,238 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:38,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 10:19:38,266 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:38,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 10:19:38,287 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:38,295 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:38,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37 [2018-11-18 10:19:38,370 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:38,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-18 10:19:38,371 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:38,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-18 10:19:38,381 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:38,384 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:38,395 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-18 10:19:38,395 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 9 variables, input treesize:225, output treesize:7 [2018-11-18 10:19:38,468 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-18 10:19:38,468 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:19:38,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:19:38,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-11-18 10:19:38,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 10:19:38,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 10:19:38,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=254, Unknown=2, NotChecked=0, Total=306 [2018-11-18 10:19:38,470 INFO L87 Difference]: Start difference. First operand 172 states and 204 transitions. Second operand 18 states. [2018-11-18 10:19:49,631 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2018-11-18 10:19:49,984 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2018-11-18 10:19:50,202 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2018-11-18 10:19:50,831 WARN L180 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 118 [2018-11-18 10:19:51,771 WARN L180 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 122 [2018-11-18 10:19:52,544 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-18 10:19:52,875 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-18 10:19:53,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:19:53,853 INFO L93 Difference]: Finished difference Result 223 states and 247 transitions. [2018-11-18 10:19:53,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 10:19:53,853 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-11-18 10:19:53,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:19:53,854 INFO L225 Difference]: With dead ends: 223 [2018-11-18 10:19:53,854 INFO L226 Difference]: Without dead ends: 223 [2018-11-18 10:19:53,854 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=226, Invalid=962, Unknown=2, NotChecked=0, Total=1190 [2018-11-18 10:19:53,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-18 10:19:53,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 149. [2018-11-18 10:19:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-18 10:19:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 167 transitions. [2018-11-18 10:19:53,856 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 167 transitions. Word has length 33 [2018-11-18 10:19:53,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:19:53,857 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 167 transitions. [2018-11-18 10:19:53,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 10:19:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 167 transitions. [2018-11-18 10:19:53,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 10:19:53,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:19:53,857 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:19:53,858 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 10:19:53,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:19:53,861 INFO L82 PathProgramCache]: Analyzing trace with hash -365162680, now seen corresponding path program 1 times [2018-11-18 10:19:53,861 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:19:53,861 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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-18 10:19:53,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:19:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:19:53,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:19:53,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 10:19:53,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:53,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 10:19:53,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:54,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:54,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-18 10:19:54,009 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:54,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-18 10:19:54,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:54,019 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:54,020 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:54,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 10:19:54,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:54,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:54,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:18 [2018-11-18 10:19:54,068 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:54,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-18 10:19:54,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:54,087 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:54,088 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:54,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-11-18 10:19:54,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:54,103 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-18 10:19:54,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:38 [2018-11-18 10:19:54,160 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:54,160 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:19:54,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-18 10:19:54,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:54,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:54,182 INFO L477 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-18 10:19:54,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:54,194 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-18 10:19:54,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:23 [2018-11-18 10:19:54,246 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-18 10:19:54,246 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:19:54,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:19:54,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 10:19:54,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 10:19:54,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:19:54,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:19:54,248 INFO L87 Difference]: Start difference. First operand 149 states and 167 transitions. Second operand 10 states. [2018-11-18 10:19:55,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:19:55,047 INFO L93 Difference]: Finished difference Result 231 states and 253 transitions. [2018-11-18 10:19:55,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:19:55,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-11-18 10:19:55,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:19:55,048 INFO L225 Difference]: With dead ends: 231 [2018-11-18 10:19:55,048 INFO L226 Difference]: Without dead ends: 231 [2018-11-18 10:19:55,049 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-11-18 10:19:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-11-18 10:19:55,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 186. [2018-11-18 10:19:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-18 10:19:55,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 218 transitions. [2018-11-18 10:19:55,052 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 218 transitions. Word has length 36 [2018-11-18 10:19:55,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:19:55,053 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 218 transitions. [2018-11-18 10:19:55,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 10:19:55,053 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 218 transitions. [2018-11-18 10:19:55,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 10:19:55,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:19:55,053 INFO L375 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, 1, 1, 1] [2018-11-18 10:19:55,054 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 10:19:55,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:19:55,054 INFO L82 PathProgramCache]: Analyzing trace with hash 363356147, now seen corresponding path program 1 times [2018-11-18 10:19:55,054 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:19:55,054 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9395824f-c7b9-4460-947e-03caee15622a/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-18 10:19:55,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:19:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:19:55,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:19:55,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 10:19:55,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:55,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:55,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 10:19:55,205 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:55,205 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:55,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 10:19:55,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:55,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:55,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-18 10:19:55,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 10:19:55,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 10:19:55,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:55,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:55,227 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-18 10:19:55,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-18 10:19:55,277 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:55,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-18 10:19:55,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 10:19:55,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:55,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:55,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:55,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:31 [2018-11-18 10:19:55,335 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:55,336 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:55,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 10:19:55,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:55,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:55,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:28 [2018-11-18 10:19:55,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-18 10:19:55,391 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:55,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 10:19:55,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:55,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:55,421 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-18 10:19:55,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-11-18 10:19:55,537 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:55,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 76 [2018-11-18 10:19:55,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2018-11-18 10:19:55,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:55,678 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:55,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 60 [2018-11-18 10:19:55,727 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 10:19:55,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:19:55,831 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 2 xjuncts. [2018-11-18 10:19:55,831 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:72, output treesize:113 [2018-11-18 10:19:55,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 78 [2018-11-18 10:19:55,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:55,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 100 [2018-11-18 10:19:55,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:56,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:56,117 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:56,134 INFO L477 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 74 [2018-11-18 10:19:56,134 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 10:19:56,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:19:56,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2018-11-18 10:19:56,511 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:56,512 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:56,513 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:56,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-11-18 10:19:56,514 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:56,534 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:19:56,611 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-18 10:19:56,611 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:157, output treesize:182 [2018-11-18 10:19:56,793 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-11-18 10:19:56,816 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:56,818 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:56,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 109 [2018-11-18 10:19:56,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:56,906 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:56,907 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:56,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 76 [2018-11-18 10:19:56,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:56,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 98 [2018-11-18 10:19:56,987 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:56,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2018-11-18 10:19:56,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:57,060 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-18 10:19:57,061 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:162, output treesize:164 [2018-11-18 10:19:57,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 111 treesize of output 120 [2018-11-18 10:19:57,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:19:57,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 114 [2018-11-18 10:19:57,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:58,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 91 [2018-11-18 10:19:58,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 10:19:58,971 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-18 10:19:59,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 109 [2018-11-18 10:19:59,464 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 10:19:59,748 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-18 10:20:00,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 83 [2018-11-18 10:20:00,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 80 [2018-11-18 10:20:00,177 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 10:20:00,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 64 [2018-11-18 10:20:00,297 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 10:20:00,356 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-18 10:20:00,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2018-11-18 10:20:00,657 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:190, output treesize:412 [2018-11-18 10:20:00,994 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 122 [2018-11-18 10:20:01,243 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-11-18 10:20:01,277 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 10:20:01,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:20:01,423 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:20:01,424 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:20:01,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-18 10:20:01,426 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-18 10:20:01,549 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:20:01,550 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:20:01,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 115 [2018-11-18 10:20:01,551 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-18 10:20:01,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2018-11-18 10:20:01,755 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:333, output treesize:190 [2018-11-18 10:20:01,988 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2018-11-18 10:20:02,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 53 [2018-11-18 10:20:02,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 10:20:02,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:20:02,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-11-18 10:20:02,032 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 10:20:02,051 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:20:02,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-18 10:20:02,052 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:20:02,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:20:02,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 91 [2018-11-18 10:20:02,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 65 [2018-11-18 10:20:02,168 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:20:02,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 56 [2018-11-18 10:20:02,372 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 10:20:02,559 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:20:02,563 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:20:02,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 78 [2018-11-18 10:20:02,611 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-18 10:20:02,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2018-11-18 10:20:02,843 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 10:20:03,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2018-11-18 10:20:03,047 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 10:20:03,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2018-11-18 10:20:03,050 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 10:20:03,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 61 [2018-11-18 10:20:03,231 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 10:20:03,389 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:20:03,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 56 [2018-11-18 10:20:03,392 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 10:20:03,550 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:20:03,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2018-11-18 10:20:03,553 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 10:20:03,613 INFO L267 ElimStorePlain]: Start of recursive call 6: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:20:03,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 10:20:03,632 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 11 variables, input treesize:184, output treesize:35 [2018-11-18 10:20:03,760 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-18 10:20:03,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:20:04,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-18 10:20:04,140 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-18 10:20:04,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-18 10:20:04,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:69 [2018-11-18 10:20:19,175 WARN L180 SmtUtils]: Spent 6.61 s on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-11-18 10:20:28,916 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 47 [2018-11-18 10:20:54,774 WARN L180 SmtUtils]: Spent 9.54 s on a formula simplification that was a NOOP. DAG size: 55 [2018-11-18 10:21:15,576 WARN L180 SmtUtils]: Spent 8.65 s on a formula simplification that was a NOOP. DAG size: 54 [2018-11-18 10:21:44,277 WARN L180 SmtUtils]: Spent 11.26 s on a formula simplification that was a NOOP. DAG size: 58 [2018-11-18 10:21:44,475 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2018-11-18 10:21:44,479 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:21:44,480 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:21:44,481 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:21:44,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 88 [2018-11-18 10:21:44,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:21:44,557 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:21:44,559 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:21:44,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 153 [2018-11-18 10:21:44,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:21:44,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-18 10:21:44,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:160, output treesize:242 [2018-11-18 10:21:46,793 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 51 [2018-11-18 10:22:08,937 WARN L180 SmtUtils]: Spent 10.15 s on a formula simplification that was a NOOP. DAG size: 63 [2018-11-18 10:22:39,344 WARN L180 SmtUtils]: Spent 10.11 s on a formula simplification that was a NOOP. DAG size: 68 [2018-11-18 10:23:15,470 WARN L180 SmtUtils]: Spent 12.65 s on a formula simplification that was a NOOP. DAG size: 68 [2018-11-18 10:23:15,478 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:15,479 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:15,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 277 treesize of output 268 [2018-11-18 10:23:15,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:23:15,639 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:15,640 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:15,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 151 [2018-11-18 10:23:15,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:23:15,797 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-18 10:23:15,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:438, output treesize:413 [2018-11-18 10:23:26,652 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 62 [2018-11-18 10:23:26,666 INFO L477 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 321 treesize of output 202 [2018-11-18 10:23:26,780 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2018-11-18 10:23:26,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-18 10:23:26,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:23:26,845 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:26,848 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:23:26,863 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:26,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 121 [2018-11-18 10:23:27,012 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-11-18 10:23:27,159 INFO L477 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 60 [2018-11-18 10:23:27,795 WARN L180 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 107 [2018-11-18 10:23:27,801 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:27,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2018-11-18 10:23:27,805 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 10:23:28,675 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:28,677 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:23:28,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-18 10:23:28,682 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:23:28,889 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:28,890 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:23:28,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-11-18 10:23:28,895 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 10:23:29,117 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:23:29,206 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:29,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 76 [2018-11-18 10:23:29,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-11-18 10:23:29,312 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:29,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-11-18 10:23:29,313 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 10:23:29,326 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:23:29,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2018-11-18 10:23:29,376 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:29,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-11-18 10:23:29,377 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 10:23:29,392 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:29,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-11-18 10:23:29,396 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 10:23:29,400 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:23:29,405 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:23:29,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 90 [2018-11-18 10:23:30,058 WARN L180 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 97 [2018-11-18 10:23:30,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2018-11-18 10:23:30,092 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:30,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-11-18 10:23:30,093 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 10:23:30,161 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:23:30,162 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-18 10:23:30,162 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 10:23:30,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 76 treesize of output 79 [2018-11-18 10:23:30,204 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:30,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-11-18 10:23:30,205 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 10:23:30,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2018-11-18 10:23:30,331 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-11-18 10:23:30,872 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:23:34,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-11-18 10:23:34,414 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:34,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-11-18 10:23:34,416 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-18 10:23:34,475 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:23:34,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2018-11-18 10:23:34,626 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:34,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-11-18 10:23:34,627 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 10:23:34,665 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:34,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-11-18 10:23:34,668 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-18 10:23:34,684 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:23:35,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 59 [2018-11-18 10:23:35,072 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:35,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2018-11-18 10:23:35,077 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-18 10:23:35,144 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:23:35,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2018-11-18 10:23:35,169 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-18 10:23:35,407 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 10:23:35,407 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_arrayElimCell_92 term size 22 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.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:429) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 10:23:35,409 INFO L168 Benchmark]: Toolchain (without parser) took 248247.64 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.4 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -106.7 MB). Peak memory consumption was 456.2 MB. Max. memory is 11.5 GB. [2018-11-18 10:23:35,410 INFO L168 Benchmark]: CDTParser took 0.15 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-18 10:23:35,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2018-11-18 10:23:35,410 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-11-18 10:23:35,410 INFO L168 Benchmark]: Boogie Preprocessor took 23.84 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-18 10:23:35,410 INFO L168 Benchmark]: RCFGBuilder took 551.74 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: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. [2018-11-18 10:23:35,411 INFO L168 Benchmark]: TraceAbstraction took 247270.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 449.1 MB. Max. memory is 11.5 GB. [2018-11-18 10:23:35,412 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 378.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.84 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 551.74 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: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 247270.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 449.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_92 term size 22 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_92 term size 22: 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...