./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 06:47:52,194 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 06:47:52,195 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 06:47:52,201 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 06:47:52,201 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 06:47:52,202 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 06:47:52,202 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 06:47:52,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 06:47:52,204 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 06:47:52,205 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 06:47:52,205 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 06:47:52,205 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 06:47:52,206 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 06:47:52,206 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 06:47:52,207 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 06:47:52,207 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 06:47:52,208 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 06:47:52,209 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 06:47:52,210 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 06:47:52,210 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 06:47:52,211 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 06:47:52,212 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 06:47:52,213 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 06:47:52,213 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 06:47:52,213 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 06:47:52,213 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 06:47:52,214 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 06:47:52,214 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 06:47:52,215 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 06:47:52,215 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 06:47:52,215 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 06:47:52,216 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 06:47:52,216 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 06:47:52,216 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 06:47:52,217 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 06:47:52,217 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 06:47:52,217 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2018-12-09 06:47:52,225 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 06:47:52,225 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 06:47:52,225 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 06:47:52,225 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 06:47:52,226 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 06:47:52,226 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 06:47:52,226 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 06:47:52,226 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 06:47:52,226 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 06:47:52,226 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 06:47:52,227 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 06:47:52,227 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 06:47:52,227 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 06:47:52,227 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 06:47:52,227 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 06:47:52,227 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 06:47:52,227 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 06:47:52,227 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 06:47:52,228 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 06:47:52,228 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 06:47:52,228 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 06:47:52,228 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 06:47:52,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 06:47:52,228 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 06:47:52,228 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 06:47:52,228 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 06:47:52,229 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 06:47:52,229 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer 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 -> Automizer 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 -> 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 [2018-12-09 06:47:52,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 06:47:52,256 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 06:47:52,259 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 06:47:52,260 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 06:47:52,261 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 06:47:52,261 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/../../sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-12-09 06:47:52,305 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/data/1a1246673/468fc345f0d9440bb7ed2c5f6fb1d810/FLAG2562644aa [2018-12-09 06:47:52,752 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 06:47:52,753 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-12-09 06:47:52,759 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/data/1a1246673/468fc345f0d9440bb7ed2c5f6fb1d810/FLAG2562644aa [2018-12-09 06:47:52,767 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/data/1a1246673/468fc345f0d9440bb7ed2c5f6fb1d810 [2018-12-09 06:47:52,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 06:47:52,769 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 06:47:52,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 06:47:52,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 06:47:52,772 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 06:47:52,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:47:52" (1/1) ... [2018-12-09 06:47:52,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:52, skipping insertion in model container [2018-12-09 06:47:52,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:47:52" (1/1) ... [2018-12-09 06:47:52,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 06:47:52,798 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 06:47:52,959 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 06:47:52,965 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 06:47:53,019 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 06:47:53,045 INFO L195 MainTranslator]: Completed translation [2018-12-09 06:47:53,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:53 WrapperNode [2018-12-09 06:47:53,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 06:47:53,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 06:47:53,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 06:47:53,046 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 06:47:53,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:53" (1/1) ... [2018-12-09 06:47:53,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:53" (1/1) ... [2018-12-09 06:47:53,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:53" (1/1) ... [2018-12-09 06:47:53,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:53" (1/1) ... [2018-12-09 06:47:53,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:53" (1/1) ... [2018-12-09 06:47:53,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:53" (1/1) ... [2018-12-09 06:47:53,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:53" (1/1) ... [2018-12-09 06:47:53,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 06:47:53,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 06:47:53,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 06:47:53,078 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 06:47:53,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 06:47:53,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 06:47:53,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 06:47:53,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-09 06:47:53,111 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2018-12-09 06:47:53,111 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2018-12-09 06:47:53,111 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 06:47:53,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-09 06:47:53,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-09 06:47:53,112 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 06:47:53,112 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 06:47:53,112 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 06:47:53,112 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 06:47:53,112 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 06:47:53,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 06:47:53,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 06:47:53,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 06:47:53,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 06:47:53,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 06:47:53,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 06:47:53,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 06:47:53,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 06:47:53,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 06:47:53,113 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 06:47:53,113 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 06:47:53,113 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 06:47:53,113 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 06:47:53,113 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 06:47:53,113 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 06:47:53,113 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 06:47:53,113 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 06:47:53,113 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 06:47:53,113 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 06:47:53,113 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 06:47:53,113 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 06:47:53,113 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 06:47:53,113 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 06:47:53,114 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 06:47:53,114 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 06:47:53,114 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 06:47:53,114 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 06:47:53,114 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 06:47:53,114 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 06:47:53,114 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 06:47:53,114 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 06:47:53,114 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 06:47:53,115 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 06:47:53,115 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 06:47:53,115 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 06:47:53,115 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 06:47:53,115 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 06:47:53,115 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 06:47:53,115 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 06:47:53,115 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 06:47:53,115 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 06:47:53,116 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 06:47:53,116 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 06:47:53,116 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 06:47:53,116 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 06:47:53,116 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 06:47:53,116 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 06:47:53,116 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 06:47:53,116 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 06:47:53,116 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 06:47:53,117 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 06:47:53,117 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 06:47:53,117 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 06:47:53,117 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 06:47:53,117 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 06:47:53,117 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 06:47:53,117 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 06:47:53,117 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 06:47:53,117 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 06:47:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-09 06:47:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 06:47:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 06:47:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 06:47:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 06:47:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 06:47:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 06:47:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 06:47:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 06:47:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 06:47:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 06:47:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 06:47:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 06:47:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 06:47:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 06:47:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 06:47:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 06:47:53,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 06:47:53,120 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 06:47:53,120 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 06:47:53,120 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 06:47:53,120 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 06:47:53,120 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 06:47:53,120 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 06:47:53,120 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 06:47:53,120 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 06:47:53,121 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 06:47:53,121 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 06:47:53,121 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 06:47:53,121 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 06:47:53,121 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 06:47:53,121 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 06:47:53,121 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 06:47:53,121 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 06:47:53,121 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 06:47:53,121 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 06:47:53,122 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 06:47:53,122 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2018-12-09 06:47:53,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 06:47:53,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 06:47:53,122 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2018-12-09 06:47:53,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 06:47:53,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 06:47:53,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 06:47:53,122 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 06:47:53,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 06:47:53,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 06:47:53,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 06:47:53,363 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 06:47:53,364 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 06:47:53,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:47:53 BoogieIcfgContainer [2018-12-09 06:47:53,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 06:47:53,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 06:47:53,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 06:47:53,367 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 06:47:53,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:47:52" (1/3) ... [2018-12-09 06:47:53,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e3357d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:47:53, skipping insertion in model container [2018-12-09 06:47:53,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:47:53" (2/3) ... [2018-12-09 06:47:53,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e3357d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:47:53, skipping insertion in model container [2018-12-09 06:47:53,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:47:53" (3/3) ... [2018-12-09 06:47:53,370 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search_false-unreach-call_false-valid-memcleanup.i [2018-12-09 06:47:53,378 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 06:47:53,385 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-12-09 06:47:53,399 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-12-09 06:47:53,419 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 06:47:53,420 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 06:47:53,420 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 06:47:53,420 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 06:47:53,420 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 06:47:53,420 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 06:47:53,420 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 06:47:53,420 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 06:47:53,420 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 06:47:53,429 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-12-09 06:47:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 06:47:53,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:47:53,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:47:53,436 INFO L423 AbstractCegarLoop]: === Iteration 1 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:47:53,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:47:53,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1516979211, now seen corresponding path program 1 times [2018-12-09 06:47:53,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:47:53,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:47:53,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:53,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:47:53,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:47:53,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:47:53,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:47:53,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 06:47:53,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:47:53,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:47:53,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:47:53,546 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 3 states. [2018-12-09 06:47:53,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:47:53,610 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-12-09 06:47:53,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:47:53,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-09 06:47:53,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:47:53,617 INFO L225 Difference]: With dead ends: 68 [2018-12-09 06:47:53,617 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 06:47:53,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:47:53,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 06:47:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-09 06:47:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-09 06:47:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-12-09 06:47:53,644 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 9 [2018-12-09 06:47:53,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:47:53,644 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-12-09 06:47:53,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:47:53,644 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-12-09 06:47:53,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 06:47:53,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:47:53,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:47:53,645 INFO L423 AbstractCegarLoop]: === Iteration 2 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:47:53,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:47:53,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1516979210, now seen corresponding path program 1 times [2018-12-09 06:47:53,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:47:53,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:47:53,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:53,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:47:53,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:47:53,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:47:53,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:47:53,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 06:47:53,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:47:53,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:47:53,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:47:53,677 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 3 states. [2018-12-09 06:47:53,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:47:53,701 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-12-09 06:47:53,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:47:53,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-09 06:47:53,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:47:53,702 INFO L225 Difference]: With dead ends: 60 [2018-12-09 06:47:53,702 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 06:47:53,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:47:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 06:47:53,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-09 06:47:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 06:47:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-12-09 06:47:53,707 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 9 [2018-12-09 06:47:53,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:47:53,707 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-12-09 06:47:53,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:47:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-12-09 06:47:53,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 06:47:53,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:47:53,708 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:47:53,708 INFO L423 AbstractCegarLoop]: === Iteration 3 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:47:53,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:47:53,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1399930366, now seen corresponding path program 1 times [2018-12-09 06:47:53,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:47:53,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:47:53,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:53,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:47:53,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:47:53,782 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 06:47:53,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:47:53,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:47:53,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:47:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:47:53,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:47:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 06:47:53,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 06:47:53,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-09 06:47:53,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 06:47:53,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 06:47:53,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 06:47:53,870 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 6 states. [2018-12-09 06:47:54,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:47:54,041 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2018-12-09 06:47:54,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 06:47:54,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-09 06:47:54,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:47:54,043 INFO L225 Difference]: With dead ends: 110 [2018-12-09 06:47:54,043 INFO L226 Difference]: Without dead ends: 110 [2018-12-09 06:47:54,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-12-09 06:47:54,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-09 06:47:54,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 67. [2018-12-09 06:47:54,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 06:47:54,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-12-09 06:47:54,050 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 47 [2018-12-09 06:47:54,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:47:54,050 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-12-09 06:47:54,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 06:47:54,051 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-12-09 06:47:54,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 06:47:54,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:47:54,051 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:47:54,051 INFO L423 AbstractCegarLoop]: === Iteration 4 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:47:54,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:47:54,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1474040255, now seen corresponding path program 1 times [2018-12-09 06:47:54,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:47:54,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:47:54,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:54,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:47:54,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:47:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 06:47:54,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:47:54,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 06:47:54,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 06:47:54,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 06:47:54,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 06:47:54,119 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 5 states. [2018-12-09 06:47:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:47:54,217 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-12-09 06:47:54,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 06:47:54,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-09 06:47:54,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:47:54,219 INFO L225 Difference]: With dead ends: 81 [2018-12-09 06:47:54,219 INFO L226 Difference]: Without dead ends: 81 [2018-12-09 06:47:54,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 06:47:54,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-09 06:47:54,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-12-09 06:47:54,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 06:47:54,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2018-12-09 06:47:54,223 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 50 [2018-12-09 06:47:54,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:47:54,223 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2018-12-09 06:47:54,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 06:47:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2018-12-09 06:47:54,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 06:47:54,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:47:54,225 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:47:54,225 INFO L423 AbstractCegarLoop]: === Iteration 5 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:47:54,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:47:54,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1474040256, now seen corresponding path program 1 times [2018-12-09 06:47:54,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:47:54,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:47:54,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:54,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:47:54,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:47:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 06:47:54,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:47:54,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 06:47:54,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 06:47:54,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 06:47:54,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 06:47:54,313 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 5 states. [2018-12-09 06:47:54,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:47:54,413 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-12-09 06:47:54,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 06:47:54,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-09 06:47:54,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:47:54,414 INFO L225 Difference]: With dead ends: 85 [2018-12-09 06:47:54,414 INFO L226 Difference]: Without dead ends: 85 [2018-12-09 06:47:54,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 06:47:54,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-09 06:47:54,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-12-09 06:47:54,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 06:47:54,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-12-09 06:47:54,417 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 50 [2018-12-09 06:47:54,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:47:54,418 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-12-09 06:47:54,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 06:47:54,418 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-12-09 06:47:54,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 06:47:54,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:47:54,418 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:47:54,419 INFO L423 AbstractCegarLoop]: === Iteration 6 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:47:54,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:47:54,419 INFO L82 PathProgramCache]: Analyzing trace with hash -963000911, now seen corresponding path program 1 times [2018-12-09 06:47:54,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:47:54,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:47:54,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:54,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:47:54,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:47:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 06:47:54,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:47:54,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 06:47:54,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 06:47:54,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 06:47:54,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 06:47:54,470 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 7 states. [2018-12-09 06:47:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:47:54,603 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-12-09 06:47:54,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 06:47:54,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-12-09 06:47:54,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:47:54,604 INFO L225 Difference]: With dead ends: 85 [2018-12-09 06:47:54,604 INFO L226 Difference]: Without dead ends: 85 [2018-12-09 06:47:54,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-09 06:47:54,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-09 06:47:54,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-12-09 06:47:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 06:47:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-12-09 06:47:54,608 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 55 [2018-12-09 06:47:54,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:47:54,609 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-12-09 06:47:54,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 06:47:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-12-09 06:47:54,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 06:47:54,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:47:54,609 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:47:54,610 INFO L423 AbstractCegarLoop]: === Iteration 7 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:47:54,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:47:54,610 INFO L82 PathProgramCache]: Analyzing trace with hash 14257742, now seen corresponding path program 1 times [2018-12-09 06:47:54,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:47:54,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:47:54,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:54,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:47:54,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:47:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-09 06:47:54,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:47:54,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 06:47:54,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 06:47:54,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 06:47:54,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 06:47:54,651 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 6 states. [2018-12-09 06:47:54,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:47:54,742 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-12-09 06:47:54,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 06:47:54,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-12-09 06:47:54,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:47:54,744 INFO L225 Difference]: With dead ends: 85 [2018-12-09 06:47:54,744 INFO L226 Difference]: Without dead ends: 85 [2018-12-09 06:47:54,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 06:47:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-09 06:47:54,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-12-09 06:47:54,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-09 06:47:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-12-09 06:47:54,749 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 57 [2018-12-09 06:47:54,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:47:54,749 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-12-09 06:47:54,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 06:47:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-12-09 06:47:54,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 06:47:54,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:47:54,751 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:47:54,751 INFO L423 AbstractCegarLoop]: === Iteration 8 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:47:54,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:47:54,751 INFO L82 PathProgramCache]: Analyzing trace with hash 14257743, now seen corresponding path program 1 times [2018-12-09 06:47:54,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:47:54,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:47:54,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:54,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:47:54,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:47:54,824 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 06:47:54,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:47:54,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 06:47:54,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 06:47:54,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 06:47:54,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 06:47:54,825 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-12-09 06:47:54,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:47:54,975 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-12-09 06:47:54,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 06:47:54,975 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-12-09 06:47:54,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:47:54,976 INFO L225 Difference]: With dead ends: 109 [2018-12-09 06:47:54,976 INFO L226 Difference]: Without dead ends: 109 [2018-12-09 06:47:54,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-09 06:47:54,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-09 06:47:54,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2018-12-09 06:47:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-09 06:47:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-12-09 06:47:54,979 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 57 [2018-12-09 06:47:54,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:47:54,980 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-12-09 06:47:54,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 06:47:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-12-09 06:47:54,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 06:47:54,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:47:54,980 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:47:54,980 INFO L423 AbstractCegarLoop]: === Iteration 9 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:47:54,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:47:54,981 INFO L82 PathProgramCache]: Analyzing trace with hash 64797246, now seen corresponding path program 1 times [2018-12-09 06:47:54,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:47:54,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:47:54,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:54,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:47:54,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:47:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 06:47:55,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:47:55,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:47:55,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:47:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:47:55,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:47:55,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 06:47:55,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 06:47:55,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:47:55,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:47:55,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:47:55,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-12-09 06:47:55,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:47:55,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:47:55,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-12-09 06:47:55,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:47:55,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:47:55,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2018-12-09 06:47:55,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-09 06:47:55,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-09 06:47:55,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:47:55,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:47:55,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:47:55,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2018-12-09 06:47:55,468 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 06:47:55,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 06:47:55,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-12-09 06:47:55,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 06:47:55,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 06:47:55,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-12-09 06:47:55,485 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 21 states. [2018-12-09 06:47:56,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:47:56,084 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-12-09 06:47:56,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 06:47:56,085 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2018-12-09 06:47:56,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:47:56,085 INFO L225 Difference]: With dead ends: 112 [2018-12-09 06:47:56,085 INFO L226 Difference]: Without dead ends: 112 [2018-12-09 06:47:56,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 06:47:56,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-09 06:47:56,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2018-12-09 06:47:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-09 06:47:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2018-12-09 06:47:56,090 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 57 [2018-12-09 06:47:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:47:56,091 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2018-12-09 06:47:56,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 06:47:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2018-12-09 06:47:56,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 06:47:56,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:47:56,091 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:47:56,092 INFO L423 AbstractCegarLoop]: === Iteration 10 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:47:56,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:47:56,092 INFO L82 PathProgramCache]: Analyzing trace with hash 64797247, now seen corresponding path program 1 times [2018-12-09 06:47:56,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:47:56,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:47:56,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:56,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:47:56,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:47:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 06:47:56,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:47:56,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:47:56,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:47:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:47:56,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:47:56,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 06:47:56,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:47:56,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:47:56,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 06:47:56,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 06:47:56,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 06:47:56,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:47:56,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:47:56,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 06:47:56,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 06:47:56,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:47:56,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:47:56,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:47:56,478 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-12-09 06:47:56,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-12-09 06:47:56,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:47:56,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:47:56,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2018-12-09 06:47:56,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 06:47:56,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 06:47:56,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:47:56,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:47:56,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 06:47:56,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 06:47:56,572 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:47:56,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:47:56,576 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-12-09 06:47:56,576 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:14 [2018-12-09 06:47:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 06:47:56,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 06:47:56,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 18 [2018-12-09 06:47:56,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 06:47:56,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 06:47:56,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-12-09 06:47:56,617 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 19 states. [2018-12-09 06:47:57,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:47:57,423 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2018-12-09 06:47:57,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 06:47:57,423 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-12-09 06:47:57,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:47:57,424 INFO L225 Difference]: With dead ends: 116 [2018-12-09 06:47:57,424 INFO L226 Difference]: Without dead ends: 116 [2018-12-09 06:47:57,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2018-12-09 06:47:57,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-09 06:47:57,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2018-12-09 06:47:57,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 06:47:57,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2018-12-09 06:47:57,428 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 57 [2018-12-09 06:47:57,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:47:57,428 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2018-12-09 06:47:57,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 06:47:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2018-12-09 06:47:57,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 06:47:57,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:47:57,428 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:47:57,429 INFO L423 AbstractCegarLoop]: === Iteration 11 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:47:57,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:47:57,429 INFO L82 PathProgramCache]: Analyzing trace with hash 561616018, now seen corresponding path program 1 times [2018-12-09 06:47:57,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:47:57,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:47:57,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:57,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:47:57,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:47:57,598 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 06:47:57,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:47:57,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:47:57,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:47:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:47:57,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:47:57,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 06:47:57,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 06:47:57,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:47:57,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:47:57,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:47:57,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-09 06:47:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 06:47:57,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 06:47:57,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 20 [2018-12-09 06:47:57,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 06:47:57,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 06:47:57,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-12-09 06:47:57,816 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 20 states. [2018-12-09 06:47:58,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:47:58,252 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-12-09 06:47:58,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 06:47:58,252 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-12-09 06:47:58,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:47:58,253 INFO L225 Difference]: With dead ends: 112 [2018-12-09 06:47:58,253 INFO L226 Difference]: Without dead ends: 112 [2018-12-09 06:47:58,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2018-12-09 06:47:58,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-09 06:47:58,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2018-12-09 06:47:58,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-09 06:47:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-12-09 06:47:58,257 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 62 [2018-12-09 06:47:58,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:47:58,257 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-12-09 06:47:58,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 06:47:58,258 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-12-09 06:47:58,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 06:47:58,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:47:58,259 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:47:58,259 INFO L423 AbstractCegarLoop]: === Iteration 12 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:47:58,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:47:58,259 INFO L82 PathProgramCache]: Analyzing trace with hash 587278576, now seen corresponding path program 1 times [2018-12-09 06:47:58,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:47:58,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:47:58,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:58,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:47:58,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:47:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-09 06:47:58,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:47:58,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 06:47:58,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 06:47:58,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 06:47:58,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 06:47:58,318 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 6 states. [2018-12-09 06:47:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:47:58,382 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-12-09 06:47:58,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 06:47:58,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-09 06:47:58,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:47:58,384 INFO L225 Difference]: With dead ends: 98 [2018-12-09 06:47:58,384 INFO L226 Difference]: Without dead ends: 98 [2018-12-09 06:47:58,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 06:47:58,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-09 06:47:58,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2018-12-09 06:47:58,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-09 06:47:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-12-09 06:47:58,388 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 64 [2018-12-09 06:47:58,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:47:58,388 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-12-09 06:47:58,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 06:47:58,388 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-12-09 06:47:58,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 06:47:58,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:47:58,389 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:47:58,390 INFO L423 AbstractCegarLoop]: === Iteration 13 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:47:58,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:47:58,390 INFO L82 PathProgramCache]: Analyzing trace with hash 637818079, now seen corresponding path program 2 times [2018-12-09 06:47:58,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:47:58,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:47:58,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:58,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:47:58,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:47:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:47:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 06:47:58,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:47:58,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:47:59,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 06:47:59,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 06:47:59,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 06:47:59,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:47:59,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 06:47:59,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 06:47:59,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:47:59,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:47:59,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:47:59,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-12-09 06:47:59,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:47:59,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:47:59,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-12-09 06:47:59,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:47:59,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:47:59,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2018-12-09 06:47:59,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:47:59,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:47:59,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:47:59,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:36 [2018-12-09 06:47:59,316 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:47:59,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:47:59,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 06:47:59,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 06:47:59,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:47:59,336 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:47:59,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:47:59,344 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2018-12-09 06:47:59,739 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 06:48:00,133 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 06:48:00,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:48:00,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:48:00,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:48:00,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 70 [2018-12-09 06:48:00,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:00,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:48:00,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 81 [2018-12-09 06:48:00,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-09 06:48:00,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:48:00,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-12-09 06:48:00,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:00,168 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:00,174 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:00,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:00,185 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:78, output treesize:102 [2018-12-09 06:48:00,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2018-12-09 06:48:00,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2018-12-09 06:48:00,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:00,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:00,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:48:00,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:72 [2018-12-09 06:48:00,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:48:00,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:48:00,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2018-12-09 06:48:00,394 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2018-12-09 06:48:00,395 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 06:48:00,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-12-09 06:48:00,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:48:00,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:48:00,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 06:48:00,414 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:67, output treesize:28 [2018-12-09 06:48:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 40 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 06:48:00,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 06:48:00,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 37 [2018-12-09 06:48:00,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-09 06:48:00,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-09 06:48:00,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1263, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 06:48:00,508 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 38 states. [2018-12-09 06:48:01,870 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2018-12-09 06:48:02,667 WARN L180 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-12-09 06:48:03,937 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2018-12-09 06:48:04,751 WARN L180 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2018-12-09 06:48:06,033 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-12-09 06:48:06,904 WARN L180 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2018-12-09 06:48:08,296 WARN L180 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2018-12-09 06:48:08,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:48:08,814 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2018-12-09 06:48:08,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-09 06:48:08,814 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 64 [2018-12-09 06:48:08,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:48:08,815 INFO L225 Difference]: With dead ends: 128 [2018-12-09 06:48:08,815 INFO L226 Difference]: Without dead ends: 128 [2018-12-09 06:48:08,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=497, Invalid=3163, Unknown=0, NotChecked=0, Total=3660 [2018-12-09 06:48:08,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-09 06:48:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2018-12-09 06:48:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-09 06:48:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2018-12-09 06:48:08,818 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 64 [2018-12-09 06:48:08,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:48:08,819 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2018-12-09 06:48:08,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-09 06:48:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2018-12-09 06:48:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 06:48:08,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:48:08,820 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:48:08,820 INFO L423 AbstractCegarLoop]: === Iteration 14 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:48:08,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:08,820 INFO L82 PathProgramCache]: Analyzing trace with hash 637818080, now seen corresponding path program 2 times [2018-12-09 06:48:08,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:48:08,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:48:08,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:08,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:48:08,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:48:09,458 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2018-12-09 06:48:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 24 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 06:48:09,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:48:09,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:48:09,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 06:48:09,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 06:48:09,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 06:48:09,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:48:09,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 06:48:09,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:09,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:09,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 06:48:09,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 06:48:09,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 06:48:09,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:09,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:09,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 06:48:09,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 06:48:09,992 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:09,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:09,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:09,999 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-12-09 06:48:10,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-12-09 06:48:10,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:10,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:10,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:34 [2018-12-09 06:48:10,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:10,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:10,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:10,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:10,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:10,317 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2018-12-09 06:48:10,318 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:48:10,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:48:10,332 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:48:10,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:48:10,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 06:48:10,342 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:47 [2018-12-09 06:48:13,128 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-09 06:48:14,136 WARN L180 SmtUtils]: Spent 965.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-09 06:48:14,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:48:14,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-12-09 06:48:14,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:14,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:48:14,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:48:14,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 06:48:14,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:14,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-12-09 06:48:14,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-09 06:48:14,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:48:14,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 06:48:14,182 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:14,187 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:14,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:14,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2018-12-09 06:48:14,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-09 06:48:14,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:48:14,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 06:48:14,209 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:14,213 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:14,217 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:14,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:14,227 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:73, output treesize:67 [2018-12-09 06:48:14,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 61 [2018-12-09 06:48:14,479 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:48:14,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 06:48:14,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:14,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-12-09 06:48:14,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:48:14,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:48:14,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-12-09 06:48:14,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-12-09 06:48:14,505 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:14,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 06:48:14,509 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:14,510 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:14,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 06:48:14,515 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:88, output treesize:23 [2018-12-09 06:48:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 35 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 06:48:14,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 06:48:14,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 42 [2018-12-09 06:48:14,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-09 06:48:14,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-09 06:48:14,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1650, Unknown=2, NotChecked=0, Total=1806 [2018-12-09 06:48:14,631 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 43 states. [2018-12-09 06:48:17,643 WARN L180 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2018-12-09 06:48:23,759 WARN L180 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 94 DAG size of output: 61 [2018-12-09 06:48:26,259 WARN L180 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2018-12-09 06:48:28,963 WARN L180 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2018-12-09 06:48:34,983 WARN L180 SmtUtils]: Spent 5.97 s on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2018-12-09 06:48:38,007 WARN L180 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2018-12-09 06:48:44,409 WARN L180 SmtUtils]: Spent 6.34 s on a formula simplification. DAG size of input: 109 DAG size of output: 76 [2018-12-09 06:48:47,567 WARN L180 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2018-12-09 06:48:48,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:48:48,499 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2018-12-09 06:48:48,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-09 06:48:48,499 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 64 [2018-12-09 06:48:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:48:48,500 INFO L225 Difference]: With dead ends: 132 [2018-12-09 06:48:48,500 INFO L226 Difference]: Without dead ends: 132 [2018-12-09 06:48:48,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1192 ImplicationChecksByTransitivity, 37.8s TimeCoverageRelationStatistics Valid=636, Invalid=4192, Unknown=2, NotChecked=0, Total=4830 [2018-12-09 06:48:48,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-09 06:48:48,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 107. [2018-12-09 06:48:48,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 06:48:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2018-12-09 06:48:48,503 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 64 [2018-12-09 06:48:48,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:48:48,503 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2018-12-09 06:48:48,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-09 06:48:48,503 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2018-12-09 06:48:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 06:48:48,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:48:48,504 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:48:48,504 INFO L423 AbstractCegarLoop]: === Iteration 15 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:48:48,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:48,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1941419947, now seen corresponding path program 1 times [2018-12-09 06:48:48,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:48:48,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:48:48,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:48,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:48:48,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:48:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-09 06:48:48,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:48:48,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 06:48:48,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 06:48:48,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 06:48:48,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-09 06:48:48,585 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 12 states. [2018-12-09 06:48:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:48:48,727 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2018-12-09 06:48:48,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 06:48:48,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-12-09 06:48:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:48:48,728 INFO L225 Difference]: With dead ends: 108 [2018-12-09 06:48:48,728 INFO L226 Difference]: Without dead ends: 102 [2018-12-09 06:48:48,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-12-09 06:48:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-09 06:48:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-09 06:48:48,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-09 06:48:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-12-09 06:48:48,730 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 70 [2018-12-09 06:48:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:48:48,730 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-12-09 06:48:48,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 06:48:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-12-09 06:48:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 06:48:48,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:48:48,731 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:48:48,731 INFO L423 AbstractCegarLoop]: === Iteration 16 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:48:48,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:48:48,731 INFO L82 PathProgramCache]: Analyzing trace with hash 482244241, now seen corresponding path program 2 times [2018-12-09 06:48:48,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:48:48,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:48:48,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:48,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:48:48,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:48:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:48:49,369 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 06:48:49,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:48:49,370 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:48:49,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 06:48:49,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 06:48:49,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 06:48:49,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:48:49,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 06:48:49,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 06:48:49,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:49,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:49,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:49,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-09 06:48:49,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:49,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:49,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:49,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:30 [2018-12-09 06:48:49,681 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:48:49,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:48:49,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 06:48:49,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 06:48:49,692 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:49,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:49,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:48:49,698 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:34 [2018-12-09 06:48:50,519 WARN L180 SmtUtils]: Spent 424.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-09 06:48:51,103 WARN L180 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-09 06:48:51,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:48:51,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:48:51,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 06:48:51,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:51,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-09 06:48:51,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-09 06:48:51,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:48:51,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 06:48:51,129 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:48:51,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:51,136 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:51,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:48:51,142 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-12-09 06:48:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 23 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 06:48:51,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 06:48:51,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 22] total 53 [2018-12-09 06:48:51,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-09 06:48:51,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-09 06:48:51,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2565, Unknown=1, NotChecked=0, Total=2756 [2018-12-09 06:48:51,439 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 53 states. [2018-12-09 06:48:52,609 WARN L180 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-12-09 06:48:54,728 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2018-12-09 06:48:55,799 WARN L180 SmtUtils]: Spent 978.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2018-12-09 06:48:56,940 WARN L180 SmtUtils]: Spent 916.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-12-09 06:48:59,084 WARN L180 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-12-09 06:49:00,370 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2018-12-09 06:49:02,696 WARN L180 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2018-12-09 06:49:04,720 WARN L180 SmtUtils]: Spent 935.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2018-12-09 06:49:05,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:49:05,872 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-12-09 06:49:05,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-09 06:49:05,872 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 69 [2018-12-09 06:49:05,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:49:05,873 INFO L225 Difference]: With dead ends: 114 [2018-12-09 06:49:05,873 INFO L226 Difference]: Without dead ends: 114 [2018-12-09 06:49:05,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=1004, Invalid=7005, Unknown=1, NotChecked=0, Total=8010 [2018-12-09 06:49:05,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-09 06:49:05,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2018-12-09 06:49:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-09 06:49:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-12-09 06:49:05,876 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 69 [2018-12-09 06:49:05,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:49:05,876 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-12-09 06:49:05,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-09 06:49:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-12-09 06:49:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 06:49:05,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:49:05,877 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:49:05,877 INFO L423 AbstractCegarLoop]: === Iteration 17 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:49:05,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:49:05,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1670951710, now seen corresponding path program 3 times [2018-12-09 06:49:05,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:49:05,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:49:05,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:49:05,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:49:05,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:49:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:49:06,804 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2018-12-09 06:49:07,411 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:49:07,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:49:07,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:49:07,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 06:49:07,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 06:49:07,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 06:49:07,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:49:07,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 06:49:07,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 06:49:07,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:07,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:07,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:07,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-12-09 06:49:07,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:07,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:07,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-12-09 06:49:07,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:07,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:07,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2018-12-09 06:49:07,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:07,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:07,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:07,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:36 [2018-12-09 06:49:07,901 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:07,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:07,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 06:49:07,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 06:49:07,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:07,916 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:07,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:07,922 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2018-12-09 06:49:09,139 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 06:49:09,560 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 06:49:09,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:09,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:09,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:09,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-12-09 06:49:09,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:09,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:09,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 57 [2018-12-09 06:49:09,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-09 06:49:09,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:09,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-12-09 06:49:09,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:09,591 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:09,596 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:09,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:09,606 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:78 [2018-12-09 06:49:09,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:09,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:09,799 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:09,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:09,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:09,808 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2018-12-09 06:49:09,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:09,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:09,824 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:09,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:09,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:09,839 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:47 [2018-12-09 06:49:18,092 WARN L180 SmtUtils]: Spent 944.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-12-09 06:49:20,101 WARN L180 SmtUtils]: Spent 832.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-12-09 06:49:20,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:20,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:20,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:20,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:20,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:20,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 103 [2018-12-09 06:49:20,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:20,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-12-09 06:49:20,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-09 06:49:20,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:20,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 06:49:20,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:20,148 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:20,153 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:20,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:20,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:20,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:20,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:20,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 123 [2018-12-09 06:49:20,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-12-09 06:49:20,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:20,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-12-09 06:49:20,182 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:20,187 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:20,197 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:20,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:20,217 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:109, output treesize:146 [2018-12-09 06:49:20,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:20,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-12-09 06:49:20,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2018-12-09 06:49:20,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:20,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 06:49:20,515 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:20,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:20,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:20,526 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:157, output treesize:119 [2018-12-09 06:49:20,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:20,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:20,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:20,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:20,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:20,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:20,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 91 [2018-12-09 06:49:20,718 INFO L478 Elim1Store]: Elim1 applied some 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 58 [2018-12-09 06:49:20,721 INFO L267 ElimStorePlain]: Start of recursive call 3: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-12-09 06:49:20,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2018-12-09 06:49:20,775 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:20,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2018-12-09 06:49:20,780 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 06:49:20,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2018-12-09 06:49:20,781 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:20,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 49 [2018-12-09 06:49:20,784 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:20,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2018-12-09 06:49:20,790 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-09 06:49:20,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2018-12-09 06:49:20,795 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-09 06:49:20,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2018-12-09 06:49:20,800 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 06:49:20,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-12-09 06:49:20,889 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:20,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-12-09 06:49:20,892 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:20,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-12-09 06:49:20,893 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:20,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 [2018-12-09 06:49:20,901 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 06:49:20,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 [2018-12-09 06:49:20,906 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 06:49:20,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 52 [2018-12-09 06:49:20,911 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 06:49:20,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 52 [2018-12-09 06:49:20,916 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 06:49:21,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2018-12-09 06:49:21,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 33 dim-0 vars, and 11 xjuncts. [2018-12-09 06:49:21,165 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:120, output treesize:496 [2018-12-09 06:49:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:49:21,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 06:49:21,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 53 [2018-12-09 06:49:21,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-09 06:49:21,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-09 06:49:21,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2608, Unknown=12, NotChecked=0, Total=2862 [2018-12-09 06:49:21,465 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 54 states. [2018-12-09 06:49:25,075 WARN L180 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2018-12-09 06:49:27,099 WARN L180 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2018-12-09 06:49:30,895 WARN L180 SmtUtils]: Spent 3.51 s on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-12-09 06:49:33,000 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2018-12-09 06:49:37,117 WARN L180 SmtUtils]: Spent 3.83 s on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2018-12-09 06:49:39,356 WARN L180 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2018-12-09 06:49:43,441 WARN L180 SmtUtils]: Spent 3.81 s on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2018-12-09 06:49:45,901 WARN L180 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2018-12-09 06:49:47,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:49:47,457 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-12-09 06:49:47,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-09 06:49:47,457 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 71 [2018-12-09 06:49:47,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:49:47,458 INFO L225 Difference]: With dead ends: 126 [2018-12-09 06:49:47,458 INFO L226 Difference]: Without dead ends: 126 [2018-12-09 06:49:47,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2036 ImplicationChecksByTransitivity, 38.8s TimeCoverageRelationStatistics Valid=782, Invalid=5848, Unknown=12, NotChecked=0, Total=6642 [2018-12-09 06:49:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-09 06:49:47,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2018-12-09 06:49:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-09 06:49:47,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-12-09 06:49:47,461 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 71 [2018-12-09 06:49:47,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:49:47,461 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-12-09 06:49:47,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-09 06:49:47,461 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-12-09 06:49:47,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 06:49:47,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:49:47,461 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:49:47,462 INFO L423 AbstractCegarLoop]: === Iteration 18 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:49:47,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:49:47,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1670951711, now seen corresponding path program 3 times [2018-12-09 06:49:47,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:49:47,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:49:47,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:49:47,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:49:47,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:49:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:49:48,395 WARN L180 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2018-12-09 06:49:48,876 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-12-09 06:49:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 11 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 06:49:49,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:49:49,699 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:49:49,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 06:49:49,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 06:49:49,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 06:49:49,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:49:49,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 06:49:49,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:49,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:49,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 06:49:49,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 06:49:49,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 06:49:49,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:49,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:49,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 06:49:49,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 06:49:49,952 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:49,953 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:49,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:49,959 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-12-09 06:49:50,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:50,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:50,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-12-09 06:49:50,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:50,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-09 06:49:50,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:50,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:50,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:55 [2018-12-09 06:49:50,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:50,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:50,476 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:50,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:50,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:50,489 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:87, output treesize:57 [2018-12-09 06:49:50,490 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:50,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:50,504 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:50,506 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:50,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:50,514 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:53 [2018-12-09 06:49:56,309 WARN L180 SmtUtils]: Spent 959.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-12-09 06:49:58,030 WARN L180 SmtUtils]: Spent 986.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-12-09 06:49:58,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:58,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:58,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 40 [2018-12-09 06:49:58,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:58,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:58,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:58,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:58,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-12-09 06:49:58,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:58,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:58,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 66 [2018-12-09 06:49:58,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-09 06:49:58,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:58,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-12-09 06:49:58,094 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:58,098 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:58,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:58,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:58,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2018-12-09 06:49:58,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-09 06:49:58,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:49:58,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 06:49:58,131 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:58,134 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:58,138 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:58,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:58,153 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:96, output treesize:122 [2018-12-09 06:49:58,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:58,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:58,411 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:49:58,413 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:58,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:49:58,421 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2018-12-09 06:49:58,422 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:58,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:58,435 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:58,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:58,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 06:49:58,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:47 [2018-12-09 06:50:09,783 WARN L180 SmtUtils]: Spent 963.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-09 06:50:11,445 WARN L180 SmtUtils]: Spent 857.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-09 06:50:11,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:11,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:11,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:11,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:11,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 93 [2018-12-09 06:50:11,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:11,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:11,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:11,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:11,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:11,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:11,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-12-09 06:50:11,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:11,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:11,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:11,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:11,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:11,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 134 [2018-12-09 06:50:11,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-12-09 06:50:11,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:11,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-12-09 06:50:11,526 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:11,532 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:11,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:11,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:11,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:11,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:11,573 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 58 [2018-12-09 06:50:11,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-09 06:50:11,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:11,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 06:50:11,577 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:11,581 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:11,587 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:11,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:11,603 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:147, output treesize:163 [2018-12-09 06:50:12,329 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:50:12,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:12,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:12,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:12,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:12,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:12,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:12,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 190 [2018-12-09 06:50:12,338 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:50:12,352 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 107 [2018-12-09 06:50:12,356 INFO L267 ElimStorePlain]: Start of recursive call 3: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-12-09 06:50:12,447 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:50:12,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 122 [2018-12-09 06:50:12,451 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 06:50:12,454 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:50:12,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 112 [2018-12-09 06:50:12,459 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 06:50:12,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:12,461 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:50:12,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 118 [2018-12-09 06:50:12,463 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:12,464 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:50:12,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 80 [2018-12-09 06:50:12,465 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:12,468 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:50:12,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 106 [2018-12-09 06:50:12,473 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-09 06:50:12,474 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:50:12,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 86 [2018-12-09 06:50:12,475 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:12,477 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:50:12,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 116 [2018-12-09 06:50:12,483 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 06:50:12,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 73 [2018-12-09 06:50:12,630 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:50:12,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:12,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 91 [2018-12-09 06:50:12,633 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:50:12,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 85 [2018-12-09 06:50:12,641 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 06:50:12,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 89 [2018-12-09 06:50:12,647 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 06:50:12,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 73 [2018-12-09 06:50:12,650 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:50:12,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 85 [2018-12-09 06:50:12,660 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 06:50:12,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 95 [2018-12-09 06:50:12,671 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 06:50:12,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2018-12-09 06:50:13,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-09 06:50:13,123 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:50:13,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 06:50:13,123 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 06:50:13,136 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 06:50:13,146 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,154 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-09 06:50:13,159 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:50:13,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-09 06:50:13,159 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 06:50:13,171 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 06:50:13,182 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,190 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-09 06:50:13,194 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:50:13,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-09 06:50:13,195 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 06:50:13,210 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 06:50:13,223 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,231 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-09 06:50:13,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2018-12-09 06:50:13,235 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-12-09 06:50:13,247 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 06:50:13,261 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,269 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-09 06:50:13,273 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:50:13,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-09 06:50:13,273 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 06:50:13,288 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 06:50:13,298 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,308 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-09 06:50:13,312 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:50:13,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-09 06:50:13,313 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 06:50:13,324 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 06:50:13,334 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,344 INFO L267 ElimStorePlain]: Start of recursive call 38: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-09 06:50:13,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2018-12-09 06:50:13,349 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-12-09 06:50:13,361 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 06:50:13,371 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,379 INFO L267 ElimStorePlain]: Start of recursive call 42: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 72 [2018-12-09 06:50:13,384 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:50:13,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 06:50:13,385 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-12-09 06:50:13,401 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 06:50:13,411 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,426 INFO L267 ElimStorePlain]: Start of recursive call 46: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-09 06:50:13,431 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:50:13,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 06:50:13,431 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 06:50:13,444 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 06:50:13,454 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,462 INFO L267 ElimStorePlain]: Start of recursive call 50: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-09 06:50:13,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2018-12-09 06:50:13,467 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-12-09 06:50:13,480 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 06:50:13,490 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,499 INFO L267 ElimStorePlain]: Start of recursive call 54: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-09 06:50:13,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2018-12-09 06:50:13,503 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-12-09 06:50:13,516 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 06:50:13,528 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,537 INFO L267 ElimStorePlain]: Start of recursive call 58: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:13,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 33 dim-0 vars, and 11 xjuncts. [2018-12-09 06:50:13,668 INFO L202 ElimStorePlain]: Needed 61 recursive calls to eliminate 3 variables, input treesize:227, output treesize:529 [2018-12-09 06:50:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 48 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 06:50:14,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 06:50:14,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 52 [2018-12-09 06:50:14,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-09 06:50:14,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-09 06:50:14,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2534, Unknown=18, NotChecked=0, Total=2756 [2018-12-09 06:50:14,024 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 53 states. [2018-12-09 06:50:18,332 WARN L180 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2018-12-09 06:50:20,880 WARN L180 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2018-12-09 06:50:25,549 WARN L180 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2018-12-09 06:50:28,015 WARN L180 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2018-12-09 06:50:32,320 WARN L180 SmtUtils]: Spent 3.83 s on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2018-12-09 06:50:34,881 WARN L180 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2018-12-09 06:50:39,133 WARN L180 SmtUtils]: Spent 3.78 s on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-12-09 06:50:41,853 WARN L180 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2018-12-09 06:50:42,208 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2018-12-09 06:50:42,556 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 106 [2018-12-09 06:50:43,094 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 109 [2018-12-09 06:50:44,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:50:44,578 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2018-12-09 06:50:44,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-09 06:50:44,578 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 71 [2018-12-09 06:50:44,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:50:44,579 INFO L225 Difference]: With dead ends: 127 [2018-12-09 06:50:44,579 INFO L226 Difference]: Without dead ends: 127 [2018-12-09 06:50:44,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 47 SyntacticMatches, 12 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1960 ImplicationChecksByTransitivity, 52.3s TimeCoverageRelationStatistics Valid=800, Invalid=6154, Unknown=18, NotChecked=0, Total=6972 [2018-12-09 06:50:44,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-09 06:50:44,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2018-12-09 06:50:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-09 06:50:44,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-12-09 06:50:44,582 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 71 [2018-12-09 06:50:44,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:50:44,582 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-12-09 06:50:44,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-09 06:50:44,582 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-12-09 06:50:44,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 06:50:44,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:50:44,583 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:50:44,583 INFO L423 AbstractCegarLoop]: === Iteration 19 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:50:44,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:50:44,583 INFO L82 PathProgramCache]: Analyzing trace with hash 246818738, now seen corresponding path program 3 times [2018-12-09 06:50:44,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:50:44,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:50:44,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:50:44,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:50:44,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:50:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:50:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:50:45,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:50:45,838 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:50:45,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 06:50:45,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 06:50:45,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 06:50:45,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:50:45,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 06:50:45,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:45,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:45,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-09 06:50:46,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 06:50:46,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 06:50:46,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:46,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:46,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:46,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-09 06:50:46,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:46,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:46,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:46,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:36 [2018-12-09 06:50:46,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 06:50:46,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 06:50:46,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:46,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:46,320 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:50:46,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:50:46,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:50:46,331 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2018-12-09 06:50:47,553 WARN L180 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 06:50:47,971 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 06:50:47,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:47,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:47,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 06:50:47,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:47,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-09 06:50:47,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-09 06:50:47,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:47,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12-09 06:50:47,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:48,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:48,003 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:48,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:48,011 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:53 [2018-12-09 06:50:48,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 06:50:48,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:48,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:48,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-12-09 06:50:48,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:48,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:48,200 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:48,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:48,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:48,212 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:50 [2018-12-09 06:50:48,214 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:50:48,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:50:48,226 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:50:48,228 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:50:48,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 06:50:48,235 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:46 [2018-12-09 06:50:50,495 WARN L180 SmtUtils]: Spent 976.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-12-09 06:50:51,409 WARN L180 SmtUtils]: Spent 854.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-12-09 06:50:51,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:51,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:51,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:51,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-12-09 06:50:51,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:51,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:51,435 INFO L478 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 45 treesize of output 63 [2018-12-09 06:50:51,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-09 06:50:51,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:51,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-12-09 06:50:51,441 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:51,445 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:51,451 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:51,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:51,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2018-12-09 06:50:51,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-09 06:50:51,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:50:51,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 06:50:51,472 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 06:50:51,476 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:51,480 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:51,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:50:51,491 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:87, output treesize:83 [2018-12-09 06:50:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:50:52,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 06:50:52,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 29] total 68 [2018-12-09 06:50:52,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-09 06:50:52,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-09 06:50:52,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=4306, Unknown=3, NotChecked=0, Total=4556 [2018-12-09 06:50:52,277 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 68 states. [2018-12-09 06:51:07,122 WARN L180 SmtUtils]: Spent 3.49 s on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2018-12-09 06:51:11,654 WARN L180 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 155 DAG size of output: 46 [2018-12-09 06:51:15,925 WARN L180 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 115 DAG size of output: 40 [2018-12-09 06:51:27,669 WARN L180 SmtUtils]: Spent 3.39 s on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2018-12-09 06:51:32,168 WARN L180 SmtUtils]: Spent 4.36 s on a formula simplification. DAG size of input: 159 DAG size of output: 51 [2018-12-09 06:51:39,024 WARN L180 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2018-12-09 06:51:43,270 WARN L180 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 170 DAG size of output: 59 [2018-12-09 06:51:52,856 WARN L180 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2018-12-09 06:51:57,483 WARN L180 SmtUtils]: Spent 4.48 s on a formula simplification. DAG size of input: 179 DAG size of output: 67 [2018-12-09 06:51:59,251 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2018-12-09 06:51:59,552 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2018-12-09 06:52:00,104 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2018-12-09 06:52:00,817 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2018-12-09 06:52:01,998 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2018-12-09 06:52:03,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:52:03,728 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-12-09 06:52:03,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-09 06:52:03,728 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 76 [2018-12-09 06:52:03,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:52:03,729 INFO L225 Difference]: With dead ends: 123 [2018-12-09 06:52:03,729 INFO L226 Difference]: Without dead ends: 123 [2018-12-09 06:52:03,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3431 ImplicationChecksByTransitivity, 56.0s TimeCoverageRelationStatistics Valid=1308, Invalid=10891, Unknown=11, NotChecked=0, Total=12210 [2018-12-09 06:52:03,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-09 06:52:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2018-12-09 06:52:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-09 06:52:03,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2018-12-09 06:52:03,732 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 76 [2018-12-09 06:52:03,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:52:03,732 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2018-12-09 06:52:03,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-09 06:52:03,732 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2018-12-09 06:52:03,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 06:52:03,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:52:03,733 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:52:03,733 INFO L423 AbstractCegarLoop]: === Iteration 20 === [insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-12-09 06:52:03,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:52:03,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1234657281, now seen corresponding path program 4 times [2018-12-09 06:52:03,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:52:03,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:52:03,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:52:03,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:52:03,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:52:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:52:04,367 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2018-12-09 06:52:04,850 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-12-09 06:52:05,299 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2018-12-09 06:52:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 83 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 06:52:06,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:52:06,604 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:52:06,609 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 06:52:06,645 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 06:52:06,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 06:52:06,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:52:06,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 06:52:06,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:52:06,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:52:06,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:06,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:06,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-12-09 06:52:06,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-09 06:52:06,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:52:06,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-09 06:52:06,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:52:06,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:06,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:06,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:16 [2018-12-09 06:52:08,732 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-09 06:52:08,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 06:52:08,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 06:52:08,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:52:08,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:08,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 06:52:08,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 06:52:08,752 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:52:08,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:08,761 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-12-09 06:52:08,762 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-12-09 06:52:10,138 WARN L180 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-09 06:52:10,619 WARN L180 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-09 06:52:10,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:52:10,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:52:10,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-12-09 06:52:10,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:52:10,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-12-09 06:52:10,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-12-09 06:52:10,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:52:10,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-09 06:52:10,645 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:52:10,647 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:10,650 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:10,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:10,657 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:52 [2018-12-09 06:52:11,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:52:11,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:11,367 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:52:11,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:11,381 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-12-09 06:52:11,381 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:92, output treesize:62 [2018-12-09 06:52:12,449 WARN L180 SmtUtils]: Spent 619.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-09 06:52:12,451 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:52:12,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:52:12,470 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:52:12,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:52:12,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 06:52:12,484 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:93, output treesize:69 [2018-12-09 06:52:27,533 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 45 [2018-12-09 06:52:30,615 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 45 [2018-12-09 06:52:30,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:52:30,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:52:30,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:52:30,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-12-09 06:52:30,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:52:30,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-12-09 06:52:30,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-09 06:52:30,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:52:30,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 06:52:30,656 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:52:30,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:30,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:30,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2018-12-09 06:52:30,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 22 [2018-12-09 06:52:30,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:52:30,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-09 06:52:30,696 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 06:52:30,699 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:30,703 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:30,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:52:30,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 68 [2018-12-09 06:52:30,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-09 06:52:30,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:52:30,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-12-09 06:52:30,728 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 06:52:30,735 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:30,742 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:30,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:30,757 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:109, output treesize:108 [2018-12-09 06:52:31,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:52:31,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:31,113 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:52:31,115 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:52:31,124 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-12-09 06:52:31,124 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:56 [2018-12-09 06:52:33,553 WARN L180 SmtUtils]: Spent 542.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-12-09 06:52:33,554 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:52:33,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:52:33,571 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:52:33,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:52:33,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 06:52:33,583 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:63 [2018-12-09 06:52:58,381 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-09 06:53:02,578 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-09 06:53:02,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:02,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:02,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:02,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:02,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:02,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-12-09 06:53:02,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:02,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2018-12-09 06:53:02,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-12-09 06:53:02,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:02,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-09 06:53:02,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:02,635 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:02,641 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:02,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:02,668 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 52 [2018-12-09 06:53:02,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-09 06:53:02,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:02,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 06:53:02,674 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:02,678 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:02,685 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:02,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:02,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:02,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:02,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:02,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 127 [2018-12-09 06:53:02,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-12-09 06:53:02,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:02,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-12-09 06:53:02,714 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:02,719 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:02,729 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:02,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:02,743 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:151, output treesize:134 [2018-12-09 06:53:03,866 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:53:03,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:03,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:03,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:03,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:03,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:03,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:03,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 185 [2018-12-09 06:53:03,878 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:53:03,889 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 102 [2018-12-09 06:53:03,893 INFO L267 ElimStorePlain]: Start of recursive call 3: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-12-09 06:53:03,985 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:53:03,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 113 [2018-12-09 06:53:03,992 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 06:53:03,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:03,994 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:53:03,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 115 [2018-12-09 06:53:03,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:03,998 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:53:04,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 109 [2018-12-09 06:53:04,004 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 06:53:04,006 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:53:04,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 103 [2018-12-09 06:53:04,011 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 06:53:04,013 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:53:04,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2018-12-09 06:53:04,014 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,016 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:53:04,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2018-12-09 06:53:04,016 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,019 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:53:04,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 119 [2018-12-09 06:53:04,025 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 06:53:04,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 77 [2018-12-09 06:53:04,162 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 06:53:04,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-12-09 06:53:04,164 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:53:04,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-12-09 06:53:04,166 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:53:04,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 93 [2018-12-09 06:53:04,172 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 06:53:04,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 77 [2018-12-09 06:53:04,178 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 06:53:04,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 81 [2018-12-09 06:53:04,184 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 06:53:04,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:53:04,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-12-09 06:53:04,187 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:53:04,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2018-12-09 06:53:04,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-12-09 06:53:04,556 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:53:04,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-09 06:53:04,557 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 06:53:04,567 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 06:53:04,575 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,581 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-12-09 06:53:04,586 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:53:04,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 06:53:04,587 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 06:53:04,597 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 06:53:04,606 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,612 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-12-09 06:53:04,616 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:53:04,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 06:53:04,617 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 06:53:04,628 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 06:53:04,636 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,644 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-12-09 06:53:04,649 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:53:04,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 06:53:04,649 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 06:53:04,661 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 06:53:04,670 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,676 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-12-09 06:53:04,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2018-12-09 06:53:04,681 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-12-09 06:53:04,692 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 06:53:04,702 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,708 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-12-09 06:53:04,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2018-12-09 06:53:04,713 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,723 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:53:04,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 06:53:04,724 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 06:53:04,736 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,742 INFO L267 ElimStorePlain]: Start of recursive call 38: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-12-09 06:53:04,747 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:53:04,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 06:53:04,747 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-12-09 06:53:04,757 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 06:53:04,766 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,773 INFO L267 ElimStorePlain]: Start of recursive call 42: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-12-09 06:53:04,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2018-12-09 06:53:04,778 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,789 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:53:04,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 06:53:04,789 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 06:53:04,799 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,805 INFO L267 ElimStorePlain]: Start of recursive call 46: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-12-09 06:53:04,810 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:53:04,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 06:53:04,810 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 1 [2018-12-09 06:53:04,821 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 06:53:04,830 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,836 INFO L267 ElimStorePlain]: Start of recursive call 50: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-12-09 06:53:04,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2018-12-09 06:53:04,841 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-12-09 06:53:04,851 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 06:53:04,860 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,866 INFO L267 ElimStorePlain]: Start of recursive call 54: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-12-09 06:53:04,873 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:53:04,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-09 06:53:04,873 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 06:53:04,884 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 06:53:04,893 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,899 INFO L267 ElimStorePlain]: Start of recursive call 58: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:04,989 INFO L202 ElimStorePlain]: Needed 61 recursive calls to eliminate 3 variables, input treesize:190, output treesize:14 [2018-12-09 06:53:05,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 06:53:05,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 06:53:05,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:53:05,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:05,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:53:05,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-12-09 06:53:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 30 proven. 65 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 06:53:05,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 06:53:05,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 70 [2018-12-09 06:53:05,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-09 06:53:05,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-09 06:53:05,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=4618, Unknown=42, NotChecked=0, Total=4830 [2018-12-09 06:53:05,326 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand 70 states. [2018-12-09 06:53:53,400 WARN L180 SmtUtils]: Spent 6.56 s on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2018-12-09 06:54:00,905 WARN L180 SmtUtils]: Spent 7.11 s on a formula simplification. DAG size of input: 177 DAG size of output: 67 [2018-12-09 06:54:08,381 WARN L180 SmtUtils]: Spent 6.96 s on a formula simplification. DAG size of input: 128 DAG size of output: 61 [2018-12-09 06:54:20,104 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2018-12-09 06:54:41,010 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2018-12-09 06:54:52,244 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2018-12-09 06:54:55,834 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-12-09 06:55:01,154 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 113 [2018-12-09 06:55:01,586 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2018-12-09 06:55:02,028 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 142 [2018-12-09 06:55:02,272 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 124 [2018-12-09 06:55:02,602 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 121 [2018-12-09 06:55:03,013 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 144 [2018-12-09 06:55:03,289 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 121 [2018-12-09 06:55:04,079 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 141 [2018-12-09 06:55:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:55:19,239 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2018-12-09 06:55:19,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-09 06:55:19,239 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 78 [2018-12-09 06:55:19,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:55:19,239 INFO L225 Difference]: With dead ends: 128 [2018-12-09 06:55:19,239 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 06:55:19,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3048 ImplicationChecksByTransitivity, 125.7s TimeCoverageRelationStatistics Valid=933, Invalid=13996, Unknown=77, NotChecked=0, Total=15006 [2018-12-09 06:55:19,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 06:55:19,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 06:55:19,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 06:55:19,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 06:55:19,240 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2018-12-09 06:55:19,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:55:19,240 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 06:55:19,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-09 06:55:19,240 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 06:55:19,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 06:55:19,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:55:19 BoogieIcfgContainer [2018-12-09 06:55:19,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 06:55:19,244 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 06:55:19,244 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 06:55:19,244 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 06:55:19,244 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:47:53" (3/4) ... [2018-12-09 06:55:19,246 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 06:55:19,250 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 06:55:19,250 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure insert_list [2018-12-09 06:55:19,251 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 06:55:19,251 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-09 06:55:19,251 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure search_list [2018-12-09 06:55:19,253 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-09 06:55:19,254 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 06:55:19,254 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 06:55:19,278 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0f2f25de-046e-41d1-811c-7eea03173d0b/bin-2019/uautomizer/witness.graphml [2018-12-09 06:55:19,278 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 06:55:19,278 INFO L168 Benchmark]: Toolchain (without parser) took 446509.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -96.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2018-12-09 06:55:19,279 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:55:19,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -148.1 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-12-09 06:55:19,279 INFO L168 Benchmark]: Boogie Preprocessor took 32.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:55:19,279 INFO L168 Benchmark]: RCFGBuilder took 285.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. [2018-12-09 06:55:19,279 INFO L168 Benchmark]: TraceAbstraction took 445878.71 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -3.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:55:19,279 INFO L168 Benchmark]: Witness Printer took 34.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-09 06:55:19,280 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 275.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -148.1 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 285.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 445878.71 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -3.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 34.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 643]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 654]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 654]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 72 locations, 19 error locations. SAFE Result, 445.8s OverallTime, 20 OverallIterations, 5 TraceHistogramMax, 321.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 965 SDtfs, 4377 SDslu, 5141 SDs, 0 SdLazy, 18382 SolverSat, 1233 SolverUnsat, 75 SolverUnknown, 0 SolverNotchecked, 98.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1414 GetRequests, 566 SyntacticMatches, 70 SemanticMatches, 778 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15562 ImplicationChecksByTransitivity, 337.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 244 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 122.9s InterpolantComputationTime, 1853 NumberOfCodeBlocks, 1849 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1822 ConstructedInterpolants, 115 QuantifiedInterpolants, 3672463 SizeOfPredicates, 233 NumberOfNonLiveVariables, 4301 ConjunctsInSsa, 915 ConjunctsInUnsatCore, 31 InterpolantComputations, 9 PerfectInterpolantSequences, 905/1608 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...