./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0232-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/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 9ee3a23cf8ca0f6d04d9d74ad314377c3dff5fab .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/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 9ee3a23cf8ca0f6d04d9d74ad314377c3dff5fab ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:07:42,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:07:42,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:07:42,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:07:42,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:07:42,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:07:42,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:07:42,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:07:42,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:07:42,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:07:42,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:07:42,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:07:42,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:07:42,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:07:42,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:07:42,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:07:42,110 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:07:42,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:07:42,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:07:42,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:07:42,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:07:42,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:07:42,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:07:42,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:07:42,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:07:42,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:07:42,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:07:42,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:07:42,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:07:42,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:07:42,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:07:42,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:07:42,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:07:42,121 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:07:42,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:07:42,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:07:42,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:07:42,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:07:42,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:07:42,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:07:42,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:07:42,124 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 11:07:42,133 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:07:42,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:07:42,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:07:42,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:07:42,134 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:07:42,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:07:42,135 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:07:42,135 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 11:07:42,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:07:42,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:07:42,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:07:42,135 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 11:07:42,135 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 11:07:42,135 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 11:07:42,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:07:42,136 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:07:42,136 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:07:42,136 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:07:42,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:07:42,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:07:42,136 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:07:42,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:07:42,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:07:42,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:07:42,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:07:42,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:07:42,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:07:42,137 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:07:42,137 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_41b8cae6-08d1-4c13-b648-f0c965a02bb6/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 -> 9ee3a23cf8ca0f6d04d9d74ad314377c3dff5fab [2019-12-07 11:07:42,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:07:42,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:07:42,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:07:42,247 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:07:42,247 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:07:42,248 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/../../sv-benchmarks/c/memsafety/test-0232-1.i [2019-12-07 11:07:42,284 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/data/407e556ef/8e35605470494cd79f36a4b1fb39be69/FLAGccf8277c5 [2019-12-07 11:07:42,715 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:07:42,715 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/sv-benchmarks/c/memsafety/test-0232-1.i [2019-12-07 11:07:42,725 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/data/407e556ef/8e35605470494cd79f36a4b1fb39be69/FLAGccf8277c5 [2019-12-07 11:07:42,734 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/data/407e556ef/8e35605470494cd79f36a4b1fb39be69 [2019-12-07 11:07:42,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:07:42,736 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 11:07:42,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:07:42,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:07:42,739 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:07:42,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:07:42" (1/1) ... [2019-12-07 11:07:42,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48ac8ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:42, skipping insertion in model container [2019-12-07 11:07:42,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:07:42" (1/1) ... [2019-12-07 11:07:42,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:07:42,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:07:42,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:07:42,966 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:07:42,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:07:43,027 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:07:43,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:43 WrapperNode [2019-12-07 11:07:43,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:07:43,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:07:43,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:07:43,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:07:43,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:43" (1/1) ... [2019-12-07 11:07:43,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:43" (1/1) ... [2019-12-07 11:07:43,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:43" (1/1) ... [2019-12-07 11:07:43,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:43" (1/1) ... [2019-12-07 11:07:43,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:43" (1/1) ... [2019-12-07 11:07:43,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:43" (1/1) ... [2019-12-07 11:07:43,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:43" (1/1) ... [2019-12-07 11:07:43,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:07:43,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:07:43,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:07:43,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:07:43,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/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-12-07 11:07:43,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 11:07:43,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:07:43,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 11:07:43,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 11:07:43,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 11:07:43,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 11:07:43,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 11:07:43,107 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-12-07 11:07:43,107 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 11:07:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 11:07:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 11:07:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 11:07:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 11:07:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 11:07:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 11:07:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 11:07:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 11:07:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 11:07:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 11:07:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 11:07:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 11:07:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 11:07:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 11:07:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 11:07:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 11:07:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 11:07:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 11:07:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 11:07:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 11:07:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 11:07:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 11:07:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 11:07:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 11:07:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 11:07:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 11:07:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 11:07:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 11:07:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 11:07:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 11:07:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 11:07:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 11:07:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 11:07:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 11:07:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 11:07:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 11:07:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 11:07:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 11:07:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 11:07:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 11:07:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 11:07:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 11:07:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 11:07:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 11:07:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 11:07:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 11:07:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 11:07:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 11:07:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 11:07:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 11:07:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 11:07:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 11:07:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 11:07:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 11:07:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 11:07:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 11:07:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 11:07:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 11:07:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 11:07:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 11:07:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 11:07:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 11:07:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 11:07:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 11:07:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 11:07:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 11:07:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 11:07:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 11:07:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 11:07:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 11:07:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 11:07:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 11:07:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 11:07:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 11:07:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 11:07:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 11:07:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 11:07:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 11:07:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 11:07:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 11:07:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 11:07:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 11:07:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 11:07:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 11:07:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 11:07:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 11:07:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 11:07:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 11:07:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 11:07:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 11:07:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 11:07:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 11:07:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 11:07:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 11:07:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 11:07:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 11:07:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 11:07:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 11:07:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 11:07:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 11:07:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 11:07:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 11:07:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 11:07:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 11:07:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 11:07:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 11:07:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 11:07:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 11:07:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 11:07:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-12-07 11:07:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:07:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 11:07:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 11:07:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 11:07:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:07:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 11:07:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:07:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 11:07:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:07:43,430 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:07:43,430 INFO L287 CfgBuilder]: Removed 2 assume(true) statements. [2019-12-07 11:07:43,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:07:43 BoogieIcfgContainer [2019-12-07 11:07:43,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:07:43,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:07:43,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:07:43,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:07:43,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:07:42" (1/3) ... [2019-12-07 11:07:43,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc7b0d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:07:43, skipping insertion in model container [2019-12-07 11:07:43,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:43" (2/3) ... [2019-12-07 11:07:43,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc7b0d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:07:43, skipping insertion in model container [2019-12-07 11:07:43,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:07:43" (3/3) ... [2019-12-07 11:07:43,435 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2019-12-07 11:07:43,441 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:07:43,446 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2019-12-07 11:07:43,454 INFO L249 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2019-12-07 11:07:43,466 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:07:43,466 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 11:07:43,466 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:07:43,466 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:07:43,467 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:07:43,467 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:07:43,467 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:07:43,467 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:07:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-12-07 11:07:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 11:07:43,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:43,485 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:43,485 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:43,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:43,489 INFO L82 PathProgramCache]: Analyzing trace with hash -712556726, now seen corresponding path program 1 times [2019-12-07 11:07:43,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:43,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523373111] [2019-12-07 11:07:43,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:43,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523373111] [2019-12-07 11:07:43,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:43,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:07:43,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179204826] [2019-12-07 11:07:43,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:43,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:43,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:43,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:43,619 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2019-12-07 11:07:43,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:43,742 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2019-12-07 11:07:43,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:43,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 11:07:43,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:43,750 INFO L225 Difference]: With dead ends: 89 [2019-12-07 11:07:43,750 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 11:07:43,751 INFO L630 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-12-07 11:07:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 11:07:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-12-07 11:07:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 11:07:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2019-12-07 11:07:43,777 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 8 [2019-12-07 11:07:43,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:43,777 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2019-12-07 11:07:43,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2019-12-07 11:07:43,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:07:43,778 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:43,778 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:43,778 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:43,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:43,778 INFO L82 PathProgramCache]: Analyzing trace with hash -614318855, now seen corresponding path program 1 times [2019-12-07 11:07:43,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:43,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519507248] [2019-12-07 11:07:43,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:43,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519507248] [2019-12-07 11:07:43,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:43,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:07:43,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408254631] [2019-12-07 11:07:43,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:07:43,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:43,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:07:43,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:07:43,841 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 6 states. [2019-12-07 11:07:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:44,002 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2019-12-07 11:07:44,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:07:44,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 11:07:44,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:44,004 INFO L225 Difference]: With dead ends: 78 [2019-12-07 11:07:44,004 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 11:07:44,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:07:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 11:07:44,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-12-07 11:07:44,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 11:07:44,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-12-07 11:07:44,010 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 9 [2019-12-07 11:07:44,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:44,010 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-12-07 11:07:44,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:07:44,010 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-12-07 11:07:44,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:07:44,010 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:44,011 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:44,011 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:44,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:44,011 INFO L82 PathProgramCache]: Analyzing trace with hash -614318854, now seen corresponding path program 1 times [2019-12-07 11:07:44,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:44,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955237712] [2019-12-07 11:07:44,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:44,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955237712] [2019-12-07 11:07:44,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:44,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:07:44,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361499774] [2019-12-07 11:07:44,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:07:44,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:44,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:07:44,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:07:44,076 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 6 states. [2019-12-07 11:07:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:44,277 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2019-12-07 11:07:44,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:07:44,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 11:07:44,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:44,279 INFO L225 Difference]: With dead ends: 96 [2019-12-07 11:07:44,279 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 11:07:44,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:07:44,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 11:07:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2019-12-07 11:07:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 11:07:44,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2019-12-07 11:07:44,286 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 9 [2019-12-07 11:07:44,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:44,287 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2019-12-07 11:07:44,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:07:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2019-12-07 11:07:44,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:07:44,287 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:44,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:44,287 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:44,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:44,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1864015253, now seen corresponding path program 1 times [2019-12-07 11:07:44,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:44,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137708786] [2019-12-07 11:07:44,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:44,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:44,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137708786] [2019-12-07 11:07:44,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:44,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:07:44,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110083075] [2019-12-07 11:07:44,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:07:44,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:44,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:07:44,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:07:44,320 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 4 states. [2019-12-07 11:07:44,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:44,405 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2019-12-07 11:07:44,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:07:44,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 11:07:44,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:44,406 INFO L225 Difference]: With dead ends: 79 [2019-12-07 11:07:44,406 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 11:07:44,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12-07 11:07:44,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 11:07:44,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-12-07 11:07:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 11:07:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2019-12-07 11:07:44,411 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 10 [2019-12-07 11:07:44,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:44,411 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2019-12-07 11:07:44,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:07:44,412 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2019-12-07 11:07:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:07:44,412 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:44,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:44,412 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:44,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:44,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1864015252, now seen corresponding path program 1 times [2019-12-07 11:07:44,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:44,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181931518] [2019-12-07 11:07:44,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:44,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:44,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181931518] [2019-12-07 11:07:44,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:44,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:07:44,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135525983] [2019-12-07 11:07:44,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:07:44,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:44,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:07:44,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:07:44,446 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 4 states. [2019-12-07 11:07:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:44,531 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2019-12-07 11:07:44,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:07:44,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 11:07:44,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:44,532 INFO L225 Difference]: With dead ends: 75 [2019-12-07 11:07:44,533 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 11:07:44,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12-07 11:07:44,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 11:07:44,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-12-07 11:07:44,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 11:07:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-12-07 11:07:44,537 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 10 [2019-12-07 11:07:44,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:44,537 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-12-07 11:07:44,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:07:44,537 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-12-07 11:07:44,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 11:07:44,537 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:44,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:44,538 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:44,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:44,538 INFO L82 PathProgramCache]: Analyzing trace with hash 734581444, now seen corresponding path program 1 times [2019-12-07 11:07:44,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:44,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452180319] [2019-12-07 11:07:44,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:44,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:44,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452180319] [2019-12-07 11:07:44,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:44,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:07:44,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492896063] [2019-12-07 11:07:44,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:07:44,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:44,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:07:44,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:07:44,620 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 9 states. [2019-12-07 11:07:44,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:44,823 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2019-12-07 11:07:44,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:07:44,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-07 11:07:44,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:44,824 INFO L225 Difference]: With dead ends: 86 [2019-12-07 11:07:44,824 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 11:07:44,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:07:44,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 11:07:44,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2019-12-07 11:07:44,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 11:07:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2019-12-07 11:07:44,830 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 15 [2019-12-07 11:07:44,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:44,830 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2019-12-07 11:07:44,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:07:44,830 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2019-12-07 11:07:44,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:07:44,831 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:44,831 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:44,831 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:44,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:44,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1297466416, now seen corresponding path program 1 times [2019-12-07 11:07:44,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:44,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817464319] [2019-12-07 11:07:44,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:44,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817464319] [2019-12-07 11:07:44,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:44,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:07:44,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679987726] [2019-12-07 11:07:44,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:07:44,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:44,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:07:44,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:07:44,903 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 8 states. [2019-12-07 11:07:45,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:45,029 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2019-12-07 11:07:45,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:07:45,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-12-07 11:07:45,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:45,030 INFO L225 Difference]: With dead ends: 81 [2019-12-07 11:07:45,030 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 11:07:45,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:07:45,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 11:07:45,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2019-12-07 11:07:45,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 11:07:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2019-12-07 11:07:45,037 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 16 [2019-12-07 11:07:45,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:45,037 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2019-12-07 11:07:45,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:07:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2019-12-07 11:07:45,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 11:07:45,038 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:45,038 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:45,038 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:45,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:45,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1101417948, now seen corresponding path program 1 times [2019-12-07 11:07:45,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:45,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101401568] [2019-12-07 11:07:45,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:45,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101401568] [2019-12-07 11:07:45,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:45,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:07:45,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676713365] [2019-12-07 11:07:45,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:07:45,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:45,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:07:45,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:07:45,123 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 9 states. [2019-12-07 11:07:45,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:45,306 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2019-12-07 11:07:45,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:07:45,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-07 11:07:45,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:45,307 INFO L225 Difference]: With dead ends: 86 [2019-12-07 11:07:45,307 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 11:07:45,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:07:45,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 11:07:45,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2019-12-07 11:07:45,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 11:07:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-12-07 11:07:45,311 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 24 [2019-12-07 11:07:45,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:45,312 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-12-07 11:07:45,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:07:45,312 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-12-07 11:07:45,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 11:07:45,313 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:45,313 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:45,313 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:45,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:45,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1101417949, now seen corresponding path program 1 times [2019-12-07 11:07:45,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:45,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721167242] [2019-12-07 11:07:45,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:45,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721167242] [2019-12-07 11:07:45,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:45,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:07:45,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763496639] [2019-12-07 11:07:45,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:07:45,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:45,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:07:45,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:07:45,420 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 9 states. [2019-12-07 11:07:45,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:45,652 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2019-12-07 11:07:45,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:07:45,653 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-07 11:07:45,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:45,653 INFO L225 Difference]: With dead ends: 88 [2019-12-07 11:07:45,653 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 11:07:45,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:07:45,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 11:07:45,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2019-12-07 11:07:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 11:07:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2019-12-07 11:07:45,657 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 24 [2019-12-07 11:07:45,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:45,658 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2019-12-07 11:07:45,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:07:45,658 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2019-12-07 11:07:45,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:07:45,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:45,658 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:45,659 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:45,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:45,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1920859604, now seen corresponding path program 1 times [2019-12-07 11:07:45,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:45,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043747643] [2019-12-07 11:07:45,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:45,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043747643] [2019-12-07 11:07:45,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:45,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:07:45,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682956623] [2019-12-07 11:07:45,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:07:45,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:45,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:07:45,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:07:45,723 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 8 states. [2019-12-07 11:07:45,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:45,904 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-12-07 11:07:45,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:07:45,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-12-07 11:07:45,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:45,905 INFO L225 Difference]: With dead ends: 70 [2019-12-07 11:07:45,905 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 11:07:45,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:07:45,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 11:07:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-12-07 11:07:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 11:07:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-12-07 11:07:45,909 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 26 [2019-12-07 11:07:45,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:45,909 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-12-07 11:07:45,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:07:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-12-07 11:07:45,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:07:45,910 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:45,910 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:45,910 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:45,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:45,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1208047573, now seen corresponding path program 1 times [2019-12-07 11:07:45,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:45,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901385455] [2019-12-07 11:07:45,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:45,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:45,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901385455] [2019-12-07 11:07:45,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:45,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:07:45,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288859057] [2019-12-07 11:07:45,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:07:45,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:45,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:07:45,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:07:45,981 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 8 states. [2019-12-07 11:07:46,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:46,124 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-12-07 11:07:46,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:07:46,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-07 11:07:46,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:46,124 INFO L225 Difference]: With dead ends: 69 [2019-12-07 11:07:46,124 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 11:07:46,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:07:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 11:07:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-12-07 11:07:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 11:07:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-12-07 11:07:46,127 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 27 [2019-12-07 11:07:46,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:46,127 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-12-07 11:07:46,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:07:46,127 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-12-07 11:07:46,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:07:46,128 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:46,128 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:46,128 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:46,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:46,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1205230973, now seen corresponding path program 1 times [2019-12-07 11:07:46,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:46,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308924727] [2019-12-07 11:07:46,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:46,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308924727] [2019-12-07 11:07:46,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:46,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:07:46,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124436627] [2019-12-07 11:07:46,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:07:46,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:46,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:07:46,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:07:46,202 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 8 states. [2019-12-07 11:07:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:46,360 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-12-07 11:07:46,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:07:46,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-12-07 11:07:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:46,361 INFO L225 Difference]: With dead ends: 68 [2019-12-07 11:07:46,361 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 11:07:46,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:07:46,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 11:07:46,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-12-07 11:07:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 11:07:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-12-07 11:07:46,364 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 28 [2019-12-07 11:07:46,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:46,364 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-12-07 11:07:46,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:07:46,364 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-12-07 11:07:46,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:07:46,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:46,365 INFO L410 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] [2019-12-07 11:07:46,365 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:46,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:46,365 INFO L82 PathProgramCache]: Analyzing trace with hash 584753878, now seen corresponding path program 1 times [2019-12-07 11:07:46,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:46,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601065212] [2019-12-07 11:07:46,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:46,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:46,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601065212] [2019-12-07 11:07:46,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859480698] [2019-12-07 11:07:46,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/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-12-07 11:07:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:46,558 INFO L264 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 11:07:46,564 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:07:46,626 INFO L377 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-12-07 11:07:46,627 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:46,632 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:46,632 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:07:46,632 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-12-07 11:07:46,677 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:46,677 INFO L377 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 21 treesize of output 59 [2019-12-07 11:07:46,678 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:46,692 INFO L614 ElimStorePlain]: treesize reduction 26, result has 50.0 percent of original size [2019-12-07 11:07:46,692 INFO L534 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-12-07 11:07:46,692 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:26 [2019-12-07 11:07:46,750 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 11:07:46,750 INFO L377 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 24 [2019-12-07 11:07:46,751 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:46,756 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:46,757 INFO L534 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-12-07 11:07:46,757 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2019-12-07 11:07:46,800 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:46,801 INFO L377 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 36 treesize of output 28 [2019-12-07 11:07:46,801 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:46,805 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:46,805 INFO L534 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-12-07 11:07:46,806 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:15 [2019-12-07 11:07:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:46,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:07:46,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-07 11:07:46,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764239313] [2019-12-07 11:07:46,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 11:07:46,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:46,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 11:07:46,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:07:46,828 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 19 states. [2019-12-07 11:07:47,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:47,398 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2019-12-07 11:07:47,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 11:07:47,399 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2019-12-07 11:07:47,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:47,400 INFO L225 Difference]: With dead ends: 74 [2019-12-07 11:07:47,400 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 11:07:47,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2019-12-07 11:07:47,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 11:07:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-12-07 11:07:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 11:07:47,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-12-07 11:07:47,404 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 29 [2019-12-07 11:07:47,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:47,404 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-12-07 11:07:47,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 11:07:47,404 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-12-07 11:07:47,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:07:47,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:47,405 INFO L410 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] [2019-12-07 11:07:47,606 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:07:47,606 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:47,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:47,606 INFO L82 PathProgramCache]: Analyzing trace with hash 584753879, now seen corresponding path program 1 times [2019-12-07 11:07:47,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:47,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900742706] [2019-12-07 11:07:47,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:47,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900742706] [2019-12-07 11:07:47,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495938455] [2019-12-07 11:07:47,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/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-12-07 11:07:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:47,821 INFO L264 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 54 conjunts are in the unsatisfiable core [2019-12-07 11:07:47,824 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:07:47,867 INFO L377 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-12-07 11:07:47,867 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:47,872 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:47,874 INFO L377 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-12-07 11:07:47,874 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:47,880 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:47,880 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:07:47,880 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2019-12-07 11:07:47,944 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:47,945 INFO L377 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-12-07 11:07:47,945 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:47,951 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:47,954 INFO L377 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 16 treesize of output 18 [2019-12-07 11:07:47,954 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:47,960 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:47,961 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:07:47,961 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2019-12-07 11:07:48,024 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 11:07:48,024 INFO L377 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 23 treesize of output 18 [2019-12-07 11:07:48,025 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:48,034 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:48,044 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 11:07:48,044 INFO L377 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 24 [2019-12-07 11:07:48,045 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:48,052 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:48,052 INFO L534 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-12-07 11:07:48,053 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2019-12-07 11:07:48,096 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:48,097 INFO L377 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 36 treesize of output 28 [2019-12-07 11:07:48,097 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:48,104 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:48,109 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:48,109 INFO L377 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 1 case distinctions, treesize of input 26 treesize of output 22 [2019-12-07 11:07:48,109 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:48,114 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:48,115 INFO L534 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-12-07 11:07:48,115 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2019-12-07 11:07:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:48,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:07:48,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-12-07 11:07:48,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405472004] [2019-12-07 11:07:48,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 11:07:48,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:48,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 11:07:48,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-12-07 11:07:48,139 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 21 states. [2019-12-07 11:07:48,739 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-07 11:07:48,937 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-12-07 11:07:49,075 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-12-07 11:07:49,335 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-12-07 11:07:49,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:49,571 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2019-12-07 11:07:49,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 11:07:49,571 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-12-07 11:07:49,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:49,572 INFO L225 Difference]: With dead ends: 73 [2019-12-07 11:07:49,572 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 11:07:49,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2019-12-07 11:07:49,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 11:07:49,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-12-07 11:07:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 11:07:49,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-12-07 11:07:49,574 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 29 [2019-12-07 11:07:49,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:49,574 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-12-07 11:07:49,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 11:07:49,574 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-12-07 11:07:49,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:07:49,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:49,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:49,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:07:49,776 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:49,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:49,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1292545427, now seen corresponding path program 1 times [2019-12-07 11:07:49,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:49,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351581064] [2019-12-07 11:07:49,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:49,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351581064] [2019-12-07 11:07:49,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:49,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:07:49,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501161215] [2019-12-07 11:07:49,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:07:49,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:49,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:07:49,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:07:49,867 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 9 states. [2019-12-07 11:07:50,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:50,026 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-12-07 11:07:50,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:07:50,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-12-07 11:07:50,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:50,027 INFO L225 Difference]: With dead ends: 70 [2019-12-07 11:07:50,027 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 11:07:50,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:07:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 11:07:50,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-12-07 11:07:50,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 11:07:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-12-07 11:07:50,030 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 29 [2019-12-07 11:07:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:50,030 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-12-07 11:07:50,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:07:50,030 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-12-07 11:07:50,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 11:07:50,031 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:50,031 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:50,031 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:50,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:50,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1414202496, now seen corresponding path program 1 times [2019-12-07 11:07:50,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:50,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117129718] [2019-12-07 11:07:50,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:50,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:50,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117129718] [2019-12-07 11:07:50,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:50,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:07:50,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69137793] [2019-12-07 11:07:50,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:07:50,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:50,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:07:50,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:07:50,113 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 9 states. [2019-12-07 11:07:50,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:50,275 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-12-07 11:07:50,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:07:50,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-12-07 11:07:50,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:50,276 INFO L225 Difference]: With dead ends: 69 [2019-12-07 11:07:50,276 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 11:07:50,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:07:50,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 11:07:50,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-12-07 11:07:50,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 11:07:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-12-07 11:07:50,279 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 30 [2019-12-07 11:07:50,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:50,279 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-12-07 11:07:50,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:07:50,279 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-12-07 11:07:50,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 11:07:50,280 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:50,281 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:50,281 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:50,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:50,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1414202495, now seen corresponding path program 1 times [2019-12-07 11:07:50,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:50,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294262935] [2019-12-07 11:07:50,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:50,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294262935] [2019-12-07 11:07:50,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:50,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:07:50,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424620333] [2019-12-07 11:07:50,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:07:50,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:50,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:07:50,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:07:50,326 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 5 states. [2019-12-07 11:07:50,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:50,405 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-12-07 11:07:50,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:07:50,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 11:07:50,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:50,406 INFO L225 Difference]: With dead ends: 64 [2019-12-07 11:07:50,406 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 11:07:50,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-12-07 11:07:50,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 11:07:50,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-12-07 11:07:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 11:07:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-12-07 11:07:50,408 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 30 [2019-12-07 11:07:50,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:50,408 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-12-07 11:07:50,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:07:50,409 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-12-07 11:07:50,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:07:50,409 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:50,409 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:50,410 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:50,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:50,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1982425082, now seen corresponding path program 1 times [2019-12-07 11:07:50,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:50,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108711798] [2019-12-07 11:07:50,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:07:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:07:50,461 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:07:50,462 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:07:50,475 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-12-07 11:07:50,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:07:50 BoogieIcfgContainer [2019-12-07 11:07:50,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:07:50,489 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:07:50,489 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:07:50,489 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:07:50,489 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:07:43" (3/4) ... [2019-12-07 11:07:50,492 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 11:07:50,492 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:07:50,493 INFO L168 Benchmark]: Toolchain (without parser) took 7756.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 934.0 MB in the beginning and 980.5 MB in the end (delta: -46.4 MB). Peak memory consumption was 136.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:07:50,494 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:07:50,494 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -148.4 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:07:50,494 INFO L168 Benchmark]: Boogie Preprocessor took 38.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:07:50,495 INFO L168 Benchmark]: RCFGBuilder took 364.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:07:50,495 INFO L168 Benchmark]: TraceAbstraction took 7057.18 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.0 GB in the beginning and 980.5 MB in the end (delta: 41.1 MB). Peak memory consumption was 125.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:07:50,495 INFO L168 Benchmark]: Witness Printer took 3.55 ms. Allocated memory is still 1.2 GB. Free memory is still 980.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:07:50,497 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 290.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -148.4 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 364.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7057.18 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.0 GB in the beginning and 980.5 MB in the end (delta: 41.1 MB). Peak memory consumption was 125.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.55 ms. Allocated memory is still 1.2 GB. Free memory is still 980.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 526]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 526. Possible FailurePath: [L528] struct item *list = ((void *)0); VAL [list={2:0}] [L530] CALL append(&list) VAL [plist={2:0}] [L519] struct item *item = malloc(sizeof *item); VAL [item={-3:0}, malloc(sizeof *item)={-3:0}, plist={2:0}, plist={2:0}] [L520] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={-3:0}, malloc(sizeof *item)={-3:0}, plist={2:0}, plist={2:0}] [L520] item->next = *plist VAL [\read(**plist)={0:0}, item={-3:0}, malloc(sizeof *item)={-3:0}, plist={2:0}, plist={2:0}] [L521] EXPR item->next VAL [item={-3:0}, item->next={0:0}, malloc(sizeof *item)={-3:0}, plist={2:0}, plist={2:0}] [L521-L523] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L521-L523] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, item={-3:0}, item->next={0:0}, malloc(sizeof *item)={-1:0}, malloc(sizeof *item)={-3:0}, plist={2:0}, plist={2:0}] [L521-L523] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, item={-3:0}, item->next={0:0}, malloc(sizeof *item)={-1:0}, malloc(sizeof *item)={-3:0}, plist={2:0}, plist={2:0}] [L524] *plist = item VAL [item={-3:0}, malloc(sizeof *item)={-1:0}, malloc(sizeof *item)={-3:0}, plist={2:0}, plist={2:0}] [L530] RET append(&list) VAL [list={2:0}] [L531] COND FALSE !(__VERIFIER_nondet_int()) [L532] \read(*list) VAL [\read(*list)={-3:0}, list={2:0}] [L532] COND TRUE \read(*list) [L533] EXPR \read(*list) VAL [\read(*list)={-3:0}, list={2:0}] [L533] EXPR list->next VAL [\read(*list)={-3:0}, list={2:0}, list->next={0:0}] [L533] struct item *next = list->next; [L534] EXPR \read(*list) VAL [\read(*list)={-3:0}, list={2:0}, next={0:0}] [L534] free(list) VAL [\read(*list)={-3:0}, list={2:0}, next={0:0}] [L534] free(list) VAL [\read(*list)={-3:0}, list={2:0}, next={0:0}] [L534] free(list) [L535] list = next VAL [list={2:0}, next={0:0}] [L537] \read(*list) VAL [\read(*list)={0:0}, list={2:0}, next={0:0}] [L537] COND FALSE !(\read(*list)) [L542] return 0; [L528] struct item *list = ((void *)0); [L542] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 104 locations, 41 error locations. Result: UNSAFE, OverallTime: 6.9s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 787 SDtfs, 743 SDslu, 2274 SDs, 0 SdLazy, 3936 SolverSat, 180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 263 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 45 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 392 ConstructedInterpolants, 13 QuantifiedInterpolants, 89899 SizeOfPredicates, 35 NumberOfNonLiveVariables, 376 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 6/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 11:07:51,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:07:51,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:07:51,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:07:51,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:07:51,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:07:51,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:07:51,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:07:51,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:07:51,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:07:51,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:07:51,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:07:51,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:07:51,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:07:51,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:07:51,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:07:51,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:07:51,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:07:51,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:07:51,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:07:51,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:07:51,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:07:51,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:07:51,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:07:51,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:07:51,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:07:51,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:07:51,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:07:51,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:07:51,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:07:51,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:07:51,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:07:51,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:07:51,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:07:51,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:07:51,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:07:51,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:07:51,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:07:51,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:07:51,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:07:51,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:07:51,884 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-12-07 11:07:51,894 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:07:51,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:07:51,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:07:51,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:07:51,895 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:07:51,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:07:51,895 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:07:51,896 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 11:07:51,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:07:51,896 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:07:51,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:07:51,896 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 11:07:51,896 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 11:07:51,896 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 11:07:51,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:07:51,897 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:07:51,897 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 11:07:51,897 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 11:07:51,897 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:07:51,897 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:07:51,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:07:51,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:07:51,897 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:07:51,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:07:51,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:07:51,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:07:51,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:07:51,898 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 11:07:51,898 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 11:07:51,898 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:07:51,898 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:07:51,899 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_41b8cae6-08d1-4c13-b648-f0c965a02bb6/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 -> 9ee3a23cf8ca0f6d04d9d74ad314377c3dff5fab [2019-12-07 11:07:52,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:07:52,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:07:52,074 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:07:52,075 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:07:52,075 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:07:52,076 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/../../sv-benchmarks/c/memsafety/test-0232-1.i [2019-12-07 11:07:52,121 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/data/70ca43cf5/6a317b6ae94e4329b4f8e8c47a58f5f9/FLAG3e6c86b8d [2019-12-07 11:07:52,554 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:07:52,554 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/sv-benchmarks/c/memsafety/test-0232-1.i [2019-12-07 11:07:52,564 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/data/70ca43cf5/6a317b6ae94e4329b4f8e8c47a58f5f9/FLAG3e6c86b8d [2019-12-07 11:07:52,897 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/data/70ca43cf5/6a317b6ae94e4329b4f8e8c47a58f5f9 [2019-12-07 11:07:52,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:07:52,903 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 11:07:52,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:07:52,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:07:52,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:07:52,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:07:52" (1/1) ... [2019-12-07 11:07:52,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19ea2d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:52, skipping insertion in model container [2019-12-07 11:07:52,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:07:52" (1/1) ... [2019-12-07 11:07:52,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:07:52,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:07:53,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:07:53,150 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:07:53,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:07:53,213 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:07:53,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:53 WrapperNode [2019-12-07 11:07:53,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:07:53,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:07:53,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:07:53,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:07:53,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:53" (1/1) ... [2019-12-07 11:07:53,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:53" (1/1) ... [2019-12-07 11:07:53,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:53" (1/1) ... [2019-12-07 11:07:53,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:53" (1/1) ... [2019-12-07 11:07:53,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:53" (1/1) ... [2019-12-07 11:07:53,249 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:53" (1/1) ... [2019-12-07 11:07:53,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:53" (1/1) ... [2019-12-07 11:07:53,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:07:53,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:07:53,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:07:53,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:07:53,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/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-12-07 11:07:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 11:07:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:07:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 11:07:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 11:07:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 11:07:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 11:07:53,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 11:07:53,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 11:07:53,297 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-12-07 11:07:53,297 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 11:07:53,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 11:07:53,297 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 11:07:53,297 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 11:07:53,297 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 11:07:53,297 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 11:07:53,297 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 11:07:53,297 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 11:07:53,297 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 11:07:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 11:07:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 11:07:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 11:07:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 11:07:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 11:07:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 11:07:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 11:07:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 11:07:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 11:07:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 11:07:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 11:07:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 11:07:53,299 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 11:07:53,299 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 11:07:53,299 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 11:07:53,299 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 11:07:53,299 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 11:07:53,299 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 11:07:53,299 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 11:07:53,299 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 11:07:53,299 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 11:07:53,299 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 11:07:53,299 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 11:07:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 11:07:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 11:07:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 11:07:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 11:07:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 11:07:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 11:07:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 11:07:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 11:07:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 11:07:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 11:07:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 11:07:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 11:07:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 11:07:53,301 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 11:07:53,301 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 11:07:53,301 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 11:07:53,301 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 11:07:53,301 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 11:07:53,301 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 11:07:53,301 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 11:07:53,301 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 11:07:53,301 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 11:07:53,301 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 11:07:53,301 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 11:07:53,301 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 11:07:53,302 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 11:07:53,302 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 11:07:53,302 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 11:07:53,302 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 11:07:53,302 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 11:07:53,302 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 11:07:53,302 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 11:07:53,302 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 11:07:53,302 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 11:07:53,302 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 11:07:53,302 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 11:07:53,302 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 11:07:53,302 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 11:07:53,302 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 11:07:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 11:07:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 11:07:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 11:07:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 11:07:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 11:07:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 11:07:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 11:07:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 11:07:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 11:07:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 11:07:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 11:07:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 11:07:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 11:07:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 11:07:53,304 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 11:07:53,304 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 11:07:53,304 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 11:07:53,304 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 11:07:53,304 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 11:07:53,304 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 11:07:53,304 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 11:07:53,304 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 11:07:53,304 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 11:07:53,304 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 11:07:53,304 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 11:07:53,304 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 11:07:53,305 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 11:07:53,305 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 11:07:53,305 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 11:07:53,305 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 11:07:53,305 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 11:07:53,305 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 11:07:53,305 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 11:07:53,305 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 11:07:53,305 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 11:07:53,305 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 11:07:53,305 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 11:07:53,306 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 11:07:53,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 11:07:53,306 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-12-07 11:07:53,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:07:53,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 11:07:53,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 11:07:53,306 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 11:07:53,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:07:53,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 11:07:53,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:07:53,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 11:07:53,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:07:53,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 11:07:53,713 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:07:53,713 INFO L287 CfgBuilder]: Removed 2 assume(true) statements. [2019-12-07 11:07:53,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:07:53 BoogieIcfgContainer [2019-12-07 11:07:53,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:07:53,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:07:53,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:07:53,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:07:53,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:07:52" (1/3) ... [2019-12-07 11:07:53,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35fe6ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:07:53, skipping insertion in model container [2019-12-07 11:07:53,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:07:53" (2/3) ... [2019-12-07 11:07:53,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35fe6ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:07:53, skipping insertion in model container [2019-12-07 11:07:53,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:07:53" (3/3) ... [2019-12-07 11:07:53,719 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2019-12-07 11:07:53,725 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:07:53,730 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2019-12-07 11:07:53,738 INFO L249 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2019-12-07 11:07:53,750 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:07:53,751 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 11:07:53,751 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:07:53,751 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:07:53,751 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:07:53,751 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:07:53,751 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:07:53,751 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:07:53,763 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-12-07 11:07:53,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 11:07:53,769 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:53,770 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:53,770 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:53,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:53,774 INFO L82 PathProgramCache]: Analyzing trace with hash 226849131, now seen corresponding path program 1 times [2019-12-07 11:07:53,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:07:53,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888894593] [2019-12-07 11:07:53,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 11:07:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:53,867 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 11:07:53,871 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:07:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:53,884 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:07:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:53,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888894593] [2019-12-07 11:07:53,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:53,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 11:07:53,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566980820] [2019-12-07 11:07:53,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 11:07:53,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:07:53,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 11:07:53,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 11:07:53,917 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 2 states. [2019-12-07 11:07:53,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:53,931 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-12-07 11:07:53,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 11:07:53,932 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-12-07 11:07:53,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:53,939 INFO L225 Difference]: With dead ends: 88 [2019-12-07 11:07:53,939 INFO L226 Difference]: Without dead ends: 85 [2019-12-07 11:07:53,940 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 11:07:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-07 11:07:53,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-12-07 11:07:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 11:07:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2019-12-07 11:07:53,975 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 8 [2019-12-07 11:07:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:53,975 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2019-12-07 11:07:53,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 11:07:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2019-12-07 11:07:53,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:07:53,976 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:53,976 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:54,177 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 11:07:54,177 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:54,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:54,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1557508339, now seen corresponding path program 1 times [2019-12-07 11:07:54,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:07:54,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71687826] [2019-12-07 11:07:54,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 11:07:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:54,278 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 11:07:54,280 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:07:54,314 INFO L377 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-12-07 11:07:54,314 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:54,317 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:54,318 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:07:54,318 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 11:07:54,352 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:54,353 INFO L377 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 12 treesize of output 28 [2019-12-07 11:07:54,354 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:54,369 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 11:07:54,370 INFO L534 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-12-07 11:07:54,371 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-12-07 11:07:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:54,385 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:07:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:54,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71687826] [2019-12-07 11:07:54,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:54,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 11:07:54,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840188148] [2019-12-07 11:07:54,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:07:54,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:07:54,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:07:54,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:07:54,401 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 5 states. [2019-12-07 11:07:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:54,625 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2019-12-07 11:07:54,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:07:54,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 11:07:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:54,626 INFO L225 Difference]: With dead ends: 77 [2019-12-07 11:07:54,626 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 11:07:54,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:07:54,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 11:07:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-12-07 11:07:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 11:07:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-12-07 11:07:54,633 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 9 [2019-12-07 11:07:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:54,633 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-12-07 11:07:54,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:07:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-12-07 11:07:54,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:07:54,633 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:54,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:54,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 11:07:54,835 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:54,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:54,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1557508338, now seen corresponding path program 1 times [2019-12-07 11:07:54,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:07:54,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846604033] [2019-12-07 11:07:54,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 11:07:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:54,935 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 11:07:54,936 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:07:54,943 INFO L377 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-12-07 11:07:54,944 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:54,950 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:54,953 INFO L377 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-12-07 11:07:54,953 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:54,959 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:54,959 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:07:54,960 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 11:07:54,996 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:54,997 INFO L377 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-12-07 11:07:54,998 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:55,006 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:55,012 INFO L377 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 14 treesize of output 16 [2019-12-07 11:07:55,012 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:55,025 INFO L614 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2019-12-07 11:07:55,025 INFO L534 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-12-07 11:07:55,026 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-12-07 11:07:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:55,041 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:07:55,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:07:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:55,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846604033] [2019-12-07 11:07:55,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:55,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 11:07:55,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969721386] [2019-12-07 11:07:55,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:07:55,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:07:55,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:07:55,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:07:55,243 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 8 states. [2019-12-07 11:07:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:57,827 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2019-12-07 11:07:57,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:07:57,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-12-07 11:07:57,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:57,831 INFO L225 Difference]: With dead ends: 97 [2019-12-07 11:07:57,831 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 11:07:57,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:07:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 11:07:57,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2019-12-07 11:07:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 11:07:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2019-12-07 11:07:57,838 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 9 [2019-12-07 11:07:57,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:57,838 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2019-12-07 11:07:57,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:07:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2019-12-07 11:07:57,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:07:57,838 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:57,838 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:58,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 11:07:58,040 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:58,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:58,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1038118164, now seen corresponding path program 1 times [2019-12-07 11:07:58,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:07:58,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517444119] [2019-12-07 11:07:58,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 11:07:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:58,142 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:07:58,143 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:07:58,146 INFO L377 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-12-07 11:07:58,146 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:58,148 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:58,149 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:07:58,149 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 11:07:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:58,152 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:07:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:58,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517444119] [2019-12-07 11:07:58,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:58,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 11:07:58,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245014501] [2019-12-07 11:07:58,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:58,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:07:58,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:58,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:58,158 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 3 states. [2019-12-07 11:07:58,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:58,241 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2019-12-07 11:07:58,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:58,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 11:07:58,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:58,242 INFO L225 Difference]: With dead ends: 74 [2019-12-07 11:07:58,242 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 11:07:58,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-12-07 11:07:58,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 11:07:58,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-12-07 11:07:58,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 11:07:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2019-12-07 11:07:58,247 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 10 [2019-12-07 11:07:58,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:58,247 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2019-12-07 11:07:58,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:58,247 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2019-12-07 11:07:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:07:58,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:58,247 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:58,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 11:07:58,449 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:58,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:58,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1038118163, now seen corresponding path program 1 times [2019-12-07 11:07:58,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:07:58,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435407264] [2019-12-07 11:07:58,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 11:07:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:58,539 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 11:07:58,540 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:07:58,544 INFO L377 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-12-07 11:07:58,544 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:58,549 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:58,549 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:07:58,549 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 11:07:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:58,555 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:07:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:58,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435407264] [2019-12-07 11:07:58,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:58,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 11:07:58,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993489874] [2019-12-07 11:07:58,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:07:58,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:07:58,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:07:58,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:07:58,590 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 4 states. [2019-12-07 11:07:58,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:58,752 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-12-07 11:07:58,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:58,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 11:07:58,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:58,753 INFO L225 Difference]: With dead ends: 70 [2019-12-07 11:07:58,753 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 11:07:58,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:07:58,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 11:07:58,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-12-07 11:07:58,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 11:07:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2019-12-07 11:07:58,757 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 10 [2019-12-07 11:07:58,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:58,757 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2019-12-07 11:07:58,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:07:58,757 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2019-12-07 11:07:58,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 11:07:58,758 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:58,758 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:58,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 11:07:58,960 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:58,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:58,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1958712760, now seen corresponding path program 1 times [2019-12-07 11:07:58,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:07:58,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127229603] [2019-12-07 11:07:58,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 11:07:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:59,051 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 11:07:59,052 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:07:59,120 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 11:07:59,120 INFO L377 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 23 treesize of output 18 [2019-12-07 11:07:59,121 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:59,132 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:59,149 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 11:07:59,150 INFO L377 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 23 treesize of output 18 [2019-12-07 11:07:59,150 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:59,161 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:59,161 INFO L534 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-12-07 11:07:59,162 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2019-12-07 11:07:59,193 INFO L377 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-12-07 11:07:59,194 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:59,206 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:59,208 INFO L377 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-12-07 11:07:59,208 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:07:59,212 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:07:59,212 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:07:59,212 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-12-07 11:07:59,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:59,224 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:07:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:59,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127229603] [2019-12-07 11:07:59,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:59,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 9 [2019-12-07 11:07:59,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449710684] [2019-12-07 11:07:59,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:07:59,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:07:59,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:07:59,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:07:59,244 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 9 states. [2019-12-07 11:07:59,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:59,736 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-12-07 11:07:59,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:07:59,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-07 11:07:59,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:59,738 INFO L225 Difference]: With dead ends: 82 [2019-12-07 11:07:59,738 INFO L226 Difference]: Without dead ends: 82 [2019-12-07 11:07:59,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:07:59,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-07 11:07:59,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2019-12-07 11:07:59,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 11:07:59,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-12-07 11:07:59,744 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 15 [2019-12-07 11:07:59,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:59,744 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-12-07 11:07:59,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:07:59,744 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-12-07 11:07:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 11:07:59,746 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:59,746 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:59,946 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 11:07:59,947 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:07:59,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:59,948 INFO L82 PathProgramCache]: Analyzing trace with hash -643150850, now seen corresponding path program 1 times [2019-12-07 11:07:59,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:07:59,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400360293] [2019-12-07 11:07:59,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 11:08:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:00,083 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 11:08:00,085 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:08:00,107 INFO L377 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-12-07 11:08:00,107 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:00,113 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:00,113 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:00,113 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 11:08:00,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 11:08:00,131 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:00,133 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:00,133 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:00,133 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:7 [2019-12-07 11:08:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:00,142 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:08:00,210 INFO L377 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 32 treesize of output 28 [2019-12-07 11:08:00,210 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:08:00,227 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:00,228 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:08:00,228 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-12-07 11:08:00,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:08:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:00,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400360293] [2019-12-07 11:08:00,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:00,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2019-12-07 11:08:00,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067165519] [2019-12-07 11:08:00,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:08:00,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:08:00,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:08:00,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:08:00,295 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 8 states. [2019-12-07 11:08:00,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:00,681 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2019-12-07 11:08:00,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:08:00,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-12-07 11:08:00,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:00,683 INFO L225 Difference]: With dead ends: 85 [2019-12-07 11:08:00,683 INFO L226 Difference]: Without dead ends: 85 [2019-12-07 11:08:00,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:08:00,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-07 11:08:00,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2019-12-07 11:08:00,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 11:08:00,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2019-12-07 11:08:00,687 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 23 [2019-12-07 11:08:00,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:00,688 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2019-12-07 11:08:00,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:08:00,689 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2019-12-07 11:08:00,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 11:08:00,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:00,689 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:00,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 11:08:00,891 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:08:00,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:00,891 INFO L82 PathProgramCache]: Analyzing trace with hash -643150849, now seen corresponding path program 1 times [2019-12-07 11:08:00,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:08:00,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675617529] [2019-12-07 11:08:00,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 11:08:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:01,002 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 11:08:01,004 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:08:01,036 INFO L377 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-12-07 11:08:01,036 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:01,048 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:01,052 INFO L377 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-12-07 11:08:01,053 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:01,062 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:01,062 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:01,063 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2019-12-07 11:08:01,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 11:08:01,100 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:01,108 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:01,111 INFO L377 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-12-07 11:08:01,111 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:01,116 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:01,117 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:01,117 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2019-12-07 11:08:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:01,140 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:08:01,478 INFO L377 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 36 treesize of output 28 [2019-12-07 11:08:01,481 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 11:08:01,503 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:01,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:08:01,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:08:01,507 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:01,526 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:01,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:08:01,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:08:01,529 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:01,545 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:01,545 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-07 11:08:01,545 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:19 [2019-12-07 11:08:01,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:08:01,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 11:08:01,615 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:08:01,625 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 11:08:01,626 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:08:01,638 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-12-07 11:08:01,639 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:08:01,653 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 11:08:01,653 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:08:01,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:01,717 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-12-07 11:08:01,718 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:45 [2019-12-07 11:08:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:01,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675617529] [2019-12-07 11:08:01,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:01,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 11:08:01,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049310768] [2019-12-07 11:08:01,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:08:01,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:08:01,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:08:01,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:08:01,901 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 12 states. [2019-12-07 11:08:02,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:02,699 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2019-12-07 11:08:02,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:08:02,700 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-07 11:08:02,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:02,701 INFO L225 Difference]: With dead ends: 87 [2019-12-07 11:08:02,701 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 11:08:02,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:08:02,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 11:08:02,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2019-12-07 11:08:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 11:08:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-12-07 11:08:02,705 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 23 [2019-12-07 11:08:02,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:02,705 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-12-07 11:08:02,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:08:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-12-07 11:08:02,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:08:02,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:02,706 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:02,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 11:08:02,907 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:08:02,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:02,908 INFO L82 PathProgramCache]: Analyzing trace with hash 427490838, now seen corresponding path program 1 times [2019-12-07 11:08:02,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:08:02,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526126673] [2019-12-07 11:08:02,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 11:08:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:03,021 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 11:08:03,023 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:08:03,036 INFO L377 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 11 treesize of output 7 [2019-12-07 11:08:03,036 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:03,040 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:03,041 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:03,041 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-12-07 11:08:03,055 INFO L377 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-12-07 11:08:03,056 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:03,057 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:03,057 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:03,057 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-12-07 11:08:03,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:03,065 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:08:03,130 INFO L377 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 30 treesize of output 26 [2019-12-07 11:08:03,130 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 11:08:03,144 INFO L614 ElimStorePlain]: treesize reduction 9, result has 55.0 percent of original size [2019-12-07 11:08:03,145 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 11:08:03,145 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2019-12-07 11:08:03,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:03,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526126673] [2019-12-07 11:08:03,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:03,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-12-07 11:08:03,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026942278] [2019-12-07 11:08:03,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:08:03,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:08:03,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:08:03,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:08:03,150 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states. [2019-12-07 11:08:03,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:03,332 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-12-07 11:08:03,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:08:03,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 11:08:03,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:03,333 INFO L225 Difference]: With dead ends: 69 [2019-12-07 11:08:03,333 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 11:08:03,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:08:03,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 11:08:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-12-07 11:08:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 11:08:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-12-07 11:08:03,337 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 25 [2019-12-07 11:08:03,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:03,338 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-12-07 11:08:03,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:08:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-12-07 11:08:03,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:08:03,338 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:03,339 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:03,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 11:08:03,540 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:08:03,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:03,541 INFO L82 PathProgramCache]: Analyzing trace with hash -257839042, now seen corresponding path program 1 times [2019-12-07 11:08:03,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:08:03,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737145697] [2019-12-07 11:08:03,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 11:08:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:03,665 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 11:08:03,666 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:08:03,677 INFO L377 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-12-07 11:08:03,677 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:03,681 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:03,681 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:03,681 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 11:08:03,705 INFO L377 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-12-07 11:08:03,705 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:03,707 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:03,707 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:03,707 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 11:08:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:03,716 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:08:03,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-12-07 11:08:03,784 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 11:08:03,791 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:03,791 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 11:08:03,791 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-12-07 11:08:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:03,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737145697] [2019-12-07 11:08:03,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:03,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 11:08:03,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677690641] [2019-12-07 11:08:03,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:08:03,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:08:03,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:08:03,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:08:03,797 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 6 states. [2019-12-07 11:08:03,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:03,955 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-12-07 11:08:03,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:08:03,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 11:08:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:03,956 INFO L225 Difference]: With dead ends: 68 [2019-12-07 11:08:03,956 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 11:08:03,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:08:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 11:08:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-12-07 11:08:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 11:08:03,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-12-07 11:08:03,958 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2019-12-07 11:08:03,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:03,959 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-12-07 11:08:03,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:08:03,959 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-12-07 11:08:03,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:08:03,959 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:03,959 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:04,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 11:08:04,160 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:08:04,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:04,161 INFO L82 PathProgramCache]: Analyzing trace with hash 596924383, now seen corresponding path program 1 times [2019-12-07 11:08:04,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:08:04,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438383566] [2019-12-07 11:08:04,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 11:08:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:04,297 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 11:08:04,299 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:08:04,329 INFO L377 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 11 treesize of output 7 [2019-12-07 11:08:04,329 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:04,336 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:04,336 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:04,337 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2019-12-07 11:08:04,372 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-12-07 11:08:04,373 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:04,381 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:04,381 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:04,381 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2019-12-07 11:08:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:04,397 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:08:04,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-12-07 11:08:04,533 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:08:04,556 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:04,557 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:08:04,557 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:24 [2019-12-07 11:08:04,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:04,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438383566] [2019-12-07 11:08:04,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:04,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-12-07 11:08:04,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133262796] [2019-12-07 11:08:04,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:08:04,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:08:04,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:08:04,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:08:04,623 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 11 states. [2019-12-07 11:08:05,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:05,114 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-12-07 11:08:05,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:08:05,115 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-12-07 11:08:05,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:05,116 INFO L225 Difference]: With dead ends: 67 [2019-12-07 11:08:05,116 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 11:08:05,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:08:05,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 11:08:05,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-12-07 11:08:05,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 11:08:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-12-07 11:08:05,118 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 27 [2019-12-07 11:08:05,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:05,118 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-12-07 11:08:05,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:08:05,118 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-12-07 11:08:05,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:08:05,119 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:05,119 INFO L410 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] [2019-12-07 11:08:05,319 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 11:08:05,320 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:08:05,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:05,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1092881207, now seen corresponding path program 1 times [2019-12-07 11:08:05,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:08:05,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345208677] [2019-12-07 11:08:05,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 11:08:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:05,467 INFO L264 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 11:08:05,469 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:08:05,478 INFO L377 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-12-07 11:08:05,479 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:05,485 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:05,485 INFO L534 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-12-07 11:08:05,485 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2019-12-07 11:08:05,515 INFO L377 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-12-07 11:08:05,515 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:05,520 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:05,520 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:05,520 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 11:08:05,550 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:05,550 INFO L377 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 18 treesize of output 46 [2019-12-07 11:08:05,550 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:05,564 INFO L614 ElimStorePlain]: treesize reduction 26, result has 36.6 percent of original size [2019-12-07 11:08:05,564 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:05,565 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:15 [2019-12-07 11:08:05,614 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 11:08:05,614 INFO L377 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 27 treesize of output 22 [2019-12-07 11:08:05,614 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:05,621 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:05,622 INFO L534 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-12-07 11:08:05,622 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:26 [2019-12-07 11:08:05,660 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:05,660 INFO L377 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 24 [2019-12-07 11:08:05,661 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:05,664 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:05,664 INFO L534 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-12-07 11:08:05,665 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:13 [2019-12-07 11:08:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:05,685 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:08:05,823 INFO L377 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 32 treesize of output 28 [2019-12-07 11:08:05,823 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:08:05,841 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:05,841 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:08:05,841 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-12-07 11:08:05,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:08:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:05,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345208677] [2019-12-07 11:08:05,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:08:05,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2019-12-07 11:08:05,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204511619] [2019-12-07 11:08:05,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 11:08:05,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:08:05,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 11:08:05,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:08:05,975 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 16 states. [2019-12-07 11:08:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:06,792 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2019-12-07 11:08:06,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:08:06,792 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-12-07 11:08:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:06,793 INFO L225 Difference]: With dead ends: 73 [2019-12-07 11:08:06,794 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 11:08:06,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:08:06,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 11:08:06,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-12-07 11:08:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 11:08:06,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-12-07 11:08:06,797 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 28 [2019-12-07 11:08:06,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:06,797 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-12-07 11:08:06,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 11:08:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-12-07 11:08:06,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:08:06,798 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:06,798 INFO L410 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] [2019-12-07 11:08:06,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 11:08:06,999 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:08:06,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:06,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1092881206, now seen corresponding path program 1 times [2019-12-07 11:08:07,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:08:07,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029848757] [2019-12-07 11:08:07,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 11:08:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:07,112 INFO L264 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 11:08:07,114 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:08:07,119 INFO L377 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-12-07 11:08:07,119 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:07,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:07,133 INFO L377 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-12-07 11:08:07,134 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:07,143 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:07,143 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:07,144 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2019-12-07 11:08:07,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:08:07,163 INFO L377 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-12-07 11:08:07,163 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:07,178 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:07,186 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:07,186 INFO L377 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-12-07 11:08:07,187 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:07,199 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:07,200 INFO L534 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-12-07 11:08:07,200 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2019-12-07 11:08:07,254 INFO L377 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 11 treesize of output 7 [2019-12-07 11:08:07,254 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:07,272 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:07,275 INFO L377 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-12-07 11:08:07,275 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:07,294 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:07,295 INFO L534 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-12-07 11:08:07,295 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:45 [2019-12-07 11:08:07,379 INFO L430 ElimStorePlain]: Different costs {1=[|v_#valid_158|], 3=[|v_#length_101|]} [2019-12-07 11:08:07,389 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:07,389 INFO L377 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 17 treesize of output 21 [2019-12-07 11:08:07,390 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:07,406 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:07,421 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:07,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 44 [2019-12-07 11:08:07,421 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:07,455 INFO L614 ElimStorePlain]: treesize reduction 14, result has 75.4 percent of original size [2019-12-07 11:08:07,455 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 11:08:07,455 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:43 [2019-12-07 11:08:07,539 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 11:08:07,539 INFO L377 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 24 [2019-12-07 11:08:07,539 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:07,557 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:07,573 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 11:08:07,573 INFO L377 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 23 treesize of output 18 [2019-12-07 11:08:07,573 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:07,589 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:07,590 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 11:08:07,590 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:54 [2019-12-07 11:08:07,654 INFO L377 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 27 treesize of output 15 [2019-12-07 11:08:07,654 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:07,669 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:07,672 INFO L377 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-12-07 11:08:07,673 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:07,680 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:07,680 INFO L534 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-12-07 11:08:07,680 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:20 [2019-12-07 11:08:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:07,723 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:08:08,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:08,777 INFO L377 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 40 treesize of output 32 [2019-12-07 11:08:08,779 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 11:08:08,836 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:08,846 INFO L377 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 66 treesize of output 62 [2019-12-07 11:08:08,847 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:08:08,935 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:08,943 INFO L377 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 102 treesize of output 94 [2019-12-07 11:08:08,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:08,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:08:08,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:08,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:08,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:08,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:08:08,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:08,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:08,946 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:08:09,125 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-07 11:08:09,126 INFO L614 ElimStorePlain]: treesize reduction 56, result has 54.1 percent of original size [2019-12-07 11:08:09,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:08:09,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:09,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:09,127 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-12-07 11:08:09,128 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:80, output treesize:66 [2019-12-07 11:08:09,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:08:09,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:09,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:09,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:08:09,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:09,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:09,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:09,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:08:09,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:09,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:09,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:08:09,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:09,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:09,580 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:09,580 INFO L377 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 13 treesize of output 17 [2019-12-07 11:08:09,580 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:09,606 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:09,607 INFO L377 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 13 treesize of output 17 [2019-12-07 11:08:09,607 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:09,630 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:09,631 INFO L377 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 13 treesize of output 17 [2019-12-07 11:08:09,631 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:09,652 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:09,652 INFO L377 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 13 treesize of output 17 [2019-12-07 11:08:09,653 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:09,667 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:09,668 INFO L377 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 13 treesize of output 17 [2019-12-07 11:08:09,668 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:09,813 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-12-07 11:08:09,813 INFO L614 ElimStorePlain]: treesize reduction 24, result has 73.9 percent of original size [2019-12-07 11:08:09,814 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-12-07 11:08:09,814 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:137, output treesize:64 [2019-12-07 11:08:10,206 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 22 [2019-12-07 11:08:10,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:08:10,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:08:10,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:10,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:10,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:08:10,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:10,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:10,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:08:10,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:10,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:11,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:08:11,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:11,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:11,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029848757] [2019-12-07 11:08:11,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:08:11,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2019-12-07 11:08:11,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697529936] [2019-12-07 11:08:11,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 11:08:11,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:08:11,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 11:08:11,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:08:11,307 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 19 states. [2019-12-07 11:08:12,292 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-12-07 11:08:12,725 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2019-12-07 11:08:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:16,022 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-12-07 11:08:16,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 11:08:16,023 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2019-12-07 11:08:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:16,023 INFO L225 Difference]: With dead ends: 72 [2019-12-07 11:08:16,024 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 11:08:16,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2019-12-07 11:08:16,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 11:08:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-12-07 11:08:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 11:08:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-12-07 11:08:16,026 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 28 [2019-12-07 11:08:16,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:16,026 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-12-07 11:08:16,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 11:08:16,026 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-12-07 11:08:16,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:08:16,027 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:16,027 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:16,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 11:08:16,228 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:08:16,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:16,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1324786784, now seen corresponding path program 1 times [2019-12-07 11:08:16,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:08:16,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364801860] [2019-12-07 11:08:16,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 11:08:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:16,363 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 11:08:16,364 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:08:16,381 INFO L377 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-12-07 11:08:16,382 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:16,386 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:16,386 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:16,387 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 11:08:16,402 INFO L377 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 11 [2019-12-07 11:08:16,403 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:16,404 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:16,404 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:16,404 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:08:16,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:16,412 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:08:16,473 INFO L377 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 32 treesize of output 28 [2019-12-07 11:08:16,474 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:08:16,490 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:16,490 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:08:16,491 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-12-07 11:08:16,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:08:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:16,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364801860] [2019-12-07 11:08:16,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:16,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2019-12-07 11:08:16,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670562775] [2019-12-07 11:08:16,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:08:16,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:08:16,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:08:16,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:08:16,548 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 8 states. [2019-12-07 11:08:16,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:16,807 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-12-07 11:08:16,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:08:16,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-12-07 11:08:16,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:16,808 INFO L225 Difference]: With dead ends: 69 [2019-12-07 11:08:16,808 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 11:08:16,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:08:16,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 11:08:16,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-12-07 11:08:16,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 11:08:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-12-07 11:08:16,810 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 28 [2019-12-07 11:08:16,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:16,811 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-12-07 11:08:16,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:08:16,811 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-12-07 11:08:16,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:08:16,811 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:16,811 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:17,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 11:08:17,012 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:08:17,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:17,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1881282558, now seen corresponding path program 1 times [2019-12-07 11:08:17,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:08:17,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126498460] [2019-12-07 11:08:17,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 11:08:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:17,147 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 11:08:17,148 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:08:17,151 INFO L377 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-12-07 11:08:17,151 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:17,153 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:17,153 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:17,153 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 11:08:17,172 INFO L377 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-12-07 11:08:17,172 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:17,180 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:17,180 INFO L534 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-12-07 11:08:17,180 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2019-12-07 11:08:17,199 INFO L377 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-12-07 11:08:17,199 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:17,207 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:17,208 INFO L534 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-12-07 11:08:17,208 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2019-12-07 11:08:17,231 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:17,232 INFO L377 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-12-07 11:08:17,232 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:17,236 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:17,236 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:17,236 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-12-07 11:08:17,252 INFO L377 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-12-07 11:08:17,252 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:17,255 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:17,255 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:17,256 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2019-12-07 11:08:17,270 INFO L377 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-12-07 11:08:17,270 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:17,279 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-12-07 11:08:17,279 INFO L534 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-12-07 11:08:17,279 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-12-07 11:08:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:17,298 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:08:17,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:17,410 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:17,412 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2019-12-07 11:08:17,412 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:17,413 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:17,413 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:17,414 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:6 [2019-12-07 11:08:17,440 INFO L377 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 30 treesize of output 26 [2019-12-07 11:08:17,440 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 11:08:17,475 INFO L614 ElimStorePlain]: treesize reduction 32, result has 44.8 percent of original size [2019-12-07 11:08:17,476 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:08:17,476 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:26 [2019-12-07 11:08:17,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-12-07 11:08:17,506 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:17,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-12-07 11:08:17,512 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:17,515 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-12-07 11:08:17,515 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:08:17,531 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:17,531 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-12-07 11:08:17,531 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:71, output treesize:38 [2019-12-07 11:08:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:17,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126498460] [2019-12-07 11:08:17,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:17,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 13 [2019-12-07 11:08:17,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968476395] [2019-12-07 11:08:17,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 11:08:17,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:08:17,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 11:08:17,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:08:17,582 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 14 states. [2019-12-07 11:08:22,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:22,141 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2019-12-07 11:08:22,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:08:22,141 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-12-07 11:08:22,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:22,142 INFO L225 Difference]: With dead ends: 84 [2019-12-07 11:08:22,142 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 11:08:22,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:08:22,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 11:08:22,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 68. [2019-12-07 11:08:22,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 11:08:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-12-07 11:08:22,144 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 29 [2019-12-07 11:08:22,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:22,144 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-12-07 11:08:22,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 11:08:22,145 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-12-07 11:08:22,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:08:22,145 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:22,145 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:22,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 11:08:22,346 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:08:22,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:22,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1881282557, now seen corresponding path program 1 times [2019-12-07 11:08:22,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:08:22,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508676726] [2019-12-07 11:08:22,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 11:08:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:22,426 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:08:22,427 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:08:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:22,442 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:08:22,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:22,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 11:08:22,483 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:08:22,499 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:08:22,499 INFO L534 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-12-07 11:08:22,499 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2019-12-07 11:08:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:22,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508676726] [2019-12-07 11:08:22,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:22,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 11:08:22,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436863034] [2019-12-07 11:08:22,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:08:22,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:08:22,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:08:22,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:08:22,533 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 6 states. [2019-12-07 11:08:22,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:22,585 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-12-07 11:08:22,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:08:22,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-07 11:08:22,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:22,586 INFO L225 Difference]: With dead ends: 63 [2019-12-07 11:08:22,586 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 11:08:22,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:08:22,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 11:08:22,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-12-07 11:08:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 11:08:22,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-12-07 11:08:22,588 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 29 [2019-12-07 11:08:22,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:22,588 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-12-07 11:08:22,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:08:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-12-07 11:08:22,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:08:22,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:22,589 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:22,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 11:08:22,789 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:08:22,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:22,790 INFO L82 PathProgramCache]: Analyzing trace with hash 517689544, now seen corresponding path program 1 times [2019-12-07 11:08:22,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:08:22,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871245381] [2019-12-07 11:08:22,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41b8cae6-08d1-4c13-b648-f0c965a02bb6/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 11:08:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:08:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:08:22,968 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 11:08:22,968 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:08:23,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 11:08:23,185 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-12-07 11:08:23,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:08:23 BoogieIcfgContainer [2019-12-07 11:08:23,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:08:23,199 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:08:23,199 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:08:23,199 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:08:23,200 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:07:53" (3/4) ... [2019-12-07 11:08:23,203 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 11:08:23,203 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:08:23,204 INFO L168 Benchmark]: Toolchain (without parser) took 30301.78 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 320.3 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -102.5 MB). Peak memory consumption was 217.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:08:23,204 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:08:23,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:08:23,204 INFO L168 Benchmark]: Boogie Preprocessor took 42.52 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-12-07 11:08:23,205 INFO L168 Benchmark]: RCFGBuilder took 457.14 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: 64.6 MB). Peak memory consumption was 64.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:08:23,205 INFO L168 Benchmark]: TraceAbstraction took 29484.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 198.7 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -18.2 MB). Peak memory consumption was 180.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:08:23,205 INFO L168 Benchmark]: Witness Printer took 3.52 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:08:23,207 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 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 310.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.52 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 457.14 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: 64.6 MB). Peak memory consumption was 64.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29484.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 198.7 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -18.2 MB). Peak memory consumption was 180.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.52 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 526]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 526. Possible FailurePath: [L528] struct item *list = ((void *)0); VAL [list={15:0}] [L530] CALL append(&list) VAL [plist={15:0}] [L519] struct item *item = malloc(sizeof *item); VAL [item={1:0}, malloc(sizeof *item)={1:0}, plist={15:0}, plist={15:0}] [L520] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={1:0}, malloc(sizeof *item)={1:0}, plist={15:0}, plist={15:0}] [L520] item->next = *plist VAL [\read(**plist)={0:0}, item={1:0}, malloc(sizeof *item)={1:0}, plist={15:0}, plist={15:0}] [L521] EXPR item->next VAL [item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, plist={15:0}, plist={15:0}] [L521-L523] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L521-L523] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={3:0}, item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={3:0}, plist={15:0}, plist={15:0}] [L521-L523] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={3:0}, item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={3:0}, plist={15:0}, plist={15:0}] [L524] *plist = item VAL [item={1:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={3:0}, plist={15:0}, plist={15:0}] [L530] RET append(&list) VAL [list={15:0}] [L531] COND FALSE !(__VERIFIER_nondet_int()) [L532] \read(*list) VAL [\read(*list)={1:0}, list={15:0}] [L532] COND TRUE \read(*list) [L533] EXPR \read(*list) VAL [\read(*list)={1:0}, list={15:0}] [L533] EXPR list->next VAL [\read(*list)={1:0}, list={15:0}, list->next={0:0}] [L533] struct item *next = list->next; [L534] EXPR \read(*list) VAL [\read(*list)={1:0}, list={15:0}, next={0:0}] [L534] free(list) VAL [\read(*list)={1:0}, list={15:0}, next={0:0}] [L534] free(list) VAL [\read(*list)={1:0}, list={15:0}, next={0:0}] [L534] free(list) [L535] list = next VAL [list={15:0}, next={0:0}] [L537] \read(*list) VAL [\read(*list)={0:0}, list={15:0}, next={0:0}] [L537] COND FALSE !(\read(*list)) [L542] return 0; [L528] struct item *list = ((void *)0); [L542] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 109 locations, 41 error locations. Result: UNSAFE, OverallTime: 29.4s, OverallIterations: 17, TraceHistogramMax: 2, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 771 SDtfs, 827 SDslu, 2333 SDs, 0 SdLazy, 2648 SolverSat, 143 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 681 GetRequests, 514 SyntacticMatches, 19 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 65 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 622 ConstructedInterpolants, 55 QuantifiedInterpolants, 146236 SizeOfPredicates, 162 NumberOfNonLiveVariables, 1648 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 32 InterpolantComputations, 28 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...