./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-properties/alternating_list-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/alternating_list-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c86c31ba65e8769cfdcc728bfa7fc9963ff0709c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/alternating_list-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c86c31ba65e8769cfdcc728bfa7fc9963ff0709c ................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:07:50,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:07:50,075 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:07:50,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:07:50,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:07:50,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:07:50,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:07:50,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:07:50,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:07:50,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:07:50,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:07:50,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:07:50,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:07:50,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:07:50,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:07:50,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:07:50,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:07:50,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:07:50,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:07:50,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:07:50,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:07:50,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:07:50,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:07:50,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:07:50,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:07:50,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:07:50,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:07:50,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:07:50,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:07:50,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:07:50,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:07:50,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:07:50,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:07:50,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:07:50,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:07:50,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:07:50,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:07:50,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:07:50,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:07:50,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:07:50,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:07:50,129 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 22:07:50,143 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:07:50,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:07:50,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:07:50,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:07:50,152 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:07:50,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:07:50,152 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:07:50,152 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:07:50,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:07:50,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:07:50,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:07:50,153 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:07:50,153 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:07:50,153 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 22:07:50,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:07:50,153 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:07:50,154 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:07:50,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:07:50,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:07:50,154 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:07:50,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:07:50,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:07:50,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:07:50,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:07:50,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:07:50,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:07:50,155 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c86c31ba65e8769cfdcc728bfa7fc9963ff0709c [2019-11-15 22:07:50,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:07:50,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:07:50,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:07:50,193 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:07:50,193 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:07:50,194 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/../../sv-benchmarks/c/list-properties/alternating_list-1.i [2019-11-15 22:07:50,239 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/data/db1c2b488/25091f7de79b4b138b3cc0b798dededf/FLAG1caec0556 [2019-11-15 22:07:50,684 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:07:50,685 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/sv-benchmarks/c/list-properties/alternating_list-1.i [2019-11-15 22:07:50,697 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/data/db1c2b488/25091f7de79b4b138b3cc0b798dededf/FLAG1caec0556 [2019-11-15 22:07:50,708 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/data/db1c2b488/25091f7de79b4b138b3cc0b798dededf [2019-11-15 22:07:50,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:07:50,712 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:07:50,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:07:50,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:07:50,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:07:50,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:07:50" (1/1) ... [2019-11-15 22:07:50,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a1ed13d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:50, skipping insertion in model container [2019-11-15 22:07:50,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:07:50" (1/1) ... [2019-11-15 22:07:50,727 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:07:50,760 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:07:51,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:07:51,077 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:07:51,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:07:51,179 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:07:51,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:51 WrapperNode [2019-11-15 22:07:51,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:07:51,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:07:51,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:07:51,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:07:51,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:51" (1/1) ... [2019-11-15 22:07:51,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:51" (1/1) ... [2019-11-15 22:07:51,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:51" (1/1) ... [2019-11-15 22:07:51,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:51" (1/1) ... [2019-11-15 22:07:51,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:51" (1/1) ... [2019-11-15 22:07:51,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:51" (1/1) ... [2019-11-15 22:07:51,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:51" (1/1) ... [2019-11-15 22:07:51,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:07:51,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:07:51,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:07:51,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:07:51,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/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 [2019-11-15 22:07:51,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:07:51,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:07:51,296 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 22:07:51,296 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 22:07:51,296 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-15 22:07:51,296 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-15 22:07:51,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-15 22:07:51,297 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 22:07:51,297 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:07:51,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 22:07:51,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 22:07:51,298 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:07:51,298 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:07:51,298 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:07:51,298 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:07:51,298 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:07:51,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:07:51,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:07:51,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:07:51,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:07:51,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:07:51,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:07:51,300 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:07:51,300 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:07:51,300 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:07:51,300 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:07:51,300 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:07:51,301 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 22:07:51,301 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 22:07:51,301 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-15 22:07:51,301 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-15 22:07:51,301 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-15 22:07:51,302 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:07:51,302 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:07:51,302 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:07:51,302 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:07:51,302 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:07:51,302 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:07:51,303 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:07:51,303 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:07:51,303 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:07:51,303 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:07:51,303 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:07:51,303 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:07:51,304 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:07:51,304 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:07:51,304 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:07:51,304 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:07:51,304 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:07:51,305 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:07:51,305 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:07:51,305 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:07:51,305 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:07:51,305 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:07:51,305 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:07:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:07:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:07:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:07:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:07:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:07:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:07:51,307 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:07:51,307 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:07:51,307 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:07:51,307 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:07:51,307 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:07:51,307 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:07:51,308 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:07:51,308 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:07:51,308 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:07:51,308 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:07:51,308 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:07:51,308 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:07:51,309 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:07:51,309 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:07:51,309 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:07:51,309 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:07:51,309 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:07:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:07:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:07:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:07:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:07:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:07:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:07:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:07:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:07:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:07:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:07:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:07:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:07:51,312 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:07:51,312 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:07:51,312 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:07:51,312 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:07:51,312 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:07:51,312 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:07:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:07:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:07:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:07:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:07:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:07:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:07:51,314 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:07:51,314 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:07:51,314 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:07:51,314 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:07:51,314 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:07:51,314 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:07:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:07:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:07:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:07:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:07:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:07:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:07:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:07:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:07:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:07:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:07:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 22:07:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:07:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:07:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:07:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:07:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:07:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:07:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:07:51,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:07:51,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:07:51,688 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 22:07:51,936 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:07:51,937 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-15 22:07:51,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:07:51 BoogieIcfgContainer [2019-11-15 22:07:51,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:07:51,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:07:51,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:07:51,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:07:51,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:07:50" (1/3) ... [2019-11-15 22:07:51,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59cea603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:07:51, skipping insertion in model container [2019-11-15 22:07:51,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:51" (2/3) ... [2019-11-15 22:07:51,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59cea603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:07:51, skipping insertion in model container [2019-11-15 22:07:51,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:07:51" (3/3) ... [2019-11-15 22:07:51,945 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-1.i [2019-11-15 22:07:51,954 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:07:51,961 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-11-15 22:07:51,970 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-11-15 22:07:52,001 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:07:52,008 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:07:52,009 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:07:52,009 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:07:52,009 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:07:52,009 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:07:52,009 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:07:52,010 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:07:52,029 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-11-15 22:07:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:07:52,039 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:52,039 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:52,041 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:07:52,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:52,045 INFO L82 PathProgramCache]: Analyzing trace with hash 63975510, now seen corresponding path program 1 times [2019-11-15 22:07:52,053 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:52,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280210715] [2019-11-15 22:07:52,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:52,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:52,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:52,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280210715] [2019-11-15 22:07:52,205 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:07:52,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:07:52,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701399021] [2019-11-15 22:07:52,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:07:52,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:52,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:07:52,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:07:52,225 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2019-11-15 22:07:52,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:52,397 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-11-15 22:07:52,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:07:52,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-15 22:07:52,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:52,406 INFO L225 Difference]: With dead ends: 80 [2019-11-15 22:07:52,406 INFO L226 Difference]: Without dead ends: 72 [2019-11-15 22:07:52,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:07:52,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-15 22:07:52,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-11-15 22:07:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-15 22:07:52,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-11-15 22:07:52,446 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 10 [2019-11-15 22:07:52,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:52,446 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-11-15 22:07:52,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:07:52,446 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-11-15 22:07:52,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 22:07:52,447 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:52,447 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:52,448 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:07:52,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:52,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1983205163, now seen corresponding path program 1 times [2019-11-15 22:07:52,449 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:52,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940238701] [2019-11-15 22:07:52,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:52,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:52,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:52,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940238701] [2019-11-15 22:07:52,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:07:52,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:07:52,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129447362] [2019-11-15 22:07:52,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:07:52,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:52,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:07:52,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:07:52,568 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 5 states. [2019-11-15 22:07:52,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:52,801 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-11-15 22:07:52,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:07:52,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-15 22:07:52,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:52,803 INFO L225 Difference]: With dead ends: 93 [2019-11-15 22:07:52,803 INFO L226 Difference]: Without dead ends: 93 [2019-11-15 22:07:52,804 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:07:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-15 22:07:52,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 73. [2019-11-15 22:07:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-15 22:07:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2019-11-15 22:07:52,812 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 11 [2019-11-15 22:07:52,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:52,813 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2019-11-15 22:07:52,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:07:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2019-11-15 22:07:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 22:07:52,813 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:52,814 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:52,814 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:07:52,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:52,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1983205164, now seen corresponding path program 1 times [2019-11-15 22:07:52,815 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:52,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687859349] [2019-11-15 22:07:52,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:52,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:52,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:52,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687859349] [2019-11-15 22:07:52,919 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:07:52,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:07:52,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588164011] [2019-11-15 22:07:52,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:07:52,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:52,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:07:52,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:07:52,923 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand 5 states. [2019-11-15 22:07:53,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:53,190 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-11-15 22:07:53,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:07:53,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-15 22:07:53,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:53,192 INFO L225 Difference]: With dead ends: 99 [2019-11-15 22:07:53,193 INFO L226 Difference]: Without dead ends: 99 [2019-11-15 22:07:53,193 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:07:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-15 22:07:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2019-11-15 22:07:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-15 22:07:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2019-11-15 22:07:53,207 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 11 [2019-11-15 22:07:53,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:53,207 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2019-11-15 22:07:53,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:07:53,208 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2019-11-15 22:07:53,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 22:07:53,208 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:53,209 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:53,209 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:07:53,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:53,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2096806293, now seen corresponding path program 1 times [2019-11-15 22:07:53,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:53,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824332526] [2019-11-15 22:07:53,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:53,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:53,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:53,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:53,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824332526] [2019-11-15 22:07:53,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:07:53,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:07:53,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846057372] [2019-11-15 22:07:53,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:07:53,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:53,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:07:53,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:07:53,307 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 5 states. [2019-11-15 22:07:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:53,490 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2019-11-15 22:07:53,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:07:53,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-15 22:07:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:53,492 INFO L225 Difference]: With dead ends: 95 [2019-11-15 22:07:53,492 INFO L226 Difference]: Without dead ends: 95 [2019-11-15 22:07:53,492 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:07:53,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-15 22:07:53,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2019-11-15 22:07:53,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-15 22:07:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-11-15 22:07:53,500 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 19 [2019-11-15 22:07:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:53,500 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-11-15 22:07:53,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:07:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-11-15 22:07:53,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 22:07:53,502 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:53,502 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:53,502 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:07:53,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:53,503 INFO L82 PathProgramCache]: Analyzing trace with hash 576531525, now seen corresponding path program 1 times [2019-11-15 22:07:53,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:53,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759416323] [2019-11-15 22:07:53,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:53,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:53,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:53,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759416323] [2019-11-15 22:07:53,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:07:53,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:07:53,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493883460] [2019-11-15 22:07:53,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:07:53,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:53,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:07:53,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:07:53,574 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 6 states. [2019-11-15 22:07:53,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:53,796 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-11-15 22:07:53,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:07:53,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-15 22:07:53,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:53,798 INFO L225 Difference]: With dead ends: 99 [2019-11-15 22:07:53,798 INFO L226 Difference]: Without dead ends: 99 [2019-11-15 22:07:53,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:07:53,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-15 22:07:53,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2019-11-15 22:07:53,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-15 22:07:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2019-11-15 22:07:53,805 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 20 [2019-11-15 22:07:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:53,806 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2019-11-15 22:07:53,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:07:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2019-11-15 22:07:53,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 22:07:53,807 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:53,807 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:53,807 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:07:53,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:53,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1548979245, now seen corresponding path program 1 times [2019-11-15 22:07:53,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:53,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765458574] [2019-11-15 22:07:53,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:53,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:53,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:53,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765458574] [2019-11-15 22:07:53,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:07:53,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:07:53,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112247993] [2019-11-15 22:07:53,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:07:53,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:53,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:07:53,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:07:53,923 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 7 states. [2019-11-15 22:07:54,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:54,179 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2019-11-15 22:07:54,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:07:54,179 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-15 22:07:54,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:54,180 INFO L225 Difference]: With dead ends: 132 [2019-11-15 22:07:54,181 INFO L226 Difference]: Without dead ends: 132 [2019-11-15 22:07:54,181 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:07:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-15 22:07:54,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 95. [2019-11-15 22:07:54,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-15 22:07:54,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2019-11-15 22:07:54,189 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 20 [2019-11-15 22:07:54,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:54,189 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2019-11-15 22:07:54,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:07:54,190 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2019-11-15 22:07:54,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:07:54,191 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:54,191 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:54,191 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:07:54,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:54,192 INFO L82 PathProgramCache]: Analyzing trace with hash 691191193, now seen corresponding path program 1 times [2019-11-15 22:07:54,192 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:54,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205461084] [2019-11-15 22:07:54,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:54,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:54,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:54,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:54,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205461084] [2019-11-15 22:07:54,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:07:54,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:07:54,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953816460] [2019-11-15 22:07:54,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:07:54,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:54,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:07:54,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:07:54,274 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 6 states. [2019-11-15 22:07:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:54,483 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-15 22:07:54,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:07:54,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-15 22:07:54,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:54,484 INFO L225 Difference]: With dead ends: 109 [2019-11-15 22:07:54,485 INFO L226 Difference]: Without dead ends: 105 [2019-11-15 22:07:54,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:07:54,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-15 22:07:54,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2019-11-15 22:07:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-15 22:07:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2019-11-15 22:07:54,492 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 21 [2019-11-15 22:07:54,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:54,492 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2019-11-15 22:07:54,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:07:54,493 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2019-11-15 22:07:54,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:07:54,493 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:54,494 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:54,494 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:07:54,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:54,494 INFO L82 PathProgramCache]: Analyzing trace with hash 692608250, now seen corresponding path program 1 times [2019-11-15 22:07:54,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:54,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111550713] [2019-11-15 22:07:54,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:54,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:54,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:54,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111550713] [2019-11-15 22:07:54,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:07:54,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:07:54,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679211744] [2019-11-15 22:07:54,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:07:54,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:54,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:07:54,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:07:54,563 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 8 states. [2019-11-15 22:07:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:54,853 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-11-15 22:07:54,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:07:54,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-15 22:07:54,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:54,855 INFO L225 Difference]: With dead ends: 111 [2019-11-15 22:07:54,855 INFO L226 Difference]: Without dead ends: 104 [2019-11-15 22:07:54,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:07:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-15 22:07:54,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2019-11-15 22:07:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-15 22:07:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-11-15 22:07:54,860 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 21 [2019-11-15 22:07:54,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:54,860 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-11-15 22:07:54,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:07:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-11-15 22:07:54,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:07:54,861 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:54,861 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:54,861 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:07:54,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:54,861 INFO L82 PathProgramCache]: Analyzing trace with hash -972300712, now seen corresponding path program 1 times [2019-11-15 22:07:54,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:54,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105390619] [2019-11-15 22:07:54,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:54,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:54,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:54,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105390619] [2019-11-15 22:07:54,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:07:54,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:07:54,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362527142] [2019-11-15 22:07:54,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:07:54,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:54,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:07:54,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:07:54,962 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 7 states. [2019-11-15 22:07:55,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:55,173 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-15 22:07:55,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:07:55,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-15 22:07:55,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:55,177 INFO L225 Difference]: With dead ends: 96 [2019-11-15 22:07:55,178 INFO L226 Difference]: Without dead ends: 96 [2019-11-15 22:07:55,178 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:07:55,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-15 22:07:55,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-11-15 22:07:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-15 22:07:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2019-11-15 22:07:55,181 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 21 [2019-11-15 22:07:55,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:55,181 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2019-11-15 22:07:55,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:07:55,181 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2019-11-15 22:07:55,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:07:55,182 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:55,182 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:55,182 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:07:55,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:55,183 INFO L82 PathProgramCache]: Analyzing trace with hash -972300711, now seen corresponding path program 1 times [2019-11-15 22:07:55,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:55,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339644929] [2019-11-15 22:07:55,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:55,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:55,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:55,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339644929] [2019-11-15 22:07:55,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:07:55,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:07:55,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431757236] [2019-11-15 22:07:55,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:07:55,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:55,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:07:55,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:07:55,268 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 7 states. [2019-11-15 22:07:55,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:55,557 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2019-11-15 22:07:55,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:07:55,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-15 22:07:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:55,558 INFO L225 Difference]: With dead ends: 87 [2019-11-15 22:07:55,558 INFO L226 Difference]: Without dead ends: 87 [2019-11-15 22:07:55,558 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:07:55,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-15 22:07:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2019-11-15 22:07:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-15 22:07:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-11-15 22:07:55,562 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 21 [2019-11-15 22:07:55,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:55,562 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-11-15 22:07:55,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:07:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-11-15 22:07:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:07:55,563 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:55,563 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:55,563 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:07:55,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:55,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1951842208, now seen corresponding path program 1 times [2019-11-15 22:07:55,564 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:55,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824660048] [2019-11-15 22:07:55,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:55,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:55,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:55,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:55,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824660048] [2019-11-15 22:07:55,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193687922] [2019-11-15 22:07:55,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:55,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 22:07:55,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:55,976 INFO L375 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 [2019-11-15 22:07:55,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:55,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:55,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:55,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 22:07:56,103 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:56,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 22:07:56,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:56,139 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 22:07:56,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:56,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-15 22:07:56,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:07:56,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:56,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:56,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:56,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:39 [2019-11-15 22:07:56,371 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:56,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 67 [2019-11-15 22:07:56,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:07:56,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:56,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:56,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 22:07:56,419 INFO L567 ElimStorePlain]: treesize reduction 70, result has 34.6 percent of original size [2019-11-15 22:07:56,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:07:56,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:69, output treesize:36 [2019-11-15 22:07:56,576 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:07:56,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-11-15 22:07:56,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:56,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:56,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:07:56,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:15 [2019-11-15 22:07:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:56,665 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:07:56,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-15 22:07:56,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221005263] [2019-11-15 22:07:56,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 22:07:56,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:56,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 22:07:56,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2019-11-15 22:07:56,667 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 27 states. [2019-11-15 22:07:58,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:58,763 INFO L93 Difference]: Finished difference Result 261 states and 280 transitions. [2019-11-15 22:07:58,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-15 22:07:58,764 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 30 [2019-11-15 22:07:58,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:58,766 INFO L225 Difference]: With dead ends: 261 [2019-11-15 22:07:58,766 INFO L226 Difference]: Without dead ends: 261 [2019-11-15 22:07:58,767 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=395, Invalid=1861, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 22:07:58,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-15 22:07:58,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 132. [2019-11-15 22:07:58,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-15 22:07:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 159 transitions. [2019-11-15 22:07:58,773 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 159 transitions. Word has length 30 [2019-11-15 22:07:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:58,773 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 159 transitions. [2019-11-15 22:07:58,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 22:07:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 159 transitions. [2019-11-15 22:07:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:07:58,774 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:58,774 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:58,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:58,975 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:07:58,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:58,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1951842209, now seen corresponding path program 1 times [2019-11-15 22:07:58,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:58,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702255335] [2019-11-15 22:07:58,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:58,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:58,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:59,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:59,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702255335] [2019-11-15 22:07:59,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582795941] [2019-11-15 22:07:59,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:59,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-15 22:07:59,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:59,385 INFO L375 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 [2019-11-15 22:07:59,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:59,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:59,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:59,391 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 22:07:59,454 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_29|], 1=[|v_#valid_44|]} [2019-11-15 22:07:59,458 INFO L375 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 [2019-11-15 22:07:59,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:59,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:59,477 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:59,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:07:59,477 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:59,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:59,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:59,488 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2019-11-15 22:07:59,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:07:59,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:59,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:59,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:07:59,518 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:59,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:59,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:59,529 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2019-11-15 22:07:59,616 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:59,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 74 [2019-11-15 22:07:59,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:59,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:59,648 INFO L567 ElimStorePlain]: treesize reduction 28, result has 66.3 percent of original size [2019-11-15 22:07:59,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2019-11-15 22:07:59,655 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:59,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:59,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:59,661 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:28 [2019-11-15 22:07:59,745 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:07:59,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-15 22:07:59,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:59,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:59,760 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:07:59,760 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-11-15 22:07:59,761 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:59,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:59,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:59,775 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:9 [2019-11-15 22:07:59,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:59,790 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:07:59,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2019-11-15 22:07:59,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348968514] [2019-11-15 22:07:59,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 22:07:59,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:59,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 22:07:59,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:07:59,791 INFO L87 Difference]: Start difference. First operand 132 states and 159 transitions. Second operand 23 states. [2019-11-15 22:08:01,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:01,311 INFO L93 Difference]: Finished difference Result 287 states and 306 transitions. [2019-11-15 22:08:01,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 22:08:01,312 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2019-11-15 22:08:01,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:01,314 INFO L225 Difference]: With dead ends: 287 [2019-11-15 22:08:01,314 INFO L226 Difference]: Without dead ends: 287 [2019-11-15 22:08:01,315 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=273, Invalid=1367, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 22:08:01,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-11-15 22:08:01,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 140. [2019-11-15 22:08:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-15 22:08:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 168 transitions. [2019-11-15 22:08:01,323 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 168 transitions. Word has length 30 [2019-11-15 22:08:01,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:01,325 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 168 transitions. [2019-11-15 22:08:01,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 22:08:01,325 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 168 transitions. [2019-11-15 22:08:01,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 22:08:01,330 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:01,331 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:01,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:01,534 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:01,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:01,535 INFO L82 PathProgramCache]: Analyzing trace with hash 295041158, now seen corresponding path program 1 times [2019-11-15 22:08:01,535 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:01,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310972474] [2019-11-15 22:08:01,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:01,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:01,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:01,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310972474] [2019-11-15 22:08:01,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564280934] [2019-11-15 22:08:01,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:01,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-15 22:08:01,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:01,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:08:01,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:01,908 INFO L567 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2019-11-15 22:08:01,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:01,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-11-15 22:08:01,937 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:01,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:08:01,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:01,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:01,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:01,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-11-15 22:08:01,970 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_18|], 2=[|v_#memory_int_16|]} [2019-11-15 22:08:01,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:08:01,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:01,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:01,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:08:01,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 22:08:01,989 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:01,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:01,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:01,999 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-11-15 22:08:02,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-15 22:08:02,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:02,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:02,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:02,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2019-11-15 22:08:02,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:08:02,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:02,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:02,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:02,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2019-11-15 22:08:02,130 INFO L375 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 22 treesize of output 10 [2019-11-15 22:08:02,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:02,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:02,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:02,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-15 22:08:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:02,151 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:02,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-11-15 22:08:02,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089864104] [2019-11-15 22:08:02,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-15 22:08:02,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:02,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-15 22:08:02,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:08:02,153 INFO L87 Difference]: Start difference. First operand 140 states and 168 transitions. Second operand 24 states. [2019-11-15 22:08:03,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:03,203 INFO L93 Difference]: Finished difference Result 277 states and 295 transitions. [2019-11-15 22:08:03,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 22:08:03,203 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2019-11-15 22:08:03,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:03,205 INFO L225 Difference]: With dead ends: 277 [2019-11-15 22:08:03,205 INFO L226 Difference]: Without dead ends: 277 [2019-11-15 22:08:03,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=313, Invalid=1409, Unknown=0, NotChecked=0, Total=1722 [2019-11-15 22:08:03,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-15 22:08:03,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 113. [2019-11-15 22:08:03,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-15 22:08:03,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2019-11-15 22:08:03,211 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 31 [2019-11-15 22:08:03,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:03,211 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2019-11-15 22:08:03,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-15 22:08:03,212 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2019-11-15 22:08:03,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 22:08:03,213 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:03,213 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:03,416 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:03,416 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:03,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:03,417 INFO L82 PathProgramCache]: Analyzing trace with hash -2013986915, now seen corresponding path program 2 times [2019-11-15 22:08:03,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:03,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639424961] [2019-11-15 22:08:03,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:03,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:03,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:08:03,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639424961] [2019-11-15 22:08:03,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:03,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:08:03,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612992942] [2019-11-15 22:08:03,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:08:03,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:03,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:08:03,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:08:03,452 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 4 states. [2019-11-15 22:08:03,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:03,551 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2019-11-15 22:08:03,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:08:03,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-15 22:08:03,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:03,553 INFO L225 Difference]: With dead ends: 146 [2019-11-15 22:08:03,553 INFO L226 Difference]: Without dead ends: 146 [2019-11-15 22:08:03,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:08:03,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-15 22:08:03,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 113. [2019-11-15 22:08:03,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-15 22:08:03,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2019-11-15 22:08:03,556 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 37 [2019-11-15 22:08:03,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:03,557 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2019-11-15 22:08:03,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:08:03,557 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2019-11-15 22:08:03,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 22:08:03,558 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:03,558 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 22:08:03,558 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:03,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:03,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1718162285, now seen corresponding path program 1 times [2019-11-15 22:08:03,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:03,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559127503] [2019-11-15 22:08:03,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:03,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:03,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:03,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559127503] [2019-11-15 22:08:03,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222929266] [2019-11-15 22:08:03,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:03,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-15 22:08:03,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:03,925 INFO L375 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 [2019-11-15 22:08:03,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:03,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:03,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:03,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 22:08:04,034 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_30|], 1=[|v_#valid_47|]} [2019-11-15 22:08:04,043 INFO L375 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 [2019-11-15 22:08:04,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:04,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:04,069 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:04,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:08:04,070 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:04,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:04,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:04,087 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2019-11-15 22:08:04,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:08:04,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:04,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:04,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 22:08:04,146 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:04,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:04,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:04,159 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:43 [2019-11-15 22:08:04,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-15 22:08:04,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:04,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:04,210 INFO L496 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. [2019-11-15 22:08:04,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:43 [2019-11-15 22:08:04,283 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_18|], 2=[|v_#memory_$Pointer$.base_20|]} [2019-11-15 22:08:04,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2019-11-15 22:08:04,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:04,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:04,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:08:04,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 40 [2019-11-15 22:08:04,313 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:04,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:04,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:04,325 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:50 [2019-11-15 22:08:04,446 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:04,448 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:04,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 23 [2019-11-15 22:08:04,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:04,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:04,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:04,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:19 [2019-11-15 22:08:04,598 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:04,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2019-11-15 22:08:04,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:08:04,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:04,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:04,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:04,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2019-11-15 22:08:04,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:04,695 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:04,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2019-11-15 22:08:04,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816371171] [2019-11-15 22:08:04,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-15 22:08:04,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:04,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 22:08:04,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2019-11-15 22:08:04,696 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand 31 states. [2019-11-15 22:08:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:06,321 INFO L93 Difference]: Finished difference Result 178 states and 188 transitions. [2019-11-15 22:08:06,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 22:08:06,322 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2019-11-15 22:08:06,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:06,323 INFO L225 Difference]: With dead ends: 178 [2019-11-15 22:08:06,323 INFO L226 Difference]: Without dead ends: 178 [2019-11-15 22:08:06,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=300, Invalid=2250, Unknown=0, NotChecked=0, Total=2550 [2019-11-15 22:08:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-15 22:08:06,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 109. [2019-11-15 22:08:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 22:08:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2019-11-15 22:08:06,327 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 37 [2019-11-15 22:08:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:06,327 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2019-11-15 22:08:06,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-15 22:08:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2019-11-15 22:08:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 22:08:06,328 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:06,329 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:06,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:06,533 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:06,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:06,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1908389929, now seen corresponding path program 1 times [2019-11-15 22:08:06,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:06,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959472424] [2019-11-15 22:08:06,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:06,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:06,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:08:06,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959472424] [2019-11-15 22:08:06,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478780500] [2019-11-15 22:08:06,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:06,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 22:08:06,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:06,803 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:06,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2019-11-15 22:08:06,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:08:06,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:06,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:06,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2019-11-15 22:08:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:08:06,840 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:06,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-15 22:08:06,840 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727795655] [2019-11-15 22:08:06,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 22:08:06,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:06,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 22:08:06,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:08:06,841 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 16 states. [2019-11-15 22:08:07,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:07,222 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-11-15 22:08:07,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:08:07,222 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-11-15 22:08:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:07,223 INFO L225 Difference]: With dead ends: 119 [2019-11-15 22:08:07,223 INFO L226 Difference]: Without dead ends: 119 [2019-11-15 22:08:07,223 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:08:07,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-15 22:08:07,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2019-11-15 22:08:07,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 22:08:07,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-15 22:08:07,227 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 38 [2019-11-15 22:08:07,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:07,228 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-15 22:08:07,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 22:08:07,228 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-15 22:08:07,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 22:08:07,229 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:07,229 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:07,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:07,433 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:07,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:07,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1909806986, now seen corresponding path program 1 times [2019-11-15 22:08:07,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:07,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064942412] [2019-11-15 22:08:07,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:07,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:07,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 22:08:07,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064942412] [2019-11-15 22:08:07,513 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:07,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:08:07,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008727752] [2019-11-15 22:08:07,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:08:07,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:07,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:08:07,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:08:07,514 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 6 states. [2019-11-15 22:08:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:07,678 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-11-15 22:08:07,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:08:07,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-11-15 22:08:07,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:07,679 INFO L225 Difference]: With dead ends: 114 [2019-11-15 22:08:07,679 INFO L226 Difference]: Without dead ends: 114 [2019-11-15 22:08:07,679 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:08:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-15 22:08:07,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-11-15 22:08:07,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 22:08:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-11-15 22:08:07,682 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 38 [2019-11-15 22:08:07,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:07,683 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-11-15 22:08:07,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:08:07,683 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-11-15 22:08:07,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 22:08:07,683 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:07,684 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:07,684 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:07,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:07,684 INFO L82 PathProgramCache]: Analyzing trace with hash -925525417, now seen corresponding path program 1 times [2019-11-15 22:08:07,684 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:07,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920176970] [2019-11-15 22:08:07,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:07,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:07,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:08:07,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920176970] [2019-11-15 22:08:07,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191558277] [2019-11-15 22:08:07,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:07,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 22:08:07,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:08:07,897 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:07,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 7 [2019-11-15 22:08:07,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071235664] [2019-11-15 22:08:07,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:08:07,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:07,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:08:07,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:08:07,898 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 8 states. [2019-11-15 22:08:08,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:08,058 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-11-15 22:08:08,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:08:08,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-11-15 22:08:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:08,059 INFO L225 Difference]: With dead ends: 114 [2019-11-15 22:08:08,059 INFO L226 Difference]: Without dead ends: 114 [2019-11-15 22:08:08,059 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:08:08,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-15 22:08:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2019-11-15 22:08:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 22:08:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-15 22:08:08,063 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 39 [2019-11-15 22:08:08,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:08,063 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-15 22:08:08,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:08:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-15 22:08:08,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 22:08:08,064 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:08,064 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:08,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:08,264 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:08,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1373483291, now seen corresponding path program 1 times [2019-11-15 22:08:08,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:08,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701739674] [2019-11-15 22:08:08,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:08,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:08,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:08,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:08,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701739674] [2019-11-15 22:08:08,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690515506] [2019-11-15 22:08:08,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:08,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-15 22:08:08,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:08,691 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:08,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:08:08,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:08,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:08,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:08,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-15 22:08:08,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:08:08,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:08,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:08,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:08,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-15 22:08:08,748 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:08,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 54 [2019-11-15 22:08:08,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:08:08,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:08,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:08,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 22:08:08,760 INFO L567 ElimStorePlain]: treesize reduction 38, result has 24.0 percent of original size [2019-11-15 22:08:08,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:08,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:12 [2019-11-15 22:08:08,911 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:08,912 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:08,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 16 [2019-11-15 22:08:08,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:08,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:08,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:08,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:10 [2019-11-15 22:08:08,948 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:08,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 32 [2019-11-15 22:08:08,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:08,958 INFO L567 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-11-15 22:08:08,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:08,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2019-11-15 22:08:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:09,005 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:09,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 27 [2019-11-15 22:08:09,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528334961] [2019-11-15 22:08:09,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-15 22:08:09,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:09,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 22:08:09,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2019-11-15 22:08:09,007 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 28 states. [2019-11-15 22:08:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:10,131 INFO L93 Difference]: Finished difference Result 177 states and 187 transitions. [2019-11-15 22:08:10,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 22:08:10,131 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 40 [2019-11-15 22:08:10,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:10,132 INFO L225 Difference]: With dead ends: 177 [2019-11-15 22:08:10,133 INFO L226 Difference]: Without dead ends: 177 [2019-11-15 22:08:10,133 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=368, Invalid=1888, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 22:08:10,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-15 22:08:10,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 118. [2019-11-15 22:08:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-15 22:08:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2019-11-15 22:08:10,137 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 40 [2019-11-15 22:08:10,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:10,137 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2019-11-15 22:08:10,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-15 22:08:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2019-11-15 22:08:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 22:08:10,138 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:10,138 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:10,341 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:10,341 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:10,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:10,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1373483292, now seen corresponding path program 1 times [2019-11-15 22:08:10,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:10,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487667902] [2019-11-15 22:08:10,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:10,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:10,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:10,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487667902] [2019-11-15 22:08:10,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992902473] [2019-11-15 22:08:10,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:10,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 22:08:10,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:10,942 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:10,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2019-11-15 22:08:10,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:10,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:10,952 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:10,954 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:10,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 17 [2019-11-15 22:08:10,954 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:10,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:10,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:10,962 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:11 [2019-11-15 22:08:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:10,999 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:10,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2019-11-15 22:08:10,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386431315] [2019-11-15 22:08:10,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 22:08:10,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:10,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 22:08:11,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-11-15 22:08:11,000 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 27 states. [2019-11-15 22:08:12,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:12,913 INFO L93 Difference]: Finished difference Result 209 states and 216 transitions. [2019-11-15 22:08:12,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-11-15 22:08:12,913 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 40 [2019-11-15 22:08:12,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:12,914 INFO L225 Difference]: With dead ends: 209 [2019-11-15 22:08:12,914 INFO L226 Difference]: Without dead ends: 209 [2019-11-15 22:08:12,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=684, Invalid=3222, Unknown=0, NotChecked=0, Total=3906 [2019-11-15 22:08:12,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-15 22:08:12,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 121. [2019-11-15 22:08:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 22:08:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2019-11-15 22:08:12,922 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 40 [2019-11-15 22:08:12,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:12,923 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2019-11-15 22:08:12,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 22:08:12,923 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2019-11-15 22:08:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 22:08:12,924 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:12,924 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 22:08:13,128 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:13,129 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:13,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:13,130 INFO L82 PathProgramCache]: Analyzing trace with hash -232317747, now seen corresponding path program 1 times [2019-11-15 22:08:13,130 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:13,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774021541] [2019-11-15 22:08:13,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:13,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:13,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:13,506 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:13,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774021541] [2019-11-15 22:08:13,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591758509] [2019-11-15 22:08:13,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:13,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-15 22:08:13,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:13,748 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:13,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:08:13,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:13,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:13,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:13,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-15 22:08:13,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:08:13,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:13,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:13,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:13,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-15 22:08:13,858 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-15 22:08:13,859 INFO L375 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 1 case distinctions, treesize of input 31 treesize of output 23 [2019-11-15 22:08:13,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:13,869 INFO L567 ElimStorePlain]: treesize reduction 8, result has 65.2 percent of original size [2019-11-15 22:08:13,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:13,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-15 22:08:13,912 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_17|], 2=[|v_#memory_$Pointer$.base_25|]} [2019-11-15 22:08:13,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 22:08:13,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:13,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:13,940 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:13,941 INFO L375 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 1 case distinctions, treesize of input 29 treesize of output 52 [2019-11-15 22:08:13,941 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:13,962 INFO L567 ElimStorePlain]: treesize reduction 28, result has 57.6 percent of original size [2019-11-15 22:08:13,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:13,963 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:29 [2019-11-15 22:08:13,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2019-11-15 22:08:13,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:13,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:13,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:13,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:24 [2019-11-15 22:08:14,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:08:14,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:14,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:14,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2019-11-15 22:08:14,065 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:14,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:14,072 INFO L496 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. [2019-11-15 22:08:14,072 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:28 [2019-11-15 22:08:14,175 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:14,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2019-11-15 22:08:14,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:08:14,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:14,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:14,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:21 [2019-11-15 22:08:14,212 INFO L375 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 13 [2019-11-15 22:08:14,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:14,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:14,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:14,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:5 [2019-11-15 22:08:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:14,221 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:14,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2019-11-15 22:08:14,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235546601] [2019-11-15 22:08:14,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-15 22:08:14,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:14,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-15 22:08:14,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2019-11-15 22:08:14,223 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand 32 states. [2019-11-15 22:08:16,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:16,227 INFO L93 Difference]: Finished difference Result 236 states and 248 transitions. [2019-11-15 22:08:16,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-15 22:08:16,227 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-11-15 22:08:16,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:16,229 INFO L225 Difference]: With dead ends: 236 [2019-11-15 22:08:16,229 INFO L226 Difference]: Without dead ends: 236 [2019-11-15 22:08:16,230 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=570, Invalid=3336, Unknown=0, NotChecked=0, Total=3906 [2019-11-15 22:08:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-11-15 22:08:16,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 141. [2019-11-15 22:08:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 22:08:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2019-11-15 22:08:16,233 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 40 [2019-11-15 22:08:16,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:16,234 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2019-11-15 22:08:16,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-15 22:08:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2019-11-15 22:08:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 22:08:16,235 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:16,235 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 22:08:16,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:16,438 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:16,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:16,439 INFO L82 PathProgramCache]: Analyzing trace with hash -232317746, now seen corresponding path program 1 times [2019-11-15 22:08:16,439 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:16,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146848497] [2019-11-15 22:08:16,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:16,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:16,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:16,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146848497] [2019-11-15 22:08:16,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101929767] [2019-11-15 22:08:16,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:16,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-15 22:08:16,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:16,996 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:16,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:08:16,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:17,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:17,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:17,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2019-11-15 22:08:17,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:08:17,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:17,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:17,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:08:17,051 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:17,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:17,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:17,061 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:32 [2019-11-15 22:08:17,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:08:17,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 22:08:17,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:17,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:17,219 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-15 22:08:17,219 INFO L375 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 1 case distinctions, treesize of input 35 treesize of output 27 [2019-11-15 22:08:17,220 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:17,250 INFO L567 ElimStorePlain]: treesize reduction 10, result has 76.2 percent of original size [2019-11-15 22:08:17,250 INFO L496 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. [2019-11-15 22:08:17,251 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:32 [2019-11-15 22:08:17,349 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:17,349 INFO L375 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 1 case distinctions, treesize of input 33 treesize of output 60 [2019-11-15 22:08:17,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:17,402 INFO L567 ElimStorePlain]: treesize reduction 34, result has 66.0 percent of original size [2019-11-15 22:08:17,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 22:08:17,405 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:17,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:17,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:17,421 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:53 [2019-11-15 22:08:17,552 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_20|], 2=[|v_#memory_$Pointer$.base_30|], 6=[|v_#memory_$Pointer$.offset_21|]} [2019-11-15 22:08:17,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 19 [2019-11-15 22:08:17,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:17,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:17,601 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:17,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 136 [2019-11-15 22:08:17,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:08:17,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:17,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:17,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:17,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:08:17,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:17,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:17,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:17,608 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:17,663 INFO L567 ElimStorePlain]: treesize reduction 52, result has 64.1 percent of original size [2019-11-15 22:08:17,695 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:17,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 114 [2019-11-15 22:08:17,697 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:17,755 INFO L567 ElimStorePlain]: treesize reduction 58, result has 54.7 percent of original size [2019-11-15 22:08:17,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:17,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:17,757 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:163, output treesize:85 [2019-11-15 22:08:17,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:17,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:18,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:18,194 INFO L375 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 60 treesize of output 46 [2019-11-15 22:08:18,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:18,202 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:18,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 76 [2019-11-15 22:08:18,202 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:18,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:18,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 22:08:18,230 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:137, output treesize:103 [2019-11-15 22:08:18,292 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:18,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 22:08:18,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:18,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:18,303 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:18,304 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-11-15 22:08:18,305 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:18,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:18,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:18,312 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:9 [2019-11-15 22:08:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:18,372 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:18,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2019-11-15 22:08:18,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165770786] [2019-11-15 22:08:18,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-15 22:08:18,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:18,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-15 22:08:18,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 22:08:18,373 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand 35 states. [2019-11-15 22:08:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:21,921 INFO L93 Difference]: Finished difference Result 301 states and 316 transitions. [2019-11-15 22:08:21,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-15 22:08:21,922 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 40 [2019-11-15 22:08:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:21,924 INFO L225 Difference]: With dead ends: 301 [2019-11-15 22:08:21,924 INFO L226 Difference]: Without dead ends: 301 [2019-11-15 22:08:21,925 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=548, Invalid=3742, Unknown=0, NotChecked=0, Total=4290 [2019-11-15 22:08:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-15 22:08:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 146. [2019-11-15 22:08:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:08:21,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 160 transitions. [2019-11-15 22:08:21,930 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 160 transitions. Word has length 40 [2019-11-15 22:08:21,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:21,930 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 160 transitions. [2019-11-15 22:08:21,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-15 22:08:21,930 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2019-11-15 22:08:21,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 22:08:21,931 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:21,931 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 22:08:22,135 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:22,135 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:22,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:22,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1305559289, now seen corresponding path program 1 times [2019-11-15 22:08:22,136 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:22,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270826878] [2019-11-15 22:08:22,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:22,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:22,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:22,443 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:22,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270826878] [2019-11-15 22:08:22,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446308948] [2019-11-15 22:08:22,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:22,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-15 22:08:22,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:22,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:08:22,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:22,672 INFO L567 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2019-11-15 22:08:22,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:22,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-11-15 22:08:22,713 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:22,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:08:22,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:22,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:22,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:22,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-11-15 22:08:22,757 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_31|], 2=[|v_#memory_int_22|]} [2019-11-15 22:08:22,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:08:22,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:22,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:22,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:08:22,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 22:08:22,783 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:22,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:22,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:22,797 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2019-11-15 22:08:22,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-15 22:08:22,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:22,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:22,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:22,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2019-11-15 22:08:22,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:08:22,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:22,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:22,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:22,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-15 22:08:22,947 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:22,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:08:22,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:22,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:22,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:22,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-11-15 22:08:22,981 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_32|], 6=[|v_#memory_int_24|]} [2019-11-15 22:08:22,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2019-11-15 22:08:22,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:22,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:23,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:08:23,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 22:08:23,002 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:23,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:23,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:23,011 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2019-11-15 22:08:23,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-15 22:08:23,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:23,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:23,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:23,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:26 [2019-11-15 22:08:23,134 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:23,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 52 [2019-11-15 22:08:23,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:23,162 INFO L567 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2019-11-15 22:08:23,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:23,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:23,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:41 [2019-11-15 22:08:23,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:23,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:23,282 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:23,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-11-15 22:08:23,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:08:23,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:23,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:23,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:12 [2019-11-15 22:08:23,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:23,345 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:23,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2019-11-15 22:08:23,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681518696] [2019-11-15 22:08:23,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-15 22:08:23,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:23,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-15 22:08:23,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 22:08:23,346 INFO L87 Difference]: Start difference. First operand 146 states and 160 transitions. Second operand 36 states. [2019-11-15 22:08:25,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:25,060 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2019-11-15 22:08:25,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-15 22:08:25,061 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 41 [2019-11-15 22:08:25,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:25,062 INFO L225 Difference]: With dead ends: 178 [2019-11-15 22:08:25,062 INFO L226 Difference]: Without dead ends: 175 [2019-11-15 22:08:25,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=610, Invalid=3680, Unknown=0, NotChecked=0, Total=4290 [2019-11-15 22:08:25,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-15 22:08:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 141. [2019-11-15 22:08:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 22:08:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 153 transitions. [2019-11-15 22:08:25,066 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 153 transitions. Word has length 41 [2019-11-15 22:08:25,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:25,066 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 153 transitions. [2019-11-15 22:08:25,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-15 22:08:25,067 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2019-11-15 22:08:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 22:08:25,067 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:25,067 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:25,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:25,271 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:25,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:25,271 INFO L82 PathProgramCache]: Analyzing trace with hash -712617890, now seen corresponding path program 1 times [2019-11-15 22:08:25,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:25,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739891014] [2019-11-15 22:08:25,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:25,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:25,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:25,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739891014] [2019-11-15 22:08:25,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421937878] [2019-11-15 22:08:25,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:25,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-15 22:08:25,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:25,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 22:08:25,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:25,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:25,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 22:08:25,721 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:25,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:25,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:25,730 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2019-11-15 22:08:25,756 INFO L375 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 7 [2019-11-15 22:08:25,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:25,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:25,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:25,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:23 [2019-11-15 22:08:25,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 38 [2019-11-15 22:08:25,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:25,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:25,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 11 [2019-11-15 22:08:25,816 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:25,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:25,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:25,821 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:24 [2019-11-15 22:08:25,883 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:25,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2019-11-15 22:08:25,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:08:25,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:25,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:25,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-11-15 22:08:26,035 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:26,036 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:26,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 16 [2019-11-15 22:08:26,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:26,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:26,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:26,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:5 [2019-11-15 22:08:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:26,057 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:26,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2019-11-15 22:08:26,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57912988] [2019-11-15 22:08:26,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-15 22:08:26,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:26,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 22:08:26,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2019-11-15 22:08:26,058 INFO L87 Difference]: Start difference. First operand 141 states and 153 transitions. Second operand 28 states. [2019-11-15 22:08:27,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:27,106 INFO L93 Difference]: Finished difference Result 198 states and 208 transitions. [2019-11-15 22:08:27,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 22:08:27,107 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 43 [2019-11-15 22:08:27,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:27,108 INFO L225 Difference]: With dead ends: 198 [2019-11-15 22:08:27,108 INFO L226 Difference]: Without dead ends: 198 [2019-11-15 22:08:27,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=340, Invalid=1640, Unknown=0, NotChecked=0, Total=1980 [2019-11-15 22:08:27,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-15 22:08:27,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 142. [2019-11-15 22:08:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-15 22:08:27,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2019-11-15 22:08:27,112 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 43 [2019-11-15 22:08:27,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:27,113 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2019-11-15 22:08:27,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-15 22:08:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2019-11-15 22:08:27,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 22:08:27,113 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:27,114 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:27,317 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:27,317 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:27,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:27,318 INFO L82 PathProgramCache]: Analyzing trace with hash -616272228, now seen corresponding path program 1 times [2019-11-15 22:08:27,318 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:27,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457003427] [2019-11-15 22:08:27,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:27,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:27,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:27,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457003427] [2019-11-15 22:08:27,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651054223] [2019-11-15 22:08:27,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:27,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-15 22:08:27,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:27,769 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:27,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:08:27,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:27,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:27,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:27,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2019-11-15 22:08:27,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:08:27,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:27,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:27,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:08:27,801 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:27,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:27,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:27,810 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2019-11-15 22:08:27,815 INFO L375 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 16 treesize of output 8 [2019-11-15 22:08:27,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:27,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:27,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:27,820 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:15 [2019-11-15 22:08:27,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-15 22:08:27,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:27,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:27,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:27,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:11 [2019-11-15 22:08:27,895 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:27,896 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:27,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2019-11-15 22:08:27,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:27,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:27,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:27,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2019-11-15 22:08:27,915 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:08:27,915 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:27,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 22 [2019-11-15 22:08:27,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128749932] [2019-11-15 22:08:27,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 22:08:27,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:27,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 22:08:27,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:08:27,917 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand 23 states. [2019-11-15 22:08:28,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:28,731 INFO L93 Difference]: Finished difference Result 167 states and 179 transitions. [2019-11-15 22:08:28,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 22:08:28,731 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-11-15 22:08:28,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:28,732 INFO L225 Difference]: With dead ends: 167 [2019-11-15 22:08:28,732 INFO L226 Difference]: Without dead ends: 167 [2019-11-15 22:08:28,733 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=307, Invalid=1253, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 22:08:28,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-15 22:08:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 144. [2019-11-15 22:08:28,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-15 22:08:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2019-11-15 22:08:28,737 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 44 [2019-11-15 22:08:28,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:28,737 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2019-11-15 22:08:28,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 22:08:28,737 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2019-11-15 22:08:28,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 22:08:28,738 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:28,738 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:28,939 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:28,939 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:28,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:28,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1925986782, now seen corresponding path program 1 times [2019-11-15 22:08:28,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:28,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967153976] [2019-11-15 22:08:28,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:28,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:28,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:29,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967153976] [2019-11-15 22:08:29,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643694320] [2019-11-15 22:08:29,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:29,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-15 22:08:29,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:29,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 22:08:29,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:29,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:29,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 22:08:29,779 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:29,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:29,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:29,800 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:56 [2019-11-15 22:08:29,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-15 22:08:29,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:29,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:29,883 INFO L496 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. [2019-11-15 22:08:29,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:56 [2019-11-15 22:08:29,994 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_27|], 2=[|v_#memory_$Pointer$.base_37|]} [2019-11-15 22:08:29,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 13 [2019-11-15 22:08:29,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:30,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:30,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:08:30,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 48 [2019-11-15 22:08:30,038 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:30,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:30,061 INFO L496 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. [2019-11-15 22:08:30,062 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:57 [2019-11-15 22:08:30,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:08:30,210 INFO L375 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 21 treesize of output 7 [2019-11-15 22:08:30,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:30,239 INFO L567 ElimStorePlain]: treesize reduction 3, result has 93.6 percent of original size [2019-11-15 22:08:30,240 INFO L496 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. [2019-11-15 22:08:30,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:44 [2019-11-15 22:08:30,378 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:30,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2019-11-15 22:08:30,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:30,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:30,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:30,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:23 [2019-11-15 22:08:30,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:08:30,695 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:30,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2019-11-15 22:08:30,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110316765] [2019-11-15 22:08:30,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-15 22:08:30,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:30,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 22:08:30,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 22:08:30,697 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 34 states. [2019-11-15 22:08:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:31,905 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2019-11-15 22:08:31,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 22:08:31,906 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 45 [2019-11-15 22:08:31,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:31,906 INFO L225 Difference]: With dead ends: 149 [2019-11-15 22:08:31,906 INFO L226 Difference]: Without dead ends: 145 [2019-11-15 22:08:31,907 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=216, Invalid=1854, Unknown=0, NotChecked=0, Total=2070 [2019-11-15 22:08:31,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-15 22:08:31,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2019-11-15 22:08:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-15 22:08:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2019-11-15 22:08:31,910 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 45 [2019-11-15 22:08:31,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:31,910 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2019-11-15 22:08:31,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-15 22:08:31,910 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2019-11-15 22:08:31,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 22:08:31,911 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:31,911 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:32,111 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:32,112 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:32,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:32,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1924569725, now seen corresponding path program 1 times [2019-11-15 22:08:32,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:32,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479635882] [2019-11-15 22:08:32,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:32,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:32,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:32,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:32,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479635882] [2019-11-15 22:08:32,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156090351] [2019-11-15 22:08:32,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:32,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-15 22:08:32,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:32,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 22:08:32,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:32,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:32,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 22:08:32,625 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:32,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:32,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:32,634 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2019-11-15 22:08:32,668 INFO L375 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 7 [2019-11-15 22:08:32,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:32,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:32,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:32,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:23 [2019-11-15 22:08:32,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 38 [2019-11-15 22:08:32,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:32,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:32,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 11 [2019-11-15 22:08:32,738 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:32,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:32,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:32,742 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:24 [2019-11-15 22:08:32,806 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:32,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2019-11-15 22:08:32,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:08:32,819 INFO L567 ElimStorePlain]: treesize reduction 3, result has 89.3 percent of original size [2019-11-15 22:08:32,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:32,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:25 [2019-11-15 22:08:32,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:32,903 INFO L375 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 13 [2019-11-15 22:08:32,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:32,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:32,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:32,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:5 [2019-11-15 22:08:33,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:08:33,034 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:33,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 35 [2019-11-15 22:08:33,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415650554] [2019-11-15 22:08:33,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-15 22:08:33,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:33,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-15 22:08:33,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1075, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 22:08:33,036 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 35 states. [2019-11-15 22:08:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:34,795 INFO L93 Difference]: Finished difference Result 178 states and 186 transitions. [2019-11-15 22:08:34,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-15 22:08:34,795 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 45 [2019-11-15 22:08:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:34,796 INFO L225 Difference]: With dead ends: 178 [2019-11-15 22:08:34,796 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 22:08:34,797 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=464, Invalid=3696, Unknown=0, NotChecked=0, Total=4160 [2019-11-15 22:08:34,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 22:08:34,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 118. [2019-11-15 22:08:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-15 22:08:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2019-11-15 22:08:34,800 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 45 [2019-11-15 22:08:34,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:34,800 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2019-11-15 22:08:34,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-15 22:08:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2019-11-15 22:08:34,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 22:08:34,800 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:34,800 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:35,003 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:35,003 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:35,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:35,004 INFO L82 PathProgramCache]: Analyzing trace with hash 27841222, now seen corresponding path program 1 times [2019-11-15 22:08:35,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:35,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672005333] [2019-11-15 22:08:35,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:35,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:35,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:35,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672005333] [2019-11-15 22:08:35,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089870315] [2019-11-15 22:08:35,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:35,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-15 22:08:35,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:35,718 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_31|], 3=[|v_#valid_59|]} [2019-11-15 22:08:35,721 INFO L375 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 [2019-11-15 22:08:35,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:35,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:35,748 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:35,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 22:08:35,749 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:35,777 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-15 22:08:35,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:35,777 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:35 [2019-11-15 22:08:35,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:08:35,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:35,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:35,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:08:35,859 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:35,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:35,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:35,876 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:59 [2019-11-15 22:08:35,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-15 22:08:35,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:35,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:35,955 INFO L496 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. [2019-11-15 22:08:35,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:59 [2019-11-15 22:08:36,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:08:36,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 27 [2019-11-15 22:08:36,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:36,125 INFO L567 ElimStorePlain]: treesize reduction 11, result has 83.6 percent of original size [2019-11-15 22:08:36,125 INFO L496 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. [2019-11-15 22:08:36,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:82, output treesize:56 [2019-11-15 22:08:36,170 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_32|], 3=[|v_#valid_60|]} [2019-11-15 22:08:36,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:08:36,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-11-15 22:08:36,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:36,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:36,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:08:36,203 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:36,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 22:08:36,204 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:36,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:36,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:36,220 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:59 [2019-11-15 22:08:36,272 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:36,293 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:36,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 49 [2019-11-15 22:08:36,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:36,350 INFO L567 ElimStorePlain]: treesize reduction 22, result has 70.3 percent of original size [2019-11-15 22:08:36,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:36,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:61 [2019-11-15 22:08:36,506 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:36,536 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:36,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 135 [2019-11-15 22:08:36,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:36,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:36,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:08:36,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:36,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:36,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:36,583 INFO L567 ElimStorePlain]: treesize reduction 368, result has 21.4 percent of original size [2019-11-15 22:08:36,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:36,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:150, output treesize:99 [2019-11-15 22:08:37,043 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:37,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 12 [2019-11-15 22:08:37,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:37,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:37,066 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:37,066 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:37,067 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:37,108 INFO L341 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2019-11-15 22:08:37,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 50 [2019-11-15 22:08:37,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:37,109 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:37,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:37,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:37,123 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:133, output treesize:5 [2019-11-15 22:08:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:37,139 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:37,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2019-11-15 22:08:37,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826848872] [2019-11-15 22:08:37,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-15 22:08:37,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:37,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-15 22:08:37,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1347, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 22:08:37,140 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 39 states. [2019-11-15 22:08:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:40,278 INFO L93 Difference]: Finished difference Result 192 states and 206 transitions. [2019-11-15 22:08:40,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-15 22:08:40,278 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 47 [2019-11-15 22:08:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:40,279 INFO L225 Difference]: With dead ends: 192 [2019-11-15 22:08:40,279 INFO L226 Difference]: Without dead ends: 192 [2019-11-15 22:08:40,280 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=507, Invalid=3653, Unknown=0, NotChecked=0, Total=4160 [2019-11-15 22:08:40,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-15 22:08:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 120. [2019-11-15 22:08:40,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 22:08:40,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2019-11-15 22:08:40,283 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 47 [2019-11-15 22:08:40,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:40,284 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2019-11-15 22:08:40,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-15 22:08:40,284 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2019-11-15 22:08:40,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 22:08:40,284 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:40,285 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:40,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:40,499 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:40,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:40,499 INFO L82 PathProgramCache]: Analyzing trace with hash 27841223, now seen corresponding path program 1 times [2019-11-15 22:08:40,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:40,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103325325] [2019-11-15 22:08:40,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:40,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:40,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:41,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103325325] [2019-11-15 22:08:41,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640063998] [2019-11-15 22:08:41,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:41,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 66 conjunts are in the unsatisfiable core [2019-11-15 22:08:41,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:41,303 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_33|], 3=[|v_#valid_61|]} [2019-11-15 22:08:41,306 INFO L375 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 [2019-11-15 22:08:41,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:41,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:41,334 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:41,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 22:08:41,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:41,362 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-15 22:08:41,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:41,363 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:35 [2019-11-15 22:08:41,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:08:41,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:41,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:41,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:08:41,440 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:41,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:41,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:41,456 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:59 [2019-11-15 22:08:41,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-15 22:08:41,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:41,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:41,531 INFO L496 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. [2019-11-15 22:08:41,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:59 [2019-11-15 22:08:41,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:08:41,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 27 [2019-11-15 22:08:41,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:41,645 INFO L567 ElimStorePlain]: treesize reduction 11, result has 83.6 percent of original size [2019-11-15 22:08:41,646 INFO L496 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. [2019-11-15 22:08:41,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:82, output treesize:56 [2019-11-15 22:08:41,696 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_34|], 3=[|v_#valid_62|]} [2019-11-15 22:08:41,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:08:41,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-11-15 22:08:41,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:41,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:41,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:08:41,754 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:41,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 22:08:41,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:41,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:41,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:41,787 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:62 [2019-11-15 22:08:41,882 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_29|], 2=[|v_#memory_$Pointer$.base_46|]} [2019-11-15 22:08:41,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:08:41,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:41,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:41,916 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:41,924 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:41,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 49 [2019-11-15 22:08:41,924 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:41,987 INFO L567 ElimStorePlain]: treesize reduction 22, result has 73.5 percent of original size [2019-11-15 22:08:41,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:41,987 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:70 [2019-11-15 22:08:42,152 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_30|], 6=[|v_#memory_$Pointer$.base_47|]} [2019-11-15 22:08:42,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 19 [2019-11-15 22:08:42,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:42,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:42,191 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:42,246 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:42,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 139 [2019-11-15 22:08:42,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:42,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:08:42,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:42,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:42,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:42,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:42,250 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 22:08:42,326 INFO L567 ElimStorePlain]: treesize reduction 376, result has 20.7 percent of original size [2019-11-15 22:08:42,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:42,326 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:199, output treesize:97 [2019-11-15 22:08:42,694 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 12=[|#memory_$Pointer$.base|]} [2019-11-15 22:08:42,698 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:42,698 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:42,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2019-11-15 22:08:42,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:42,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:42,727 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:42,727 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:42,773 INFO L341 Elim1Store]: treesize reduction 8, result has 88.2 percent of original size [2019-11-15 22:08:42,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 94 [2019-11-15 22:08:42,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:42,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:42,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:42,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:42,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:42,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:42,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:42,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:42,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:42,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:42,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:42,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:42,779 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:42,834 INFO L567 ElimStorePlain]: treesize reduction 45, result has 55.9 percent of original size [2019-11-15 22:08:42,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:42,835 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:146, output treesize:23 [2019-11-15 22:08:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:42,940 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:42,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2019-11-15 22:08:42,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584366437] [2019-11-15 22:08:42,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-15 22:08:42,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:42,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-15 22:08:42,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1651, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 22:08:42,941 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand 43 states. [2019-11-15 22:08:46,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:46,014 INFO L93 Difference]: Finished difference Result 218 states and 234 transitions. [2019-11-15 22:08:46,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 22:08:46,014 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 47 [2019-11-15 22:08:46,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:46,015 INFO L225 Difference]: With dead ends: 218 [2019-11-15 22:08:46,015 INFO L226 Difference]: Without dead ends: 218 [2019-11-15 22:08:46,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=486, Invalid=3804, Unknown=0, NotChecked=0, Total=4290 [2019-11-15 22:08:46,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-11-15 22:08:46,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 121. [2019-11-15 22:08:46,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 22:08:46,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2019-11-15 22:08:46,020 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 47 [2019-11-15 22:08:46,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:46,020 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2019-11-15 22:08:46,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-15 22:08:46,021 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2019-11-15 22:08:46,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 22:08:46,021 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:46,021 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:46,225 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:46,225 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:46,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:46,225 INFO L82 PathProgramCache]: Analyzing trace with hash 215038472, now seen corresponding path program 1 times [2019-11-15 22:08:46,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:46,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900209682] [2019-11-15 22:08:46,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:46,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:46,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:08:46,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900209682] [2019-11-15 22:08:46,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574612489] [2019-11-15 22:08:46,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:46,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-15 22:08:46,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:46,846 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:46,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:08:46,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:46,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:46,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:46,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-15 22:08:46,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:08:46,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:46,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:46,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:46,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2019-11-15 22:08:47,011 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-15 22:08:47,011 INFO L375 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 1 case distinctions, treesize of input 35 treesize of output 27 [2019-11-15 22:08:47,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:47,030 INFO L567 ElimStorePlain]: treesize reduction 10, result has 73.7 percent of original size [2019-11-15 22:08:47,031 INFO L496 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. [2019-11-15 22:08:47,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:28 [2019-11-15 22:08:47,065 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:47,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:08:47,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:47,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:47,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:47,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:33 [2019-11-15 22:08:47,126 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:47,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 60 [2019-11-15 22:08:47,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:47,154 INFO L567 ElimStorePlain]: treesize reduction 34, result has 54.7 percent of original size [2019-11-15 22:08:47,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:47,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:38 [2019-11-15 22:08:47,314 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:47,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 133 [2019-11-15 22:08:47,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:08:47,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:47,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:47,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:47,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:47,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:47,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:47,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 22:08:47,389 INFO L567 ElimStorePlain]: treesize reduction 740, result has 6.8 percent of original size [2019-11-15 22:08:47,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:47,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:47,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:98, output treesize:77 [2019-11-15 22:08:47,569 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:08:47,571 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:47,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2019-11-15 22:08:47,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:47,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:47,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:47,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:10 [2019-11-15 22:08:47,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 22:08:47,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:47,665 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-15 22:08:47,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:47,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-11-15 22:08:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:08:47,710 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:47,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2019-11-15 22:08:47,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379741203] [2019-11-15 22:08:47,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-15 22:08:47,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:47,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-15 22:08:47,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1346, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 22:08:47,711 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand 39 states. [2019-11-15 22:08:50,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:50,557 INFO L93 Difference]: Finished difference Result 233 states and 248 transitions. [2019-11-15 22:08:50,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-15 22:08:50,557 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 50 [2019-11-15 22:08:50,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:50,558 INFO L225 Difference]: With dead ends: 233 [2019-11-15 22:08:50,558 INFO L226 Difference]: Without dead ends: 233 [2019-11-15 22:08:50,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1230 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=604, Invalid=4798, Unknown=0, NotChecked=0, Total=5402 [2019-11-15 22:08:50,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-11-15 22:08:50,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 148. [2019-11-15 22:08:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-15 22:08:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 166 transitions. [2019-11-15 22:08:50,562 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 166 transitions. Word has length 50 [2019-11-15 22:08:50,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:50,562 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 166 transitions. [2019-11-15 22:08:50,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-15 22:08:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 166 transitions. [2019-11-15 22:08:50,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 22:08:50,563 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:50,563 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:08:50,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:50,764 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:50,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:50,764 INFO L82 PathProgramCache]: Analyzing trace with hash -773453760, now seen corresponding path program 2 times [2019-11-15 22:08:50,764 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:50,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855825237] [2019-11-15 22:08:50,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:50,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:50,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:51,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855825237] [2019-11-15 22:08:51,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017226424] [2019-11-15 22:08:51,382 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:51,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:08:51,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:08:51,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-15 22:08:51,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:51,540 INFO L375 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 [2019-11-15 22:08:51,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:51,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:51,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:51,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 22:08:51,611 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:51,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 22:08:51,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:51,630 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-15 22:08:51,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:51,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-15 22:08:51,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:08:51,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:51,684 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.8 percent of original size [2019-11-15 22:08:51,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:51,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:36 [2019-11-15 22:08:51,809 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-15 22:08:51,810 INFO L375 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 1 case distinctions, treesize of input 46 treesize of output 32 [2019-11-15 22:08:51,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:51,839 INFO L567 ElimStorePlain]: treesize reduction 10, result has 73.0 percent of original size [2019-11-15 22:08:51,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:51,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:27 [2019-11-15 22:08:51,891 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:51,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-11-15 22:08:51,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:51,925 INFO L567 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-11-15 22:08:51,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:51,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:58 [2019-11-15 22:08:51,991 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:51,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 69 [2019-11-15 22:08:51,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:52,024 INFO L567 ElimStorePlain]: treesize reduction 34, result has 59.0 percent of original size [2019-11-15 22:08:52,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:52,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:58 [2019-11-15 22:08:52,215 INFO L341 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2019-11-15 22:08:52,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 83 [2019-11-15 22:08:52,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,218 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:52,251 INFO L567 ElimStorePlain]: treesize reduction 36, result has 57.6 percent of original size [2019-11-15 22:08:52,251 INFO L496 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. [2019-11-15 22:08:52,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:115, output treesize:64 [2019-11-15 22:08:52,326 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:52,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 189 [2019-11-15 22:08:52,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:52,382 INFO L567 ElimStorePlain]: treesize reduction 96, result has 58.4 percent of original size [2019-11-15 22:08:52,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:52,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:111, output treesize:135 [2019-11-15 22:08:52,470 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:52,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 148 [2019-11-15 22:08:52,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:08:52,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:08:52,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,477 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:52,550 INFO L567 ElimStorePlain]: treesize reduction 84, result has 47.2 percent of original size [2019-11-15 22:08:52,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:52,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:148, output treesize:111 [2019-11-15 22:08:52,862 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-15 22:08:52,863 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:52,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 253 treesize of output 237 [2019-11-15 22:08:52,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:08:52,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:08:52,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:08:52,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:52,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 7 xjuncts. [2019-11-15 22:08:53,100 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2019-11-15 22:08:53,101 INFO L567 ElimStorePlain]: treesize reduction 3467, result has 5.3 percent of original size [2019-11-15 22:08:53,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:53,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:261, output treesize:192 [2019-11-15 22:08:53,356 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:53,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 167 treesize of output 93 [2019-11-15 22:08:53,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:53,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:53,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:53,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:53,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:53,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:53,359 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:53,396 INFO L567 ElimStorePlain]: treesize reduction 44, result has 50.6 percent of original size [2019-11-15 22:08:53,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 22:08:53,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:172, output treesize:45 [2019-11-15 22:08:53,518 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:53,518 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:53,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 42 [2019-11-15 22:08:53,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645266637] [2019-11-15 22:08:53,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-15 22:08:53,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:53,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-15 22:08:53,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1600, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 22:08:53,520 INFO L87 Difference]: Start difference. First operand 148 states and 166 transitions. Second operand 43 states. [2019-11-15 22:08:57,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:57,906 INFO L93 Difference]: Finished difference Result 291 states and 312 transitions. [2019-11-15 22:08:57,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-11-15 22:08:57,907 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 50 [2019-11-15 22:08:57,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:57,908 INFO L225 Difference]: With dead ends: 291 [2019-11-15 22:08:57,908 INFO L226 Difference]: Without dead ends: 291 [2019-11-15 22:08:57,909 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3763 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1625, Invalid=9717, Unknown=0, NotChecked=0, Total=11342 [2019-11-15 22:08:57,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-15 22:08:57,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 150. [2019-11-15 22:08:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-15 22:08:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 169 transitions. [2019-11-15 22:08:57,913 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 169 transitions. Word has length 50 [2019-11-15 22:08:57,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:57,913 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 169 transitions. [2019-11-15 22:08:57,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-15 22:08:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions. [2019-11-15 22:08:57,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 22:08:57,914 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:57,914 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:08:58,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:58,118 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:08:58,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:58,119 INFO L82 PathProgramCache]: Analyzing trace with hash -773453759, now seen corresponding path program 2 times [2019-11-15 22:08:58,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:58,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264960096] [2019-11-15 22:08:58,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:58,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:58,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:58,910 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:58,910 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264960096] [2019-11-15 22:08:58,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821306498] [2019-11-15 22:08:58,911 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:59,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:08:59,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:08:59,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-15 22:08:59,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:59,104 INFO L375 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 [2019-11-15 22:08:59,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:59,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:59,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:59,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 22:08:59,213 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:59,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 22:08:59,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:59,243 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 22:08:59,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:59,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-15 22:08:59,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:08:59,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:59,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:59,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 22:08:59,327 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:59,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:59,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:59,339 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2019-11-15 22:08:59,466 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-15 22:08:59,466 INFO L375 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 1 case distinctions, treesize of input 46 treesize of output 32 [2019-11-15 22:08:59,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:59,491 INFO L567 ElimStorePlain]: treesize reduction 10, result has 83.6 percent of original size [2019-11-15 22:08:59,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 22:08:59,494 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:59,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:59,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:59,502 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:36 [2019-11-15 22:08:59,579 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:59,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-11-15 22:08:59,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:59,616 INFO L567 ElimStorePlain]: treesize reduction 46, result has 59.3 percent of original size [2019-11-15 22:08:59,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:59,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:67 [2019-11-15 22:08:59,694 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:59,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 69 [2019-11-15 22:08:59,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:59,757 INFO L567 ElimStorePlain]: treesize reduction 34, result has 70.9 percent of original size [2019-11-15 22:08:59,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 23 treesize of output 22 [2019-11-15 22:08:59,761 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:59,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:59,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:59,782 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:110, output treesize:79 [2019-11-15 22:08:59,955 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_34|], 6=[|v_#memory_$Pointer$.base_61|]} [2019-11-15 22:08:59,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:08:59,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 22:08:59,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:59,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:00,029 INFO L341 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2019-11-15 22:09:00,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 90 [2019-11-15 22:09:00,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,032 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:09:00,080 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.0 percent of original size [2019-11-15 22:09:00,081 INFO L496 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. [2019-11-15 22:09:00,081 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:157, output treesize:91 [2019-11-15 22:09:00,127 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_35|], 6=[|v_#valid_73|]} [2019-11-15 22:09:00,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:00,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-11-15 22:09:00,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:00,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:00,171 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:00,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2019-11-15 22:09:00,171 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:00,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:00,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:09:00,192 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:138, output treesize:129 [2019-11-15 22:09:00,248 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_35|], 6=[|v_#memory_$Pointer$.base_62|]} [2019-11-15 22:09:00,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:00,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 22:09:00,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:00,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:00,318 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:00,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 145 [2019-11-15 22:09:00,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:00,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:00,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,324 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:09:00,392 INFO L567 ElimStorePlain]: treesize reduction 84, result has 51.7 percent of original size [2019-11-15 22:09:00,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:09:00,393 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:155, output treesize:117 [2019-11-15 22:09:00,577 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_36|], 12=[|v_#memory_$Pointer$.base_63|]} [2019-11-15 22:09:00,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 79 treesize of output 13 [2019-11-15 22:09:00,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:00,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:00,674 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:00,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 238 treesize of output 234 [2019-11-15 22:09:00,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:00,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:00,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:00,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:00,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:00,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:00,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:00,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:00,696 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 15 xjuncts. [2019-11-15 22:09:00,854 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2019-11-15 22:09:00,855 INFO L567 ElimStorePlain]: treesize reduction 8180, result has 2.2 percent of original size [2019-11-15 22:09:00,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:09:00,855 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:324, output treesize:186 [2019-11-15 22:09:01,000 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-11-15 22:09:01,008 INFO L375 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 7 [2019-11-15 22:09:01,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:01,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:01,070 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:01,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 90 [2019-11-15 22:09:01,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:01,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:01,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:01,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:01,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:01,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:01,073 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:09:01,122 INFO L567 ElimStorePlain]: treesize reduction 44, result has 50.6 percent of original size [2019-11-15 22:09:01,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:09:01,123 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:173, output treesize:18 [2019-11-15 22:09:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:01,283 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:01,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 42 [2019-11-15 22:09:01,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138365894] [2019-11-15 22:09:01,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-15 22:09:01,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:01,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-15 22:09:01,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1667, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 22:09:01,285 INFO L87 Difference]: Start difference. First operand 150 states and 169 transitions. Second operand 43 states. [2019-11-15 22:09:02,687 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 80 [2019-11-15 22:09:03,741 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-11-15 22:09:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:08,626 INFO L93 Difference]: Finished difference Result 315 states and 339 transitions. [2019-11-15 22:09:08,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-11-15 22:09:08,627 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 50 [2019-11-15 22:09:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:08,628 INFO L225 Difference]: With dead ends: 315 [2019-11-15 22:09:08,628 INFO L226 Difference]: Without dead ends: 315 [2019-11-15 22:09:08,629 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2818 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1313, Invalid=9193, Unknown=0, NotChecked=0, Total=10506 [2019-11-15 22:09:08,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-15 22:09:08,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 155. [2019-11-15 22:09:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-15 22:09:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2019-11-15 22:09:08,634 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 50 [2019-11-15 22:09:08,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:08,634 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2019-11-15 22:09:08,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-15 22:09:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2019-11-15 22:09:08,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 22:09:08,635 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:08,635 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:08,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:08,839 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:09:08,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:08,839 INFO L82 PathProgramCache]: Analyzing trace with hash -601606729, now seen corresponding path program 2 times [2019-11-15 22:09:08,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:08,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640317967] [2019-11-15 22:09:08,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:08,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:08,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:09,727 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:09,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640317967] [2019-11-15 22:09:09,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970605947] [2019-11-15 22:09:09,727 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:09,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:09:09,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:09:09,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 69 conjunts are in the unsatisfiable core [2019-11-15 22:09:09,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:09,940 INFO L375 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 [2019-11-15 22:09:09,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:09,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:09,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:09,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 22:09:10,088 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:10,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 22:09:10,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:10,126 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 22:09:10,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:10,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-15 22:09:10,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 22:09:10,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:10,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:10,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:09:10,200 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:10,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:10,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:10,213 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2019-11-15 22:09:10,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:10,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2019-11-15 22:09:10,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:10,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:10,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:10,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2019-11-15 22:09:10,375 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:10,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:10,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:10,387 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:60 [2019-11-15 22:09:10,447 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:10,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-15 22:09:10,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:10,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:10,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:10,459 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:58 [2019-11-15 22:09:10,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:10,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:10,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 21 treesize of output 20 [2019-11-15 22:09:10,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:10,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:10,519 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:09:10,523 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:09:10,534 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:10,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 49 [2019-11-15 22:09:10,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:10,535 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:10,581 INFO L567 ElimStorePlain]: treesize reduction 41, result has 53.4 percent of original size [2019-11-15 22:09:10,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:10,581 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:75, output treesize:41 [2019-11-15 22:09:10,626 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_29|], 5=[|v_#memory_$Pointer$.base_67|, |v_#memory_$Pointer$.offset_40|]} [2019-11-15 22:09:10,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 35 treesize of output 23 [2019-11-15 22:09:10,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:10,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:10,703 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:10,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 157 [2019-11-15 22:09:10,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:10,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:10,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:10,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:10,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:10,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:10,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:10,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:10,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:10,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:10,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:10,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:10,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:10,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:10,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:10,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:10,713 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-15 22:09:10,791 INFO L567 ElimStorePlain]: treesize reduction 909, result has 11.5 percent of original size [2019-11-15 22:09:10,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:10,799 INFO L375 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 95 [2019-11-15 22:09:10,799 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:10,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:10,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:10,810 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:184, output treesize:62 [2019-11-15 22:09:11,276 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:09:11,294 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-15 22:09:11,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 46 [2019-11-15 22:09:11,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:11,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:11,296 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:09:11,335 INFO L567 ElimStorePlain]: treesize reduction 4, result has 92.6 percent of original size [2019-11-15 22:09:11,341 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:11,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2019-11-15 22:09:11,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:11,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:11,356 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:09:11,380 INFO L567 ElimStorePlain]: treesize reduction 7, result has 80.6 percent of original size [2019-11-15 22:09:11,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:11,381 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:95, output treesize:7 [2019-11-15 22:09:11,451 INFO L375 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 7 [2019-11-15 22:09:11,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:11,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:11,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:11,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 22:09:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:11,500 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:11,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 42 [2019-11-15 22:09:11,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73698675] [2019-11-15 22:09:11,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-11-15 22:09:11,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:11,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-15 22:09:11,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1605, Unknown=0, NotChecked=0, Total=1722 [2019-11-15 22:09:11,501 INFO L87 Difference]: Start difference. First operand 155 states and 174 transitions. Second operand 42 states. [2019-11-15 22:09:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:13,874 INFO L93 Difference]: Finished difference Result 200 states and 208 transitions. [2019-11-15 22:09:13,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-15 22:09:13,874 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 54 [2019-11-15 22:09:13,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:13,875 INFO L225 Difference]: With dead ends: 200 [2019-11-15 22:09:13,875 INFO L226 Difference]: Without dead ends: 197 [2019-11-15 22:09:13,876 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=476, Invalid=4780, Unknown=0, NotChecked=0, Total=5256 [2019-11-15 22:09:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-15 22:09:13,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 137. [2019-11-15 22:09:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-15 22:09:13,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2019-11-15 22:09:13,880 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 54 [2019-11-15 22:09:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:13,881 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2019-11-15 22:09:13,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-11-15 22:09:13,881 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2019-11-15 22:09:13,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 22:09:13,881 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:13,881 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:14,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:14,086 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:09:14,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:14,086 INFO L82 PathProgramCache]: Analyzing trace with hash -293425165, now seen corresponding path program 3 times [2019-11-15 22:09:14,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:14,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204296535] [2019-11-15 22:09:14,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:14,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:14,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:14,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204296535] [2019-11-15 22:09:14,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831792115] [2019-11-15 22:09:14,908 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:15,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 22:09:15,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:09:15,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 98 conjunts are in the unsatisfiable core [2019-11-15 22:09:15,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:15,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 22:09:15,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:15,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:15,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 22:09:15,188 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:15,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:15,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:15,195 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 22:09:15,304 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_30|], 2=[|v_#memory_$Pointer$.base_69|, |v_#memory_$Pointer$.offset_42|]} [2019-11-15 22:09:15,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:09:15,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:15,342 INFO L567 ElimStorePlain]: treesize reduction 3, result has 96.0 percent of original size [2019-11-15 22:09:15,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:15,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-15 22:09:15,347 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:15,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:15,376 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-15 22:09:15,376 INFO L375 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 1 case distinctions, treesize of input 30 treesize of output 22 [2019-11-15 22:09:15,377 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:15,398 INFO L567 ElimStorePlain]: treesize reduction 8, result has 82.6 percent of original size [2019-11-15 22:09:15,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:15,398 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:79, output treesize:38 [2019-11-15 22:09:15,488 INFO L341 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-11-15 22:09:15,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 69 [2019-11-15 22:09:15,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:15,526 INFO L567 ElimStorePlain]: treesize reduction 28, result has 64.6 percent of original size [2019-11-15 22:09:15,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:15,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:51 [2019-11-15 22:09:15,585 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:09:15,593 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:15,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 36 [2019-11-15 22:09:15,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:15,652 INFO L567 ElimStorePlain]: treesize reduction 12, result has 88.9 percent of original size [2019-11-15 22:09:15,657 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:09:15,666 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:15,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 36 [2019-11-15 22:09:15,666 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:15,725 INFO L567 ElimStorePlain]: treesize reduction 12, result has 88.9 percent of original size [2019-11-15 22:09:15,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:15,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 22:09:15,738 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:15,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:15,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:15,763 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:96, output treesize:77 [2019-11-15 22:09:15,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:15,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:15,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:15,996 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_44|], 5=[|v_#memory_$Pointer$.base_71|, |v_#memory_int_32|]} [2019-11-15 22:09:16,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:16,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 122 [2019-11-15 22:09:16,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:16,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 86 treesize of output 71 [2019-11-15 22:09:16,009 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:16,097 INFO L567 ElimStorePlain]: treesize reduction 22, result has 88.5 percent of original size [2019-11-15 22:09:16,141 INFO L341 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-11-15 22:09:16,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 96 [2019-11-15 22:09:16,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:16,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:16,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:16,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:16,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:16,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:16,144 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:09:16,166 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-15 22:09:16,166 INFO L375 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 1 case distinctions, treesize of input 62 treesize of output 54 [2019-11-15 22:09:16,167 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:16,247 INFO L567 ElimStorePlain]: treesize reduction 32, result has 77.5 percent of original size [2019-11-15 22:09:16,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2019-11-15 22:09:16,254 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:16,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2019-11-15 22:09:16,259 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:16,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:16,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:09:16,293 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:221, output treesize:111 [2019-11-15 22:09:16,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:16,376 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_36|], 6=[|v_#valid_78|]} [2019-11-15 22:09:16,380 INFO L375 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 53 treesize of output 52 [2019-11-15 22:09:16,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:16,385 INFO L375 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 85 treesize of output 84 [2019-11-15 22:09:16,385 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:16,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:16,444 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:16,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 62 [2019-11-15 22:09:16,445 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:16,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:16,462 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:16,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 100 [2019-11-15 22:09:16,463 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:16,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:16,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:09:16,504 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:139, output treesize:122 [2019-11-15 22:09:16,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:16,599 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_45|], 5=[|v_#memory_$Pointer$.base_72|], 11=[|v_#memory_int_33|]} [2019-11-15 22:09:16,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 95 treesize of output 91 [2019-11-15 22:09:16,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:16,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 125 [2019-11-15 22:09:16,612 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:16,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:16,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 91 treesize of output 90 [2019-11-15 22:09:16,699 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:16,726 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:16,726 INFO L375 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 151 [2019-11-15 22:09:16,727 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:16,877 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-11-15 22:09:16,878 INFO L567 ElimStorePlain]: treesize reduction 56, result has 78.6 percent of original size [2019-11-15 22:09:16,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:16,904 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 105 [2019-11-15 22:09:16,905 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:16,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:16,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 74 [2019-11-15 22:09:16,914 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:16,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:16,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:09:16,971 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:222, output treesize:186 [2019-11-15 22:09:17,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,377 INFO L392 ElimStorePlain]: Different costs {18=[|v_#memory_$Pointer$.offset_46|], 27=[|v_#memory_int_34|, |v_#memory_$Pointer$.base_73|]} [2019-11-15 22:09:17,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 251 treesize of output 199 [2019-11-15 22:09:17,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:17,409 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 372 treesize of output 307 [2019-11-15 22:09:17,409 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:17,532 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-15 22:09:17,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:17,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 198 [2019-11-15 22:09:17,550 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:17,565 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 315 treesize of output 303 [2019-11-15 22:09:17,565 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:17,731 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-11-15 22:09:17,732 INFO L567 ElimStorePlain]: treesize reduction 36, result has 92.7 percent of original size [2019-11-15 22:09:17,804 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:17,805 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 275 treesize of output 253 [2019-11-15 22:09:17,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:17,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:17,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,135 INFO L496 ElimStorePlain]: Start of recursive call 6: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-15 22:09:18,218 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:18,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 178 [2019-11-15 22:09:18,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:18,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:18,249 INFO L496 ElimStorePlain]: Start of recursive call 7: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-15 22:09:19,131 WARN L191 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 666 DAG size of output: 84 [2019-11-15 22:09:19,132 INFO L567 ElimStorePlain]: treesize reduction 10750, result has 3.2 percent of original size [2019-11-15 22:09:19,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-15 22:09:19,133 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:624, output treesize:352 [2019-11-15 22:09:19,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 13 [2019-11-15 22:09:19,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:19,797 INFO L567 ElimStorePlain]: treesize reduction 18, result has 90.7 percent of original size [2019-11-15 22:09:19,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 22:09:19,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:236, output treesize:176 [2019-11-15 22:09:19,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:19,980 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:09:19,989 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:19,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 60 [2019-11-15 22:09:19,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:20,037 INFO L567 ElimStorePlain]: treesize reduction 7, result has 95.8 percent of original size [2019-11-15 22:09:20,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:09:20,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:186, output treesize:155 [2019-11-15 22:09:20,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 7 [2019-11-15 22:09:20,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:20,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:20,230 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:20,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 76 [2019-11-15 22:09:20,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:20,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:20,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:20,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:20,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:20,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:20,232 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:09:20,262 INFO L567 ElimStorePlain]: treesize reduction 32, result has 52.2 percent of original size [2019-11-15 22:09:20,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:09:20,262 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:166, output treesize:15 [2019-11-15 22:09:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:20,416 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:20,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 53 [2019-11-15 22:09:20,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764262332] [2019-11-15 22:09:20,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-11-15 22:09:20,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:20,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-11-15 22:09:20,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2667, Unknown=3, NotChecked=0, Total=2862 [2019-11-15 22:09:20,417 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand 54 states. [2019-11-15 22:09:21,653 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 48 [2019-11-15 22:09:22,580 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-11-15 22:09:22,949 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2019-11-15 22:09:23,268 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 117 [2019-11-15 22:09:23,942 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 127 [2019-11-15 22:09:24,223 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 99 [2019-11-15 22:09:24,645 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 101 [2019-11-15 22:09:25,148 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 99 [2019-11-15 22:09:25,466 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 103 [2019-11-15 22:09:25,918 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 103 [2019-11-15 22:09:26,550 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 129 [2019-11-15 22:09:27,051 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 131 [2019-11-15 22:09:27,367 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 133 [2019-11-15 22:09:27,788 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 134 [2019-11-15 22:09:29,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:29,196 INFO L93 Difference]: Finished difference Result 248 states and 261 transitions. [2019-11-15 22:09:29,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-11-15 22:09:29,196 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 57 [2019-11-15 22:09:29,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:29,197 INFO L225 Difference]: With dead ends: 248 [2019-11-15 22:09:29,198 INFO L226 Difference]: Without dead ends: 248 [2019-11-15 22:09:29,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3082 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1088, Invalid=10465, Unknown=3, NotChecked=0, Total=11556 [2019-11-15 22:09:29,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-15 22:09:29,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 164. [2019-11-15 22:09:29,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-15 22:09:29,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2019-11-15 22:09:29,202 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 57 [2019-11-15 22:09:29,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:29,203 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2019-11-15 22:09:29,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-11-15 22:09:29,203 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2019-11-15 22:09:29,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 22:09:29,204 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:29,204 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:29,408 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:29,408 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2019-11-15 22:09:29,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:29,409 INFO L82 PathProgramCache]: Analyzing trace with hash -293425164, now seen corresponding path program 2 times [2019-11-15 22:09:29,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:29,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13361710] [2019-11-15 22:09:29,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:29,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:29,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:30,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13361710] [2019-11-15 22:09:30,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673410580] [2019-11-15 22:09:30,652 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:30,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:09:30,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:09:30,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 96 conjunts are in the unsatisfiable core [2019-11-15 22:09:30,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:30,833 INFO L375 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 [2019-11-15 22:09:30,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:30,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:30,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:30,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 22:09:30,932 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:30,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 22:09:30,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:30,954 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 22:09:30,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:30,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-15 22:09:31,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 22:09:31,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:31,051 INFO L567 ElimStorePlain]: treesize reduction 5, result has 90.7 percent of original size [2019-11-15 22:09:31,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:09:31,055 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:31,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:31,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:31,082 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:45 [2019-11-15 22:09:31,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:31,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2019-11-15 22:09:31,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:31,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:31,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:31,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2019-11-15 22:09:31,350 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:31,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:31,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:31,365 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2019-11-15 22:09:31,431 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:31,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 22:09:31,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:31,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:31,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:31,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:49 [2019-11-15 22:09:31,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:31,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:31,464 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 21 treesize of output 20 [2019-11-15 22:09:31,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:31,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:31,482 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:09:31,484 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:09:31,493 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:31,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 49 [2019-11-15 22:09:31,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:31,494 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:31,529 INFO L567 ElimStorePlain]: treesize reduction 41, result has 55.9 percent of original size [2019-11-15 22:09:31,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:31,529 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:55 [2019-11-15 22:09:31,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:31,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:31,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:31,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2019-11-15 22:09:31,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:31,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:31,745 INFO L341 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-11-15 22:09:31,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 65 [2019-11-15 22:09:31,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:31,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:31,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:31,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:31,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:31,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:31,747 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:09:31,802 INFO L567 ElimStorePlain]: treesize reduction 24, result has 65.2 percent of original size [2019-11-15 22:09:31,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:31,803 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:54 [2019-11-15 22:09:31,853 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:31,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-15 22:09:31,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:31,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:31,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:31,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:78, output treesize:72 [2019-11-15 22:09:31,956 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:31,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 113 [2019-11-15 22:09:31,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:31,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:31,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:31,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:31,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:31,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:31,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:31,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:31,959 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:09:32,011 INFO L567 ElimStorePlain]: treesize reduction 64, result has 54.9 percent of original size [2019-11-15 22:09:32,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:32,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-11-15 22:09:32,015 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:32,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:32,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:09:32,036 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:80 [2019-11-15 22:09:32,261 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_35|], 11=[|v_#memory_$Pointer$.base_79|, |v_#memory_$Pointer$.offset_52|]} [2019-11-15 22:09:32,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2019-11-15 22:09:32,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:09:32,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:32,359 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:32,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 299 treesize of output 278 [2019-11-15 22:09:32,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,414 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 8 xjuncts. [2019-11-15 22:09:32,705 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 62 [2019-11-15 22:09:32,706 INFO L567 ElimStorePlain]: treesize reduction 3105, result has 10.1 percent of original size [2019-11-15 22:09:32,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:32,822 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-15 22:09:32,822 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:09:32,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 339 treesize of output 558 [2019-11-15 22:09:32,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:32,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:32,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:32,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:32,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:09:32,845 INFO L392 ElimStorePlain]: Different costs {1=[v_arrayElimArr_1], 2=[v_arrayElimArr_2]} [2019-11-15 22:09:33,049 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:33,049 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 22:09:33,054 INFO L168 Benchmark]: Toolchain (without parser) took 102343.03 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 548.4 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -102.2 MB). Peak memory consumption was 446.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:09:33,054 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:09:33,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 467.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:09:33,055 INFO L168 Benchmark]: Boogie Preprocessor took 55.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:09:33,055 INFO L168 Benchmark]: RCFGBuilder took 702.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:09:33,055 INFO L168 Benchmark]: TraceAbstraction took 101114.62 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 403.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 20.3 MB). Peak memory consumption was 424.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:09:33,056 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 467.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 702.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 101114.62 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 403.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 20.3 MB). Peak memory consumption was 424.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 22:09:35,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:09:35,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:09:35,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:09:35,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:09:35,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:09:35,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:09:35,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:09:35,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:09:35,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:09:35,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:09:35,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:09:35,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:09:35,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:09:35,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:09:35,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:09:35,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:09:35,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:09:35,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:09:35,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:09:35,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:09:35,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:09:35,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:09:35,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:09:35,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:09:35,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:09:35,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:09:35,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:09:35,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:09:35,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:09:35,211 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:09:35,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:09:35,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:09:35,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:09:35,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:09:35,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:09:35,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:09:35,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:09:35,215 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:09:35,216 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:09:35,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:09:35,217 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 22:09:35,231 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:09:35,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:09:35,232 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:09:35,232 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:09:35,232 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:09:35,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:09:35,233 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:09:35,233 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:09:35,233 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:09:35,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:09:35,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:09:35,234 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:09:35,234 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:09:35,235 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 22:09:35,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:09:35,235 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:09:35,235 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:09:35,236 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:09:35,236 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:09:35,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:09:35,236 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:09:35,236 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:09:35,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:09:35,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:09:35,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:09:35,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:09:35,238 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:09:35,238 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:09:35,238 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:09:35,238 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c86c31ba65e8769cfdcc728bfa7fc9963ff0709c [2019-11-15 22:09:35,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:09:35,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:09:35,282 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:09:35,290 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:09:35,291 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:09:35,291 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/../../sv-benchmarks/c/list-properties/alternating_list-1.i [2019-11-15 22:09:35,349 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/data/ea66e14f5/6c5d18ce0ba943d8a32724a9c6d2026b/FLAGc9003f63f [2019-11-15 22:09:35,840 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:09:35,841 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/sv-benchmarks/c/list-properties/alternating_list-1.i [2019-11-15 22:09:35,857 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/data/ea66e14f5/6c5d18ce0ba943d8a32724a9c6d2026b/FLAGc9003f63f [2019-11-15 22:09:36,213 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/data/ea66e14f5/6c5d18ce0ba943d8a32724a9c6d2026b [2019-11-15 22:09:36,215 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:09:36,216 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:09:36,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:09:36,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:09:36,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:09:36,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:09:36" (1/1) ... [2019-11-15 22:09:36,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41017f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:36, skipping insertion in model container [2019-11-15 22:09:36,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:09:36" (1/1) ... [2019-11-15 22:09:36,230 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:09:36,282 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:09:36,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:09:36,681 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:09:36,770 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:09:36,831 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:09:36,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:36 WrapperNode [2019-11-15 22:09:36,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:09:36,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:09:36,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:09:36,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:09:36,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:36" (1/1) ... [2019-11-15 22:09:36,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:36" (1/1) ... [2019-11-15 22:09:36,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:36" (1/1) ... [2019-11-15 22:09:36,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:36" (1/1) ... [2019-11-15 22:09:36,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:36" (1/1) ... [2019-11-15 22:09:36,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:36" (1/1) ... [2019-11-15 22:09:36,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:36" (1/1) ... [2019-11-15 22:09:36,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:09:36,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:09:36,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:09:36,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:09:36,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/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 [2019-11-15 22:09:36,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:09:36,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:09:36,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 22:09:36,955 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 22:09:36,955 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-15 22:09:36,955 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-15 22:09:36,955 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-15 22:09:36,955 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 22:09:36,956 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:09:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 22:09:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 22:09:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:09:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:09:36,957 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:09:36,957 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:09:36,957 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:09:36,957 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:09:36,957 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:09:36,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:09:36,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:09:36,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:09:36,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:09:36,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:09:36,959 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:09:36,959 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:09:36,959 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:09:36,959 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:09:36,959 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 22:09:36,960 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 22:09:36,960 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-15 22:09:36,960 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-15 22:09:36,960 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-15 22:09:36,960 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:09:36,961 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:09:36,961 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:09:36,961 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:09:36,961 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:09:36,961 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:09:36,961 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:09:36,961 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:09:36,961 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:09:36,961 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:09:36,962 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:09:36,962 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:09:36,962 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:09:36,962 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:09:36,962 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:09:36,962 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:09:36,963 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:09:36,963 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:09:36,963 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:09:36,963 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:09:36,963 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:09:36,964 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:09:36,964 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:09:36,964 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:09:36,964 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:09:36,964 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:09:36,964 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:09:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:09:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:09:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:09:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:09:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:09:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:09:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:09:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:09:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:09:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:09:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:09:36,967 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:09:36,967 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:09:36,967 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:09:36,967 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:09:36,967 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:09:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:09:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:09:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:09:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:09:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:09:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:09:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:09:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:09:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:09:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:09:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:09:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:09:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:09:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:09:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:09:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:09:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:09:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:09:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:09:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:09:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:09:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:09:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:09:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:09:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:09:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:09:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:09:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:09:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:09:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:09:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:09:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:09:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:09:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:09:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:09:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:09:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:09:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:09:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:09:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:09:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:09:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:09:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:09:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 22:09:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:09:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:09:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 22:09:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:09:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:09:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 22:09:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:09:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:09:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:09:37,303 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 22:09:37,693 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:09:37,693 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-15 22:09:37,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:09:37 BoogieIcfgContainer [2019-11-15 22:09:37,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:09:37,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:09:37,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:09:37,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:09:37,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:09:36" (1/3) ... [2019-11-15 22:09:37,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c8c48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:09:37, skipping insertion in model container [2019-11-15 22:09:37,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:36" (2/3) ... [2019-11-15 22:09:37,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c8c48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:09:37, skipping insertion in model container [2019-11-15 22:09:37,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:09:37" (3/3) ... [2019-11-15 22:09:37,702 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-1.i [2019-11-15 22:09:37,711 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:09:37,731 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-11-15 22:09:37,742 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-11-15 22:09:37,762 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:09:37,762 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:09:37,762 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:09:37,763 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:09:37,763 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:09:37,763 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:09:37,763 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:09:37,764 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:09:37,783 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2019-11-15 22:09:37,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:09:37,792 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:37,793 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:37,797 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr5REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-15 22:09:37,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:37,803 INFO L82 PathProgramCache]: Analyzing trace with hash -655644872, now seen corresponding path program 1 times [2019-11-15 22:09:37,814 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:09:37,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1332887528] [2019-11-15 22:09:37,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab33fb96-3f38-459d-90d4-2b9293d29aac/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:09:38,043 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:09:38,043 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 22:09:38,049 INFO L168 Benchmark]: Toolchain (without parser) took 1832.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 942.9 MB in the beginning and 1.0 GB in the end (delta: -87.1 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:09:38,050 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:09:38,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 615.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:09:38,051 INFO L168 Benchmark]: Boogie Preprocessor took 67.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:09:38,053 INFO L168 Benchmark]: RCFGBuilder took 794.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:09:38,054 INFO L168 Benchmark]: TraceAbstraction took 351.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:09:38,064 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 615.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 794.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 351.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort C_DOUBLE not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...