./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-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_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/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 f68b319d77fa756392ca29e618a1e0accd9b6c9e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:50:46,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:50:46,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:50:46,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:50:46,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:50:46,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:50:46,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:50:46,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:50:46,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:50:46,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:50:46,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:50:46,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:50:46,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:50:46,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:50:46,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:50:46,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:50:46,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:50:46,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:50:46,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:50:46,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:50:46,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:50:46,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:50:46,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:50:46,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:50:46,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:50:46,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:50:46,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:50:46,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:50:46,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:50:46,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:50:46,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:50:46,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:50:46,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:50:46,407 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:50:46,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:50:46,408 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:50:46,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:50:46,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:50:46,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:50:46,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:50:46,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:50:46,410 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 12:50:46,419 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:50:46,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:50:46,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:50:46,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:50:46,420 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:50:46,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:50:46,421 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:50:46,421 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 12:50:46,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:50:46,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:50:46,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:50:46,421 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 12:50:46,422 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 12:50:46,422 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 12:50:46,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:50:46,422 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:50:46,422 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:50:46,422 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:50:46,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:50:46,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:50:46,423 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:50:46,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:50:46,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:50:46,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:50:46,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:50:46,423 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:50:46,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:50:46,423 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:50:46,423 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_6c40533d-5f85-42d5-83f6-2d78e3097f2d/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 -> f68b319d77fa756392ca29e618a1e0accd9b6c9e [2019-12-07 12:50:46,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:50:46,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:50:46,531 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:50:46,532 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:50:46,532 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:50:46,533 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2019-12-07 12:50:46,570 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/data/335424371/60cf76cdb5d14545940c05bc6d2710ed/FLAG2632c2f4b [2019-12-07 12:50:47,037 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:50:47,038 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2019-12-07 12:50:47,046 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/data/335424371/60cf76cdb5d14545940c05bc6d2710ed/FLAG2632c2f4b [2019-12-07 12:50:47,055 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/data/335424371/60cf76cdb5d14545940c05bc6d2710ed [2019-12-07 12:50:47,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:50:47,058 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 12:50:47,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:50:47,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:50:47,061 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:50:47,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:50:47" (1/1) ... [2019-12-07 12:50:47,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35356bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:47, skipping insertion in model container [2019-12-07 12:50:47,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:50:47" (1/1) ... [2019-12-07 12:50:47,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:50:47,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:50:47,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:50:47,296 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:50:47,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:50:47,354 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:50:47,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:47 WrapperNode [2019-12-07 12:50:47,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:50:47,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:50:47,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:50:47,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:50:47,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:47" (1/1) ... [2019-12-07 12:50:47,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:47" (1/1) ... [2019-12-07 12:50:47,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:47" (1/1) ... [2019-12-07 12:50:47,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:47" (1/1) ... [2019-12-07 12:50:47,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:47" (1/1) ... [2019-12-07 12:50:47,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:47" (1/1) ... [2019-12-07 12:50:47,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:47" (1/1) ... [2019-12-07 12:50:47,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:50:47,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:50:47,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:50:47,392 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:50:47,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/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 12:50:47,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 12:50:47,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:50:47,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 12:50:47,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 12:50:47,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 12:50:47,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 12:50:47,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 12:50:47,435 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcmp [2019-12-07 12:50:47,435 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 12:50:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 12:50:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 12:50:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 12:50:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 12:50:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 12:50:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 12:50:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 12:50:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 12:50:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 12:50:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 12:50:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 12:50:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 12:50:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 12:50:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 12:50:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 12:50:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 12:50:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 12:50:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 12:50:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 12:50:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 12:50:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 12:50:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 12:50:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 12:50:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 12:50:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 12:50:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 12:50:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 12:50:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 12:50:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 12:50:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 12:50:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 12:50:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 12:50:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 12:50:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 12:50:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 12:50:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 12:50:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 12:50:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 12:50:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 12:50:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 12:50:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 12:50:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 12:50:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 12:50:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 12:50:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 12:50:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 12:50:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 12:50:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 12:50:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 12:50:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 12:50:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 12:50:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 12:50:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 12:50:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 12:50:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 12:50:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 12:50:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 12:50:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 12:50:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 12:50:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 12:50:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 12:50:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 12:50:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 12:50:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 12:50:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 12:50:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 12:50:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 12:50:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 12:50:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 12:50:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 12:50:47,444 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 12:50:47,444 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 12:50:47,444 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 12:50:47,444 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 12:50:47,444 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 12:50:47,444 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 12:50:47,444 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 12:50:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 12:50:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 12:50:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 12:50:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 12:50:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 12:50:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 12:50:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 12:50:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 12:50:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 12:50:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 12:50:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 12:50:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 12:50:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 12:50:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 12:50:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 12:50:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 12:50:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 12:50:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 12:50:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 12:50:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 12:50:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 12:50:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 12:50:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 12:50:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 12:50:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 12:50:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 12:50:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 12:50:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 12:50:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 12:50:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 12:50:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 12:50:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-12-07 12:50:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcmp [2019-12-07 12:50:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 12:50:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 12:50:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:50:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:50:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:50:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 12:50:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:50:47,735 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:50:47,736 INFO L287 CfgBuilder]: Removed 3 assume(true) statements. [2019-12-07 12:50:47,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:50:47 BoogieIcfgContainer [2019-12-07 12:50:47,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:50:47,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:50:47,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:50:47,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:50:47,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:50:47" (1/3) ... [2019-12-07 12:50:47,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b79fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:50:47, skipping insertion in model container [2019-12-07 12:50:47,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:47" (2/3) ... [2019-12-07 12:50:47,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b79fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:50:47, skipping insertion in model container [2019-12-07 12:50:47,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:50:47" (3/3) ... [2019-12-07 12:50:47,743 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca-1.i [2019-12-07 12:50:47,749 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:50:47,754 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-12-07 12:50:47,761 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-12-07 12:50:47,775 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:50:47,775 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 12:50:47,776 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:50:47,776 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:50:47,776 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:50:47,776 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:50:47,776 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:50:47,776 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:50:47,788 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2019-12-07 12:50:47,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:50:47,796 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:47,796 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:47,797 INFO L410 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:47,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:47,802 INFO L82 PathProgramCache]: Analyzing trace with hash -568922052, now seen corresponding path program 1 times [2019-12-07 12:50:47,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:47,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028496033] [2019-12-07 12:50:47,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:47,953 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 12:50:47,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028496033] [2019-12-07 12:50:47,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:47,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:50:47,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770333731] [2019-12-07 12:50:47,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:50:47,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:47,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:50:47,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:50:47,968 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2019-12-07 12:50:48,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:48,088 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-12-07 12:50:48,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:50:48,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:50:48,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:48,095 INFO L225 Difference]: With dead ends: 56 [2019-12-07 12:50:48,095 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 12:50:48,096 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 12:50:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 12:50:48,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 12:50:48,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 12:50:48,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-12-07 12:50:48,121 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 11 [2019-12-07 12:50:48,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:48,121 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-12-07 12:50:48,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:50:48,121 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-12-07 12:50:48,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:50:48,122 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:48,122 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:48,122 INFO L410 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:48,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:48,122 INFO L82 PathProgramCache]: Analyzing trace with hash -568922051, now seen corresponding path program 1 times [2019-12-07 12:50:48,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:48,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817010468] [2019-12-07 12:50:48,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:48,186 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 12:50:48,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817010468] [2019-12-07 12:50:48,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:48,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:50:48,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361206530] [2019-12-07 12:50:48,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:50:48,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:48,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:50:48,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:50:48,189 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 5 states. [2019-12-07 12:50:48,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:48,306 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2019-12-07 12:50:48,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:50:48,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 12:50:48,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:48,308 INFO L225 Difference]: With dead ends: 73 [2019-12-07 12:50:48,309 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 12:50:48,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:50:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 12:50:48,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2019-12-07 12:50:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 12:50:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-12-07 12:50:48,317 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 11 [2019-12-07 12:50:48,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:48,318 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-12-07 12:50:48,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:50:48,318 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-12-07 12:50:48,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:50:48,318 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:48,318 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:48,319 INFO L410 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:48,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:48,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1273294668, now seen corresponding path program 1 times [2019-12-07 12:50:48,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:48,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773092563] [2019-12-07 12:50:48,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:48,365 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 12:50:48,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773092563] [2019-12-07 12:50:48,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:48,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:50:48,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326842638] [2019-12-07 12:50:48,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:50:48,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:48,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:50:48,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:50:48,367 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states. [2019-12-07 12:50:48,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:48,437 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-12-07 12:50:48,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:50:48,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 12:50:48,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:48,438 INFO L225 Difference]: With dead ends: 54 [2019-12-07 12:50:48,438 INFO L226 Difference]: Without dead ends: 54 [2019-12-07 12:50:48,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:50:48,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-07 12:50:48,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-12-07 12:50:48,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 12:50:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2019-12-07 12:50:48,443 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 13 [2019-12-07 12:50:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:48,443 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2019-12-07 12:50:48,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:50:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2019-12-07 12:50:48,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:50:48,443 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:48,443 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:48,444 INFO L410 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:48,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:48,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1273294616, now seen corresponding path program 1 times [2019-12-07 12:50:48,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:48,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040760292] [2019-12-07 12:50:48,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:48,472 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 12:50:48,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040760292] [2019-12-07 12:50:48,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:48,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:50:48,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553404279] [2019-12-07 12:50:48,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:50:48,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:48,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:50:48,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:50:48,473 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 4 states. [2019-12-07 12:50:48,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:48,540 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-12-07 12:50:48,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:50:48,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 12:50:48,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:48,541 INFO L225 Difference]: With dead ends: 52 [2019-12-07 12:50:48,541 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 12:50:48,541 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 12:50:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 12:50:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-07 12:50:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 12:50:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-12-07 12:50:48,545 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 13 [2019-12-07 12:50:48,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:48,545 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-12-07 12:50:48,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:50:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-12-07 12:50:48,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:50:48,545 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:48,546 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:48,546 INFO L410 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:48,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:48,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1273294615, now seen corresponding path program 1 times [2019-12-07 12:50:48,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:48,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090353702] [2019-12-07 12:50:48,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:48,580 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 12:50:48,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090353702] [2019-12-07 12:50:48,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:48,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:50:48,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068654695] [2019-12-07 12:50:48,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:50:48,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:48,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:50:48,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:50:48,582 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 5 states. [2019-12-07 12:50:48,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:48,659 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-12-07 12:50:48,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:50:48,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 12:50:48,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:48,660 INFO L225 Difference]: With dead ends: 69 [2019-12-07 12:50:48,660 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 12:50:48,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:50:48,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 12:50:48,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2019-12-07 12:50:48,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 12:50:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-12-07 12:50:48,664 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 13 [2019-12-07 12:50:48,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:48,665 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-12-07 12:50:48,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:50:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-12-07 12:50:48,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:50:48,665 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:48,665 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:48,665 INFO L410 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:48,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:48,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1216036313, now seen corresponding path program 1 times [2019-12-07 12:50:48,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:48,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796195366] [2019-12-07 12:50:48,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:48,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 12:50:48,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796195366] [2019-12-07 12:50:48,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:48,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:50:48,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667863963] [2019-12-07 12:50:48,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:50:48,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:48,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:50:48,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:50:48,718 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 6 states. [2019-12-07 12:50:48,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:48,828 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2019-12-07 12:50:48,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:50:48,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-12-07 12:50:48,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:48,829 INFO L225 Difference]: With dead ends: 72 [2019-12-07 12:50:48,829 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 12:50:48,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:50:48,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 12:50:48,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2019-12-07 12:50:48,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 12:50:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-12-07 12:50:48,835 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 13 [2019-12-07 12:50:48,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:48,835 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-12-07 12:50:48,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:50:48,836 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-12-07 12:50:48,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:50:48,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:48,836 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:48,837 INFO L410 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:48,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:48,837 INFO L82 PathProgramCache]: Analyzing trace with hash -817429008, now seen corresponding path program 1 times [2019-12-07 12:50:48,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:48,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457070107] [2019-12-07 12:50:48,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:48,881 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 12:50:48,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457070107] [2019-12-07 12:50:48,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:48,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:50:48,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550105309] [2019-12-07 12:50:48,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:50:48,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:48,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:50:48,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:50:48,882 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 5 states. [2019-12-07 12:50:48,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:48,950 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2019-12-07 12:50:48,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:50:48,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 12:50:48,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:48,951 INFO L225 Difference]: With dead ends: 62 [2019-12-07 12:50:48,952 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 12:50:48,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:50:48,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 12:50:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 12:50:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 12:50:48,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2019-12-07 12:50:48,957 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 14 [2019-12-07 12:50:48,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:48,957 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2019-12-07 12:50:48,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:50:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2019-12-07 12:50:48,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:50:48,958 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:48,958 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:48,958 INFO L410 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:48,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:48,959 INFO L82 PathProgramCache]: Analyzing trace with hash 478071552, now seen corresponding path program 1 times [2019-12-07 12:50:48,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:48,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420307925] [2019-12-07 12:50:48,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:49,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420307925] [2019-12-07 12:50:49,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005283210] [2019-12-07 12:50:49,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/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 12:50:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:49,080 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 12:50:49,084 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:50:49,115 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_33|]} [2019-12-07 12:50:49,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:50:49,128 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:50:49,128 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:50:49,137 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:50:49,141 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 10 treesize of output 8 [2019-12-07 12:50:49,142 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:50:49,148 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:50:49,148 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:50:49,148 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 12:50:49,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:49,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:50:49,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-12-07 12:50:49,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054115386] [2019-12-07 12:50:49,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:50:49,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:49,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:50:49,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:50:49,162 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 7 states. [2019-12-07 12:50:49,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:49,271 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2019-12-07 12:50:49,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:50:49,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-07 12:50:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:49,272 INFO L225 Difference]: With dead ends: 81 [2019-12-07 12:50:49,273 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 12:50:49,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:50:49,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 12:50:49,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2019-12-07 12:50:49,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 12:50:49,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2019-12-07 12:50:49,278 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 15 [2019-12-07 12:50:49,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:49,278 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2019-12-07 12:50:49,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:50:49,278 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2019-12-07 12:50:49,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:50:49,279 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:49,279 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:49,479 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:50:49,480 INFO L410 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:49,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:49,481 INFO L82 PathProgramCache]: Analyzing trace with hash 437037254, now seen corresponding path program 1 times [2019-12-07 12:50:49,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:49,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526768221] [2019-12-07 12:50:49,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:49,558 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 12:50:49,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526768221] [2019-12-07 12:50:49,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:49,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:50:49,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392659066] [2019-12-07 12:50:49,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:50:49,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:49,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:50:49,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:50:49,560 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 6 states. [2019-12-07 12:50:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:49,676 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-12-07 12:50:49,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:50:49,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-07 12:50:49,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:49,677 INFO L225 Difference]: With dead ends: 55 [2019-12-07 12:50:49,677 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 12:50:49,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:50:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 12:50:49,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-12-07 12:50:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 12:50:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-12-07 12:50:49,681 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 17 [2019-12-07 12:50:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:49,682 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-12-07 12:50:49,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:50:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-12-07 12:50:49,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:50:49,682 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:49,682 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:49,683 INFO L410 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:49,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:49,683 INFO L82 PathProgramCache]: Analyzing trace with hash 437037255, now seen corresponding path program 1 times [2019-12-07 12:50:49,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:49,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287946247] [2019-12-07 12:50:49,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:49,738 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 12:50:49,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287946247] [2019-12-07 12:50:49,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:49,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:50:49,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091089218] [2019-12-07 12:50:49,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:50:49,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:49,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:50:49,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:50:49,739 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 8 states. [2019-12-07 12:50:49,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:49,866 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-12-07 12:50:49,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:50:49,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-07 12:50:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:49,868 INFO L225 Difference]: With dead ends: 69 [2019-12-07 12:50:49,868 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 12:50:49,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:50:49,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 12:50:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-12-07 12:50:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 12:50:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-12-07 12:50:49,871 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 17 [2019-12-07 12:50:49,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:49,871 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-12-07 12:50:49,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:50:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-12-07 12:50:49,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:50:49,872 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:49,872 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:49,872 INFO L410 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:49,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:49,872 INFO L82 PathProgramCache]: Analyzing trace with hash 92671082, now seen corresponding path program 1 times [2019-12-07 12:50:49,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:49,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636792422] [2019-12-07 12:50:49,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:49,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636792422] [2019-12-07 12:50:49,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805229280] [2019-12-07 12:50:49,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/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 12:50:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:49,969 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 12:50:49,971 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:50:49,983 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:50:49,983 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:50:49,984 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:50:49,995 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 12:50:49,995 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 12:50:49,995 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 12:50:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:50,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:50:50,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-12-07 12:50:50,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560791908] [2019-12-07 12:50:50,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:50:50,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:50,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:50:50,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:50:50,005 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 7 states. [2019-12-07 12:50:50,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:50,094 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-12-07 12:50:50,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:50:50,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 12:50:50,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:50,095 INFO L225 Difference]: With dead ends: 67 [2019-12-07 12:50:50,095 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 12:50:50,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:50:50,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 12:50:50,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2019-12-07 12:50:50,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 12:50:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-12-07 12:50:50,099 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 17 [2019-12-07 12:50:50,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:50,099 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-12-07 12:50:50,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:50:50,099 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-12-07 12:50:50,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:50:50,100 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:50,100 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:50,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:50:50,301 INFO L410 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:50,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:50,301 INFO L82 PathProgramCache]: Analyzing trace with hash -913994489, now seen corresponding path program 1 times [2019-12-07 12:50:50,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:50,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198942527] [2019-12-07 12:50:50,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:50,357 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 12:50:50,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198942527] [2019-12-07 12:50:50,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:50,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:50:50,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037832134] [2019-12-07 12:50:50,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:50:50,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:50,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:50:50,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:50:50,358 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 7 states. [2019-12-07 12:50:50,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:50,456 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-12-07 12:50:50,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:50:50,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-07 12:50:50,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:50,457 INFO L225 Difference]: With dead ends: 56 [2019-12-07 12:50:50,457 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 12:50:50,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:50:50,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 12:50:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-07 12:50:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 12:50:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2019-12-07 12:50:50,460 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 19 [2019-12-07 12:50:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:50,460 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-12-07 12:50:50,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:50:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2019-12-07 12:50:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:50:50,461 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:50,461 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:50,461 INFO L410 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:50,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:50,461 INFO L82 PathProgramCache]: Analyzing trace with hash -913994488, now seen corresponding path program 1 times [2019-12-07 12:50:50,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:50,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408476436] [2019-12-07 12:50:50,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:50,520 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 12:50:50,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408476436] [2019-12-07 12:50:50,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:50,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:50:50,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28185307] [2019-12-07 12:50:50,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:50:50,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:50,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:50:50,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:50:50,521 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 9 states. [2019-12-07 12:50:50,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:50,702 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-12-07 12:50:50,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:50:50,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-07 12:50:50,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:50,702 INFO L225 Difference]: With dead ends: 56 [2019-12-07 12:50:50,702 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 12:50:50,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:50:50,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 12:50:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-07 12:50:50,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 12:50:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2019-12-07 12:50:50,705 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 19 [2019-12-07 12:50:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:50,705 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2019-12-07 12:50:50,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:50:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2019-12-07 12:50:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:50:50,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:50,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] [2019-12-07 12:50:50,706 INFO L410 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:50,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:50,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2119591432, now seen corresponding path program 1 times [2019-12-07 12:50:50,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:50,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461295693] [2019-12-07 12:50:50,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:50,742 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 12:50:50,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461295693] [2019-12-07 12:50:50,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:50,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:50:50,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947474996] [2019-12-07 12:50:50,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:50:50,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:50,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:50:50,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:50:50,743 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 7 states. [2019-12-07 12:50:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:50,854 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-12-07 12:50:50,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:50:50,854 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-12-07 12:50:50,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:50,855 INFO L225 Difference]: With dead ends: 55 [2019-12-07 12:50:50,855 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 12:50:50,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:50:50,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 12:50:50,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-12-07 12:50:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 12:50:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-12-07 12:50:50,857 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 21 [2019-12-07 12:50:50,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:50,857 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-12-07 12:50:50,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:50:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-12-07 12:50:50,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:50:50,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:50,858 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] [2019-12-07 12:50:50,858 INFO L410 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:50,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:50,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2119591433, now seen corresponding path program 1 times [2019-12-07 12:50:50,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:50,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067439552] [2019-12-07 12:50:50,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:50,903 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 12:50:50,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067439552] [2019-12-07 12:50:50,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:50,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:50:50,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568110945] [2019-12-07 12:50:50,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:50:50,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:50,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:50:50,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:50:50,904 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 8 states. [2019-12-07 12:50:51,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:51,015 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-12-07 12:50:51,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:50:51,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-12-07 12:50:51,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:51,016 INFO L225 Difference]: With dead ends: 64 [2019-12-07 12:50:51,016 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 12:50:51,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:50:51,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 12:50:51,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2019-12-07 12:50:51,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 12:50:51,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2019-12-07 12:50:51,018 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 21 [2019-12-07 12:50:51,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:51,018 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2019-12-07 12:50:51,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:50:51,018 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2019-12-07 12:50:51,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:50:51,019 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:51,019 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 12:50:51,019 INFO L410 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:51,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:51,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1112818005, now seen corresponding path program 1 times [2019-12-07 12:50:51,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:51,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484496845] [2019-12-07 12:50:51,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:51,050 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 12:50:51,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484496845] [2019-12-07 12:50:51,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:51,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:50:51,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923089730] [2019-12-07 12:50:51,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:50:51,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:51,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:50:51,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:50:51,051 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 7 states. [2019-12-07 12:50:51,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:51,141 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-12-07 12:50:51,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:50:51,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-07 12:50:51,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:51,142 INFO L225 Difference]: With dead ends: 55 [2019-12-07 12:50:51,142 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 12:50:51,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:50:51,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 12:50:51,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-12-07 12:50:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 12:50:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-12-07 12:50:51,144 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 23 [2019-12-07 12:50:51,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:51,144 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-12-07 12:50:51,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:50:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-12-07 12:50:51,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:50:51,145 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:51,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] [2019-12-07 12:50:51,145 INFO L410 AbstractCegarLoop]: === Iteration 17 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:51,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:51,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1112818006, now seen corresponding path program 1 times [2019-12-07 12:50:51,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:51,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580629024] [2019-12-07 12:50:51,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:51,206 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 12:50:51,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580629024] [2019-12-07 12:50:51,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:51,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:50:51,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443825760] [2019-12-07 12:50:51,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:50:51,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:51,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:50:51,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:50:51,207 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 9 states. [2019-12-07 12:50:51,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:51,383 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2019-12-07 12:50:51,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:50:51,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-12-07 12:50:51,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:51,384 INFO L225 Difference]: With dead ends: 63 [2019-12-07 12:50:51,384 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 12:50:51,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:50:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 12:50:51,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2019-12-07 12:50:51,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 12:50:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2019-12-07 12:50:51,386 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 23 [2019-12-07 12:50:51,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:51,386 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2019-12-07 12:50:51,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:50:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2019-12-07 12:50:51,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:50:51,387 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:51,387 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 12:50:51,387 INFO L410 AbstractCegarLoop]: === Iteration 18 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:51,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:51,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1112867735, now seen corresponding path program 1 times [2019-12-07 12:50:51,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:51,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421864438] [2019-12-07 12:50:51,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:51,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421864438] [2019-12-07 12:50:51,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:51,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 12:50:51,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582282659] [2019-12-07 12:50:51,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:50:51,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:51,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:50:51,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:50:51,492 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 11 states. [2019-12-07 12:50:51,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:51,710 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2019-12-07 12:50:51,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:50:51,710 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-07 12:50:51,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:51,711 INFO L225 Difference]: With dead ends: 93 [2019-12-07 12:50:51,711 INFO L226 Difference]: Without dead ends: 93 [2019-12-07 12:50:51,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:50:51,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-07 12:50:51,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2019-12-07 12:50:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 12:50:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2019-12-07 12:50:51,714 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 23 [2019-12-07 12:50:51,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:51,714 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2019-12-07 12:50:51,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:50:51,715 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2019-12-07 12:50:51,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 12:50:51,715 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:51,715 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 12:50:51,716 INFO L410 AbstractCegarLoop]: === Iteration 19 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:51,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:51,716 INFO L82 PathProgramCache]: Analyzing trace with hash 590156061, now seen corresponding path program 1 times [2019-12-07 12:50:51,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:51,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841280614] [2019-12-07 12:50:51,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:51,766 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 12:50:51,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841280614] [2019-12-07 12:50:51,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:51,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:50:51,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108476681] [2019-12-07 12:50:51,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:50:51,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:51,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:50:51,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:50:51,768 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 5 states. [2019-12-07 12:50:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:51,820 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2019-12-07 12:50:51,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:50:51,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 12:50:51,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:51,821 INFO L225 Difference]: With dead ends: 81 [2019-12-07 12:50:51,821 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 12:50:51,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:50:51,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 12:50:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-07 12:50:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 12:50:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-12-07 12:50:51,822 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 26 [2019-12-07 12:50:51,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:51,823 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-12-07 12:50:51,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:50:51,823 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2019-12-07 12:50:51,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:50:51,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:51,823 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 12:50:51,823 INFO L410 AbstractCegarLoop]: === Iteration 20 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:51,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:51,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1603523034, now seen corresponding path program 1 times [2019-12-07 12:50:51,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:51,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534395973] [2019-12-07 12:50:51,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:51,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534395973] [2019-12-07 12:50:51,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747279398] [2019-12-07 12:50:51,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:50:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:51,973 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 12:50:51,975 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:50:51,989 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 12:50:51,989 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:50:51,991 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:50:51,991 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:50:51,991 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 12:50:52,114 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:50:52,114 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 26 treesize of output 22 [2019-12-07 12:50:52,115 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:50:52,116 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:50:52,116 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:50:52,117 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-12-07 12:50:52,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:50:52,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:50:52,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 20 [2019-12-07 12:50:52,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723634905] [2019-12-07 12:50:52,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:50:52,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:52,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:50:52,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2019-12-07 12:50:52,136 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 11 states. [2019-12-07 12:50:52,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:52,341 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-12-07 12:50:52,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:50:52,341 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-12-07 12:50:52,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:52,342 INFO L225 Difference]: With dead ends: 60 [2019-12-07 12:50:52,342 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 12:50:52,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2019-12-07 12:50:52,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 12:50:52,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-07 12:50:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 12:50:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-12-07 12:50:52,343 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 27 [2019-12-07 12:50:52,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:52,343 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-12-07 12:50:52,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:50:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-12-07 12:50:52,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:50:52,344 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:52,344 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 12:50:52,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:50:52,545 INFO L410 AbstractCegarLoop]: === Iteration 21 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:52,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:52,545 INFO L82 PathProgramCache]: Analyzing trace with hash 785874584, now seen corresponding path program 1 times [2019-12-07 12:50:52,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:52,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543161642] [2019-12-07 12:50:52,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:52,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543161642] [2019-12-07 12:50:52,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095433118] [2019-12-07 12:50:52,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:50:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:52,685 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 12:50:52,686 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:50:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:52,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:50:52,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-12-07 12:50:52,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055489199] [2019-12-07 12:50:52,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 12:50:52,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:52,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 12:50:52,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:50:52,753 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 17 states. [2019-12-07 12:50:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:53,033 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-12-07 12:50:53,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:50:53,034 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-07 12:50:53,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:53,035 INFO L225 Difference]: With dead ends: 52 [2019-12-07 12:50:53,035 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 12:50:53,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2019-12-07 12:50:53,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 12:50:53,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2019-12-07 12:50:53,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 12:50:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2019-12-07 12:50:53,039 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 27 [2019-12-07 12:50:53,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:53,039 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2019-12-07 12:50:53,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 12:50:53,039 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2019-12-07 12:50:53,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:50:53,040 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:53,040 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:53,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:50:53,241 INFO L410 AbstractCegarLoop]: === Iteration 22 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:53,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:53,242 INFO L82 PathProgramCache]: Analyzing trace with hash -688770407, now seen corresponding path program 1 times [2019-12-07 12:50:53,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:53,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72931195] [2019-12-07 12:50:53,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:50:53,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72931195] [2019-12-07 12:50:53,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:53,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 12:50:53,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938069522] [2019-12-07 12:50:53,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 12:50:53,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:53,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 12:50:53,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:50:53,398 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 15 states. [2019-12-07 12:50:53,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:53,632 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-12-07 12:50:53,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 12:50:53,633 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-12-07 12:50:53,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:53,633 INFO L225 Difference]: With dead ends: 62 [2019-12-07 12:50:53,633 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 12:50:53,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2019-12-07 12:50:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 12:50:53,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-12-07 12:50:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 12:50:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-12-07 12:50:53,635 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 29 [2019-12-07 12:50:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:53,635 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-12-07 12:50:53,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 12:50:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-12-07 12:50:53,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:50:53,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:53,636 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:53,636 INFO L410 AbstractCegarLoop]: === Iteration 23 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:53,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:53,636 INFO L82 PathProgramCache]: Analyzing trace with hash -196593956, now seen corresponding path program 1 times [2019-12-07 12:50:53,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:53,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457079031] [2019-12-07 12:50:53,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:50:53,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457079031] [2019-12-07 12:50:53,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120146834] [2019-12-07 12:50:53,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:50:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:53,786 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 12:50:53,787 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:50:53,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:50:53,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:50:53,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-12-07 12:50:53,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341509980] [2019-12-07 12:50:53,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 12:50:53,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:53,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 12:50:53,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-12-07 12:50:53,852 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 18 states. [2019-12-07 12:50:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:54,132 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-12-07 12:50:54,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:50:54,132 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-12-07 12:50:54,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:54,133 INFO L225 Difference]: With dead ends: 49 [2019-12-07 12:50:54,133 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 12:50:54,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2019-12-07 12:50:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 12:50:54,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-12-07 12:50:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 12:50:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-12-07 12:50:54,134 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 33 [2019-12-07 12:50:54,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:54,134 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-12-07 12:50:54,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 12:50:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-12-07 12:50:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 12:50:54,135 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:54,135 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:54,335 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:50:54,336 INFO L410 AbstractCegarLoop]: === Iteration 24 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:54,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:54,336 INFO L82 PathProgramCache]: Analyzing trace with hash 51768029, now seen corresponding path program 1 times [2019-12-07 12:50:54,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:54,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693839326] [2019-12-07 12:50:54,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:50:54,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693839326] [2019-12-07 12:50:54,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768598853] [2019-12-07 12:50:54,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:50:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:54,513 INFO L264 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 12:50:54,514 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:50:54,525 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:50:54,525 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:50:54,525 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:50:54,541 INFO L614 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-12-07 12:50:54,541 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:50:54,541 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:24 [2019-12-07 12:50:54,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:50:54,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:54,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:50:54,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-07 12:50:54,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285920568] [2019-12-07 12:50:54,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 12:50:54,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:54,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 12:50:54,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-12-07 12:50:54,713 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 22 states. [2019-12-07 12:50:55,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:55,211 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-12-07 12:50:55,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:50:55,211 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 35 [2019-12-07 12:50:55,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:55,212 INFO L225 Difference]: With dead ends: 54 [2019-12-07 12:50:55,212 INFO L226 Difference]: Without dead ends: 54 [2019-12-07 12:50:55,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2019-12-07 12:50:55,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-07 12:50:55,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-12-07 12:50:55,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 12:50:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-12-07 12:50:55,213 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 35 [2019-12-07 12:50:55,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:55,214 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-12-07 12:50:55,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 12:50:55,214 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-12-07 12:50:55,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 12:50:55,214 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:55,214 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:55,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:50:55,415 INFO L410 AbstractCegarLoop]: === Iteration 25 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:55,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:55,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1790582486, now seen corresponding path program 1 times [2019-12-07 12:50:55,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:55,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340037027] [2019-12-07 12:50:55,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:55,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:50:55,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340037027] [2019-12-07 12:50:55,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858919683] [2019-12-07 12:50:55,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:50:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:55,578 INFO L264 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 12:50:55,580 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:50:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:50:55,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:50:55,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2019-12-07 12:50:55,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39716184] [2019-12-07 12:50:55,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 12:50:55,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:55,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 12:50:55,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-12-07 12:50:55,650 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 19 states. [2019-12-07 12:50:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:56,026 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2019-12-07 12:50:56,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:50:56,027 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 37 [2019-12-07 12:50:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:56,028 INFO L225 Difference]: With dead ends: 56 [2019-12-07 12:50:56,028 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 12:50:56,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2019-12-07 12:50:56,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 12:50:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2019-12-07 12:50:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 12:50:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-12-07 12:50:56,033 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 37 [2019-12-07 12:50:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:56,033 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-12-07 12:50:56,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 12:50:56,033 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-12-07 12:50:56,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 12:50:56,034 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:56,035 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:56,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:50:56,236 INFO L410 AbstractCegarLoop]: === Iteration 26 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:56,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:56,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1790532757, now seen corresponding path program 1 times [2019-12-07 12:50:56,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:56,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635828427] [2019-12-07 12:50:56,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:56,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:50:56,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635828427] [2019-12-07 12:50:56,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328046311] [2019-12-07 12:50:56,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:50:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:56,538 INFO L264 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 53 conjunts are in the unsatisfiable core [2019-12-07 12:50:56,539 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:50:56,606 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 14 treesize of output 10 [2019-12-07 12:50:56,606 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:50:56,611 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:50:56,611 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:50:56,611 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-12-07 12:50:56,921 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:50:56,933 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:50:56,933 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 40 [2019-12-07 12:50:56,934 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:50:56,940 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:50:56,940 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:50:56,941 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:46, output treesize:3 [2019-12-07 12:50:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:50:56,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:50:56,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 28 [2019-12-07 12:50:56,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120151689] [2019-12-07 12:50:56,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 12:50:56,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:56,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 12:50:56,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2019-12-07 12:50:56,946 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 28 states. [2019-12-07 12:50:58,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:58,949 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2019-12-07 12:50:58,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-07 12:50:58,949 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 37 [2019-12-07 12:50:58,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:58,949 INFO L225 Difference]: With dead ends: 124 [2019-12-07 12:50:58,950 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 12:50:58,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=465, Invalid=4091, Unknown=0, NotChecked=0, Total=4556 [2019-12-07 12:50:58,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 12:50:58,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2019-12-07 12:50:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 12:50:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-12-07 12:50:58,952 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 37 [2019-12-07 12:50:58,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:58,952 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-12-07 12:50:58,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 12:50:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-12-07 12:50:58,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 12:50:58,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:58,953 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:59,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:50:59,154 INFO L410 AbstractCegarLoop]: === Iteration 27 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:50:59,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:59,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1666823887, now seen corresponding path program 2 times [2019-12-07 12:50:59,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:59,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312045568] [2019-12-07 12:50:59,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 12:50:59,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312045568] [2019-12-07 12:50:59,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136655211] [2019-12-07 12:50:59,281 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:50:59,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:50:59,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:50:59,351 INFO L264 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 12:50:59,353 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:50:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 12:50:59,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:50:59,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2019-12-07 12:50:59,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699753152] [2019-12-07 12:50:59,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 12:50:59,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:59,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 12:50:59,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-12-07 12:50:59,471 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 23 states. [2019-12-07 12:51:00,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:00,160 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-12-07 12:51:00,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:51:00,160 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2019-12-07 12:51:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:00,161 INFO L225 Difference]: With dead ends: 67 [2019-12-07 12:51:00,161 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 12:51:00,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2019-12-07 12:51:00,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 12:51:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-12-07 12:51:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 12:51:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-12-07 12:51:00,165 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 45 [2019-12-07 12:51:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:00,166 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-12-07 12:51:00,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 12:51:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-12-07 12:51:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 12:51:00,166 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:00,167 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:00,367 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:00,367 INFO L410 AbstractCegarLoop]: === Iteration 28 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:51:00,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:00,368 INFO L82 PathProgramCache]: Analyzing trace with hash 205044466, now seen corresponding path program 2 times [2019-12-07 12:51:00,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:00,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547779034] [2019-12-07 12:51:00,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 12:51:00,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547779034] [2019-12-07 12:51:00,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689925341] [2019-12-07 12:51:00,497 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:00,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:51:00,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:51:00,565 INFO L264 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 12:51:00,567 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:51:00,657 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 12:51:00,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:51:00,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2019-12-07 12:51:00,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262619348] [2019-12-07 12:51:00,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 12:51:00,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:00,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 12:51:00,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2019-12-07 12:51:00,658 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 21 states. [2019-12-07 12:51:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:01,019 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-12-07 12:51:01,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:51:01,019 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2019-12-07 12:51:01,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:01,020 INFO L225 Difference]: With dead ends: 63 [2019-12-07 12:51:01,020 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 12:51:01,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2019-12-07 12:51:01,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 12:51:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-12-07 12:51:01,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 12:51:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-12-07 12:51:01,022 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 47 [2019-12-07 12:51:01,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:01,022 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-12-07 12:51:01,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 12:51:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-12-07 12:51:01,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 12:51:01,022 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:01,022 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:01,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:01,223 INFO L410 AbstractCegarLoop]: === Iteration 29 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:51:01,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:01,224 INFO L82 PathProgramCache]: Analyzing trace with hash -520765069, now seen corresponding path program 2 times [2019-12-07 12:51:01,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:01,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881604037] [2019-12-07 12:51:01,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 12:51:01,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881604037] [2019-12-07 12:51:01,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366190792] [2019-12-07 12:51:01,309 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:01,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 12:51:01,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:51:01,362 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:51:01,364 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:51:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 12:51:01,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:51:01,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-12-07 12:51:01,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166174484] [2019-12-07 12:51:01,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:51:01,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:01,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:51:01,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:51:01,384 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-12-07 12:51:01,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:01,402 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-12-07 12:51:01,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:51:01,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 12:51:01,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:01,403 INFO L225 Difference]: With dead ends: 61 [2019-12-07 12:51:01,403 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 12:51:01,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:51:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 12:51:01,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-12-07 12:51:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 12:51:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-12-07 12:51:01,405 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 49 [2019-12-07 12:51:01,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:01,405 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-12-07 12:51:01,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:51:01,405 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-12-07 12:51:01,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 12:51:01,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:01,405 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:01,606 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:01,606 INFO L410 AbstractCegarLoop]: === Iteration 30 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:51:01,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:01,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2055891520, now seen corresponding path program 2 times [2019-12-07 12:51:01,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:01,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071904574] [2019-12-07 12:51:01,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:01,752 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 12:51:01,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071904574] [2019-12-07 12:51:01,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516623630] [2019-12-07 12:51:01,752 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:01,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 12:51:01,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:51:01,806 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 12:51:01,807 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:51:01,855 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 12:51:01,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:51:01,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 17 [2019-12-07 12:51:01,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867947812] [2019-12-07 12:51:01,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:51:01,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:01,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:51:01,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-07 12:51:01,856 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 5 states. [2019-12-07 12:51:01,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:01,896 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-12-07 12:51:01,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:51:01,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-07 12:51:01,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:01,897 INFO L225 Difference]: With dead ends: 58 [2019-12-07 12:51:01,897 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 12:51:01,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-12-07 12:51:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 12:51:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-12-07 12:51:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 12:51:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-12-07 12:51:01,899 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 51 [2019-12-07 12:51:01,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:01,899 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-12-07 12:51:01,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:51:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-12-07 12:51:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 12:51:01,899 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:01,899 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:02,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:02,100 INFO L410 AbstractCegarLoop]: === Iteration 31 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:51:02,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:02,100 INFO L82 PathProgramCache]: Analyzing trace with hash 2055941249, now seen corresponding path program 3 times [2019-12-07 12:51:02,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:02,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898167588] [2019-12-07 12:51:02,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:02,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898167588] [2019-12-07 12:51:02,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935694190] [2019-12-07 12:51:02,748 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:02,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 12:51:02,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:51:02,826 INFO L264 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 51 conjunts are in the unsatisfiable core [2019-12-07 12:51:02,827 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:51:02,831 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 10 treesize of output 8 [2019-12-07 12:51:02,831 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:51:02,834 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:51:02,834 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:51:02,835 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 12:51:02,991 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 14 treesize of output 10 [2019-12-07 12:51:02,991 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:51:02,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:51:02,997 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:51:02,997 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-12-07 12:51:03,035 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 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-07 12:51:03,036 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:51:03,043 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:51:03,043 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 12:51:03,044 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2019-12-07 12:51:03,349 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:51:03,350 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 10 [2019-12-07 12:51:03,350 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:51:03,354 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:51:03,354 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:51:03,354 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:37, output treesize:3 [2019-12-07 12:51:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 12:51:03,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:51:03,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16] total 39 [2019-12-07 12:51:03,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377123883] [2019-12-07 12:51:03,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-07 12:51:03,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:03,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-07 12:51:03,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1388, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 12:51:03,367 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 39 states. [2019-12-07 12:51:09,462 WARN L192 SmtUtils]: Spent 3.99 s on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-12-07 12:51:14,320 WARN L192 SmtUtils]: Spent 3.30 s on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-12-07 12:51:19,403 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-12-07 12:51:24,708 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-12-07 12:51:28,853 WARN L192 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-07 12:51:32,973 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-07 12:51:38,710 WARN L192 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-12-07 12:51:39,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:39,327 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2019-12-07 12:51:39,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 12:51:39,328 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 51 [2019-12-07 12:51:39,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:39,328 INFO L225 Difference]: With dead ends: 123 [2019-12-07 12:51:39,328 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 12:51:39,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=408, Invalid=4561, Unknown=1, NotChecked=0, Total=4970 [2019-12-07 12:51:39,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 12:51:39,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2019-12-07 12:51:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 12:51:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-12-07 12:51:39,331 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 51 [2019-12-07 12:51:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:39,331 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-12-07 12:51:39,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-07 12:51:39,331 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-12-07 12:51:39,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 12:51:39,331 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:39,332 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:39,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:39,532 INFO L410 AbstractCegarLoop]: === Iteration 32 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:51:39,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:39,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1984837956, now seen corresponding path program 4 times [2019-12-07 12:51:39,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:39,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627910350] [2019-12-07 12:51:39,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 12:51:39,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627910350] [2019-12-07 12:51:39,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467367733] [2019-12-07 12:51:39,717 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:39,784 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 12:51:39,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:51:39,786 INFO L264 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 65 conjunts are in the unsatisfiable core [2019-12-07 12:51:39,787 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:51:39,799 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:51:39,799 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:51:39,799 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:51:39,810 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 12:51:39,810 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:51:39,810 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-12-07 12:51:39,882 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 15 treesize of output 11 [2019-12-07 12:51:39,882 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:51:39,885 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:51:39,885 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:51:39,885 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 12:51:40,051 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 24 treesize of output 18 [2019-12-07 12:51:40,052 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 12:51:40,059 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:51:40,060 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 12:51:40,060 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:35 [2019-12-07 12:51:40,137 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:51:40,146 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:51:40,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2019-12-07 12:51:40,147 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:51:40,156 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 12:51:40,156 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:51:40,156 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:39, output treesize:3 [2019-12-07 12:51:40,183 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 12:51:40,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:51:40,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2019-12-07 12:51:40,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794478748] [2019-12-07 12:51:40,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 12:51:40,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:40,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 12:51:40,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2019-12-07 12:51:40,184 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 32 states. [2019-12-07 12:51:41,554 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-12-07 12:51:42,615 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-12-07 12:51:42,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:42,872 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2019-12-07 12:51:42,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 12:51:42,873 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 55 [2019-12-07 12:51:42,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:42,874 INFO L225 Difference]: With dead ends: 96 [2019-12-07 12:51:42,874 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 12:51:42,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=524, Invalid=3636, Unknown=0, NotChecked=0, Total=4160 [2019-12-07 12:51:42,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 12:51:42,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2019-12-07 12:51:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 12:51:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-12-07 12:51:42,880 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 55 [2019-12-07 12:51:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:42,880 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-12-07 12:51:42,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 12:51:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-12-07 12:51:42,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 12:51:42,881 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:42,881 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:43,081 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:43,082 INFO L410 AbstractCegarLoop]: === Iteration 33 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:51:43,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:43,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1240269832, now seen corresponding path program 3 times [2019-12-07 12:51:43,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:43,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674998930] [2019-12-07 12:51:43,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 8 proven. 34 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 12:51:43,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674998930] [2019-12-07 12:51:43,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579020824] [2019-12-07 12:51:43,224 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:43,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 12:51:43,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:51:43,315 INFO L264 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 12:51:43,316 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:51:43,326 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:51:43,326 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:51:43,327 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:51:43,337 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 12:51:43,338 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 12:51:43,338 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 12:51:43,522 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 12:51:43,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:51:43,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2019-12-07 12:51:43,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455582750] [2019-12-07 12:51:43,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 12:51:43,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:43,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 12:51:43,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2019-12-07 12:51:43,523 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 28 states. [2019-12-07 12:51:44,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:44,462 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-12-07 12:51:44,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 12:51:44,463 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2019-12-07 12:51:44,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:44,464 INFO L225 Difference]: With dead ends: 70 [2019-12-07 12:51:44,464 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 12:51:44,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=1219, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 12:51:44,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 12:51:44,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-12-07 12:51:44,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 12:51:44,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-12-07 12:51:44,467 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 61 [2019-12-07 12:51:44,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:44,468 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-12-07 12:51:44,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 12:51:44,468 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-12-07 12:51:44,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 12:51:44,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:44,469 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:44,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:44,670 INFO L410 AbstractCegarLoop]: === Iteration 34 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:51:44,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:44,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1003947369, now seen corresponding path program 5 times [2019-12-07 12:51:44,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:44,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815214850] [2019-12-07 12:51:44,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:44,981 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 12:51:44,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815214850] [2019-12-07 12:51:44,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759338245] [2019-12-07 12:51:44,981 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:45,063 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-07 12:51:45,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:51:45,066 INFO L264 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 97 conjunts are in the unsatisfiable core [2019-12-07 12:51:45,067 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:51:45,190 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 14 treesize of output 10 [2019-12-07 12:51:45,190 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:51:45,195 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:51:45,195 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:51:45,195 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-12-07 12:51:45,736 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:51:45,736 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 48 [2019-12-07 12:51:45,737 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:51:45,745 INFO L614 ElimStorePlain]: treesize reduction 23, result has 30.3 percent of original size [2019-12-07 12:51:45,745 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:51:45,745 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:3 [2019-12-07 12:51:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 12:51:45,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:51:45,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 39 [2019-12-07 12:51:45,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145569261] [2019-12-07 12:51:45,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-07 12:51:45,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:45,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-07 12:51:45,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1381, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 12:51:45,757 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 39 states. [2019-12-07 12:51:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:48,711 INFO L93 Difference]: Finished difference Result 188 states and 192 transitions. [2019-12-07 12:51:48,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-07 12:51:48,711 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 65 [2019-12-07 12:51:48,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:48,712 INFO L225 Difference]: With dead ends: 188 [2019-12-07 12:51:48,712 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 12:51:48,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1869 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=578, Invalid=7254, Unknown=0, NotChecked=0, Total=7832 [2019-12-07 12:51:48,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 12:51:48,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2019-12-07 12:51:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 12:51:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-12-07 12:51:48,715 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 65 [2019-12-07 12:51:48,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:48,715 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-12-07 12:51:48,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-07 12:51:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-12-07 12:51:48,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 12:51:48,716 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:48,716 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:48,916 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:48,917 INFO L410 AbstractCegarLoop]: === Iteration 35 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:51:48,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:48,917 INFO L82 PathProgramCache]: Analyzing trace with hash -61793443, now seen corresponding path program 6 times [2019-12-07 12:51:48,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:48,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324619482] [2019-12-07 12:51:48,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 17 proven. 51 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 12:51:49,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324619482] [2019-12-07 12:51:49,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541460860] [2019-12-07 12:51:49,089 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:49,209 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-07 12:51:49,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:51:49,211 INFO L264 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 12:51:49,212 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:51:49,215 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_29|], 1=[|v_#valid_35|]} [2019-12-07 12:51:49,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:51:49,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:51:49,218 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:51:49,224 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:51:49,227 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 10 treesize of output 8 [2019-12-07 12:51:49,227 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:51:49,233 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:51:49,233 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:51:49,233 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 12:51:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 15 proven. 53 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 12:51:49,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:51:49,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 29 [2019-12-07 12:51:49,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509300852] [2019-12-07 12:51:49,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 12:51:49,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:49,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 12:51:49,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2019-12-07 12:51:49,430 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 30 states. [2019-12-07 12:51:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:49,975 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-12-07 12:51:49,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 12:51:49,976 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 73 [2019-12-07 12:51:49,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:49,976 INFO L225 Difference]: With dead ends: 85 [2019-12-07 12:51:49,976 INFO L226 Difference]: Without dead ends: 85 [2019-12-07 12:51:49,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=1680, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 12:51:49,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-07 12:51:49,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2019-12-07 12:51:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 12:51:49,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2019-12-07 12:51:49,978 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 73 [2019-12-07 12:51:49,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:49,979 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2019-12-07 12:51:49,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 12:51:49,979 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2019-12-07 12:51:49,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 12:51:49,979 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:49,979 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:50,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:50,180 INFO L410 AbstractCegarLoop]: === Iteration 36 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:51:50,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:50,180 INFO L82 PathProgramCache]: Analyzing trace with hash 746041886, now seen corresponding path program 4 times [2019-12-07 12:51:50,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:50,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504449089] [2019-12-07 12:51:50,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 59 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 12:51:50,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504449089] [2019-12-07 12:51:50,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020511131] [2019-12-07 12:51:50,383 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:50,456 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 12:51:50,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:51:50,458 INFO L264 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 97 conjunts are in the unsatisfiable core [2019-12-07 12:51:50,459 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:51:50,472 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:51:50,473 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:51:50,473 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:51:50,484 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 12:51:50,484 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:51:50,484 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-12-07 12:51:50,510 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 16 treesize of output 12 [2019-12-07 12:51:50,510 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:51:50,514 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:51:50,514 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:51:50,515 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 12:51:50,816 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:51:50,817 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 54 [2019-12-07 12:51:50,817 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:51:50,827 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:51:50,828 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 12:51:50,828 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:26 [2019-12-07 12:51:50,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:51:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 18 proven. 58 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 12:51:50,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:51:50,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 32 [2019-12-07 12:51:50,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365912445] [2019-12-07 12:51:50,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 12:51:50,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:50,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 12:51:50,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=974, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 12:51:50,935 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 33 states. [2019-12-07 12:51:52,077 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-12-07 12:51:52,289 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-12-07 12:51:52,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:52,917 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2019-12-07 12:51:52,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 12:51:52,918 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 75 [2019-12-07 12:51:52,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:52,920 INFO L225 Difference]: With dead ends: 84 [2019-12-07 12:51:52,920 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 12:51:52,921 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=234, Invalid=2118, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 12:51:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 12:51:52,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-12-07 12:51:52,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 12:51:52,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2019-12-07 12:51:52,924 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 75 [2019-12-07 12:51:52,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:52,925 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2019-12-07 12:51:52,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 12:51:52,925 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2019-12-07 12:51:52,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 12:51:52,925 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:52,926 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:53,126 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:53,126 INFO L410 AbstractCegarLoop]: === Iteration 37 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:51:53,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:53,127 INFO L82 PathProgramCache]: Analyzing trace with hash -421352019, now seen corresponding path program 7 times [2019-12-07 12:51:53,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:53,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776880121] [2019-12-07 12:51:53,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:53,911 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-12-07 12:51:54,106 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-12-07 12:51:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 5 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:55,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776880121] [2019-12-07 12:51:55,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882428179] [2019-12-07 12:51:55,610 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:51:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:55,685 INFO L264 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 107 conjunts are in the unsatisfiable core [2019-12-07 12:51:55,686 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:51:55,931 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 14 treesize of output 10 [2019-12-07 12:51:55,931 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:51:55,936 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:51:55,936 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:51:55,936 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-12-07 12:51:56,791 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:51:56,800 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:51:56,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 40 [2019-12-07 12:51:56,801 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:51:56,815 INFO L614 ElimStorePlain]: treesize reduction 27, result has 43.8 percent of original size [2019-12-07 12:51:56,815 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:51:56,815 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:46, output treesize:3 [2019-12-07 12:51:56,834 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 5 proven. 88 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 12:51:56,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:51:56,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 23] total 52 [2019-12-07 12:51:56,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577532376] [2019-12-07 12:51:56,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-12-07 12:51:56,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:56,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-12-07 12:51:56,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2494, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 12:51:56,835 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 52 states. [2019-12-07 12:52:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:01,816 INFO L93 Difference]: Finished difference Result 193 states and 198 transitions. [2019-12-07 12:52:01,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-07 12:52:01,817 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 79 [2019-12-07 12:52:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:01,817 INFO L225 Difference]: With dead ends: 193 [2019-12-07 12:52:01,817 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 12:52:01,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=508, Invalid=7324, Unknown=0, NotChecked=0, Total=7832 [2019-12-07 12:52:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 12:52:01,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 87. [2019-12-07 12:52:01,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 12:52:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2019-12-07 12:52:01,821 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 79 [2019-12-07 12:52:01,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:01,821 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2019-12-07 12:52:01,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-12-07 12:52:01,821 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2019-12-07 12:52:01,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 12:52:01,822 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:01,822 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:02,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:02,023 INFO L410 AbstractCegarLoop]: === Iteration 38 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:52:02,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:02,023 INFO L82 PathProgramCache]: Analyzing trace with hash 890985264, now seen corresponding path program 8 times [2019-12-07 12:52:02,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:52:02,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359102563] [2019-12-07 12:52:02,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:02,501 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 5 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:52:02,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359102563] [2019-12-07 12:52:02,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934970291] [2019-12-07 12:52:02,502 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:02,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:52:02,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:52:02,579 INFO L264 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 66 conjunts are in the unsatisfiable core [2019-12-07 12:52:02,580 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:52:02,584 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 10 treesize of output 8 [2019-12-07 12:52:02,584 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:52:02,588 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:02,588 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:52:02,588 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 12:52:02,746 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 14 treesize of output 10 [2019-12-07 12:52:02,746 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:52:02,752 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:02,752 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:52:02,752 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-12-07 12:52:02,788 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 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-07 12:52:02,788 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:52:02,796 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:02,797 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 12:52:02,797 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2019-12-07 12:52:03,334 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:52:03,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 12:52:03,335 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:52:03,342 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:03,342 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:52:03,343 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:49, output treesize:3 [2019-12-07 12:52:03,375 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 5 proven. 88 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 12:52:03,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:52:03,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 42 [2019-12-07 12:52:03,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456623439] [2019-12-07 12:52:03,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-07 12:52:03,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:52:03,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-07 12:52:03,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1614, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 12:52:03,376 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 42 states. [2019-12-07 12:52:06,074 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-12-07 12:52:07,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:07,270 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2019-12-07 12:52:07,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 12:52:07,270 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 83 [2019-12-07 12:52:07,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:07,271 INFO L225 Difference]: With dead ends: 153 [2019-12-07 12:52:07,271 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 12:52:07,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=256, Invalid=3284, Unknown=0, NotChecked=0, Total=3540 [2019-12-07 12:52:07,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 12:52:07,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-12-07 12:52:07,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 12:52:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2019-12-07 12:52:07,274 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 83 [2019-12-07 12:52:07,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:07,274 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2019-12-07 12:52:07,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-07 12:52:07,274 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2019-12-07 12:52:07,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 12:52:07,274 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:07,274 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:07,474 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:07,475 INFO L410 AbstractCegarLoop]: === Iteration 39 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:52:07,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:07,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1560452083, now seen corresponding path program 9 times [2019-12-07 12:52:07,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:52:07,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794721298] [2019-12-07 12:52:07,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 30 proven. 80 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 12:52:07,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794721298] [2019-12-07 12:52:07,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565496368] [2019-12-07 12:52:07,667 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:07,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 12:52:07,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:52:07,824 INFO L264 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 48 conjunts are in the unsatisfiable core [2019-12-07 12:52:07,825 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:52:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 28 proven. 82 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 12:52:07,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:52:07,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 29 [2019-12-07 12:52:07,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559422170] [2019-12-07 12:52:07,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 12:52:07,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:52:07,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 12:52:07,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2019-12-07 12:52:07,950 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand 30 states. [2019-12-07 12:52:08,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:08,570 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2019-12-07 12:52:08,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 12:52:08,570 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 87 [2019-12-07 12:52:08,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:08,571 INFO L225 Difference]: With dead ends: 99 [2019-12-07 12:52:08,571 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 12:52:08,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=307, Invalid=1585, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 12:52:08,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 12:52:08,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2019-12-07 12:52:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 12:52:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2019-12-07 12:52:08,573 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 87 [2019-12-07 12:52:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:08,573 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2019-12-07 12:52:08,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 12:52:08,573 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2019-12-07 12:52:08,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 12:52:08,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:08,574 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:08,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:08,775 INFO L410 AbstractCegarLoop]: === Iteration 40 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:52:08,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:08,775 INFO L82 PathProgramCache]: Analyzing trace with hash 650863924, now seen corresponding path program 5 times [2019-12-07 12:52:08,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:52:08,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580379219] [2019-12-07 12:52:08,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 12:52:09,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580379219] [2019-12-07 12:52:09,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714598190] [2019-12-07 12:52:09,007 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:09,116 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-12-07 12:52:09,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:52:09,118 INFO L264 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 66 conjunts are in the unsatisfiable core [2019-12-07 12:52:09,119 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:52:09,128 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:09,128 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:52:09,129 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:52:09,139 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 12:52:09,139 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 12:52:09,139 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 12:52:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 28 proven. 92 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 12:52:09,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:52:09,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 25 [2019-12-07 12:52:09,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63924302] [2019-12-07 12:52:09,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 12:52:09,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:52:09,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 12:52:09,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2019-12-07 12:52:09,250 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 26 states. [2019-12-07 12:52:09,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:09,985 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2019-12-07 12:52:09,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 12:52:09,985 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 89 [2019-12-07 12:52:09,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:09,986 INFO L225 Difference]: With dead ends: 98 [2019-12-07 12:52:09,986 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 12:52:09,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 12:52:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 12:52:09,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-12-07 12:52:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 12:52:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2019-12-07 12:52:09,988 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 89 [2019-12-07 12:52:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:09,988 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2019-12-07 12:52:09,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 12:52:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2019-12-07 12:52:09,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 12:52:09,988 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:09,989 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:10,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:10,189 INFO L410 AbstractCegarLoop]: === Iteration 41 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:52:10,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:10,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1532683715, now seen corresponding path program 10 times [2019-12-07 12:52:10,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:52:10,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553917490] [2019-12-07 12:52:10,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 6 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:52:11,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553917490] [2019-12-07 12:52:11,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512347721] [2019-12-07 12:52:11,466 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:11,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 12:52:11,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:52:11,548 INFO L264 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 110 conjunts are in the unsatisfiable core [2019-12-07 12:52:11,549 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:52:11,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:11,558 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:52:11,558 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:52:11,568 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 12:52:11,569 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:52:11,569 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-12-07 12:52:11,861 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 15 treesize of output 11 [2019-12-07 12:52:11,862 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:52:11,865 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:11,865 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:52:11,865 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 12:52:12,347 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 24 treesize of output 18 [2019-12-07 12:52:12,347 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 12:52:12,355 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:12,355 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 12:52:12,355 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:35 [2019-12-07 12:52:12,529 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:52:12,538 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:12,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2019-12-07 12:52:12,539 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:52:12,543 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:12,543 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:52:12,544 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:39, output treesize:3 [2019-12-07 12:52:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 72 proven. 69 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 12:52:12,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:52:12,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 24] total 55 [2019-12-07 12:52:12,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968307770] [2019-12-07 12:52:12,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-12-07 12:52:12,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:52:12,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-12-07 12:52:12,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2802, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 12:52:12,567 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 55 states. [2019-12-07 12:52:14,139 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-12-07 12:52:15,256 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-07 12:52:19,390 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-12-07 12:52:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:19,829 INFO L93 Difference]: Finished difference Result 223 states and 228 transitions. [2019-12-07 12:52:19,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-12-07 12:52:19,831 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 93 [2019-12-07 12:52:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:19,832 INFO L225 Difference]: With dead ends: 223 [2019-12-07 12:52:19,832 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 12:52:19,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2467 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=968, Invalid=10804, Unknown=0, NotChecked=0, Total=11772 [2019-12-07 12:52:19,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 12:52:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101. [2019-12-07 12:52:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 12:52:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2019-12-07 12:52:19,837 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 93 [2019-12-07 12:52:19,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:19,838 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2019-12-07 12:52:19,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-12-07 12:52:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2019-12-07 12:52:19,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 12:52:19,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:19,839 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:20,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:20,040 INFO L410 AbstractCegarLoop]: === Iteration 42 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:52:20,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:20,040 INFO L82 PathProgramCache]: Analyzing trace with hash 312201734, now seen corresponding path program 11 times [2019-12-07 12:52:20,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:52:20,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52789915] [2019-12-07 12:52:20,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 6 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:52:20,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52789915] [2019-12-07 12:52:20,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800077156] [2019-12-07 12:52:20,585 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:20,711 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-12-07 12:52:20,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:52:20,714 INFO L264 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 107 conjunts are in the unsatisfiable core [2019-12-07 12:52:20,715 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:52:20,717 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_33|], 1=[|v_#valid_37|]} [2019-12-07 12:52:20,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:52:20,721 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:52:20,721 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:52:20,729 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:20,731 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 10 treesize of output 8 [2019-12-07 12:52:20,731 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:52:20,738 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:20,738 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:52:20,738 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:24 [2019-12-07 12:52:20,930 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 16 treesize of output 12 [2019-12-07 12:52:20,931 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:52:20,937 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:20,938 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:52:20,938 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-12-07 12:52:20,980 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 0 case distinctions, treesize of input 29 treesize of output 28 [2019-12-07 12:52:20,980 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:52:20,987 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:20,988 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:52:20,988 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-12-07 12:52:22,200 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:22,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2019-12-07 12:52:22,201 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 12:52:22,217 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:22,217 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 12:52:22,218 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:23 [2019-12-07 12:52:22,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 28 proven. 113 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 12:52:22,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:52:22,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24] total 51 [2019-12-07 12:52:22,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070826181] [2019-12-07 12:52:22,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-12-07 12:52:22,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:52:22,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-12-07 12:52:22,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=2431, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 12:52:22,592 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 51 states. [2019-12-07 12:52:26,554 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-12-07 12:52:26,948 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-12-07 12:52:28,660 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-12-07 12:52:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:30,458 INFO L93 Difference]: Finished difference Result 185 states and 189 transitions. [2019-12-07 12:52:30,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-07 12:52:30,459 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 97 [2019-12-07 12:52:30,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:30,460 INFO L225 Difference]: With dead ends: 185 [2019-12-07 12:52:30,460 INFO L226 Difference]: Without dead ends: 116 [2019-12-07 12:52:30,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=582, Invalid=9318, Unknown=0, NotChecked=0, Total=9900 [2019-12-07 12:52:30,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-12-07 12:52:30,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-12-07 12:52:30,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 12:52:30,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 112 transitions. [2019-12-07 12:52:30,465 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 112 transitions. Word has length 97 [2019-12-07 12:52:30,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:30,465 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 112 transitions. [2019-12-07 12:52:30,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-12-07 12:52:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2019-12-07 12:52:30,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 12:52:30,466 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:30,466 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:30,667 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:30,667 INFO L410 AbstractCegarLoop]: === Iteration 43 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:52:30,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:30,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1035648330, now seen corresponding path program 6 times [2019-12-07 12:52:30,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:52:30,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110831148] [2019-12-07 12:52:30,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 47 proven. 127 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 12:52:30,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110831148] [2019-12-07 12:52:30,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480764508] [2019-12-07 12:52:30,916 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:31,161 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-12-07 12:52:31,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:52:31,164 INFO L264 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 61 conjunts are in the unsatisfiable core [2019-12-07 12:52:31,165 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:52:31,174 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:31,175 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:52:31,175 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:52:31,186 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 12:52:31,186 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 12:52:31,186 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 12:52:31,528 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 45 proven. 129 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 12:52:31,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:52:31,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2019-12-07 12:52:31,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823165575] [2019-12-07 12:52:31,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 12:52:31,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:52:31,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 12:52:31,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1385, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 12:52:31,530 INFO L87 Difference]: Start difference. First operand 109 states and 112 transitions. Second operand 40 states. [2019-12-07 12:52:33,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:33,699 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-12-07 12:52:33,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 12:52:33,700 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 103 [2019-12-07 12:52:33,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:33,702 INFO L225 Difference]: With dead ends: 112 [2019-12-07 12:52:33,702 INFO L226 Difference]: Without dead ends: 112 [2019-12-07 12:52:33,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=364, Invalid=2716, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 12:52:33,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-07 12:52:33,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-12-07 12:52:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 12:52:33,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2019-12-07 12:52:33,709 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 103 [2019-12-07 12:52:33,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:33,709 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2019-12-07 12:52:33,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 12:52:33,710 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2019-12-07 12:52:33,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-07 12:52:33,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:33,711 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:33,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:33,912 INFO L410 AbstractCegarLoop]: === Iteration 44 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:52:33,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:33,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1007960793, now seen corresponding path program 12 times [2019-12-07 12:52:33,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:52:33,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969611152] [2019-12-07 12:52:33,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 7 proven. 258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:52:35,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969611152] [2019-12-07 12:52:35,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219666574] [2019-12-07 12:52:35,696 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:36,071 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-07 12:52:36,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:52:36,073 INFO L264 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 52 conjunts are in the unsatisfiable core [2019-12-07 12:52:36,075 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:52:36,077 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_35|], 1=[|v_#valid_38|]} [2019-12-07 12:52:36,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:52:36,079 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:52:36,080 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:52:36,085 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:36,087 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 10 treesize of output 8 [2019-12-07 12:52:36,088 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:52:36,092 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:36,092 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:52:36,093 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-12-07 12:52:36,141 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 16 treesize of output 12 [2019-12-07 12:52:36,141 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:52:36,147 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:36,147 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:52:36,148 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-12-07 12:52:36,213 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 0 case distinctions, treesize of input 29 treesize of output 28 [2019-12-07 12:52:36,213 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:52:36,219 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:36,220 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 12:52:36,220 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2019-12-07 12:52:36,586 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:36,586 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2019-12-07 12:52:36,587 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 12:52:36,595 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:52:36,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:36,596 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:52:36,596 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:27 [2019-12-07 12:52:36,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:36,767 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-12-07 12:52:36,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:52:36,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 9] total 46 [2019-12-07 12:52:36,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529026612] [2019-12-07 12:52:36,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-12-07 12:52:36,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:52:36,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-12-07 12:52:36,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1962, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 12:52:36,768 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand 46 states. [2019-12-07 12:52:40,261 WARN L192 SmtUtils]: Spent 465.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 12:52:44,248 WARN L192 SmtUtils]: Spent 3.89 s on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-12-07 12:52:50,487 WARN L192 SmtUtils]: Spent 4.51 s on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-12-07 12:52:56,646 WARN L192 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-12-07 12:53:01,756 WARN L192 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-12-07 12:53:08,046 WARN L192 SmtUtils]: Spent 4.99 s on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-12-07 12:53:12,354 WARN L192 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 67 [2019-12-07 12:53:19,290 WARN L192 SmtUtils]: Spent 4.52 s on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-12-07 12:53:24,296 WARN L192 SmtUtils]: Spent 4.91 s on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-12-07 12:53:28,478 WARN L192 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 67 [2019-12-07 12:53:33,478 WARN L192 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-12-07 12:53:39,144 WARN L192 SmtUtils]: Spent 5.57 s on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-12-07 12:53:43,366 WARN L192 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-12-07 12:53:47,524 WARN L192 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 69 [2019-12-07 12:53:52,561 WARN L192 SmtUtils]: Spent 4.91 s on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-12-07 12:53:56,764 WARN L192 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-12-07 12:54:00,976 WARN L192 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-12-07 12:54:04,422 WARN L192 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-12-07 12:54:08,620 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-12-07 12:54:14,425 WARN L192 SmtUtils]: Spent 5.69 s on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-12-07 12:54:20,572 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 12:54:26,592 WARN L192 SmtUtils]: Spent 5.90 s on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-12-07 12:54:30,741 WARN L192 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-12-07 12:54:34,883 WARN L192 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-12-07 12:54:40,929 WARN L192 SmtUtils]: Spent 5.94 s on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-07 12:54:45,426 WARN L192 SmtUtils]: Spent 4.40 s on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-12-07 12:54:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:45,452 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-12-07 12:54:45,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-07 12:54:45,453 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 107 [2019-12-07 12:54:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:45,454 INFO L225 Difference]: With dead ends: 199 [2019-12-07 12:54:45,454 INFO L226 Difference]: Without dead ends: 153 [2019-12-07 12:54:45,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1805 ImplicationChecksByTransitivity, 123.9s TimeCoverageRelationStatistics Valid=715, Invalid=9384, Unknown=1, NotChecked=0, Total=10100 [2019-12-07 12:54:45,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-12-07 12:54:45,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2019-12-07 12:54:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-07 12:54:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2019-12-07 12:54:45,457 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 107 [2019-12-07 12:54:45,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:45,457 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2019-12-07 12:54:45,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-12-07 12:54:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2019-12-07 12:54:45,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 12:54:45,457 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:45,458 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:45,658 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:45,658 INFO L410 AbstractCegarLoop]: === Iteration 45 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:54:45,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:45,659 INFO L82 PathProgramCache]: Analyzing trace with hash -98177635, now seen corresponding path program 7 times [2019-12-07 12:54:45,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:45,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904447669] [2019-12-07 12:54:45,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 21 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:54:46,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904447669] [2019-12-07 12:54:46,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033630115] [2019-12-07 12:54:46,610 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:46,703 INFO L264 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 143 conjunts are in the unsatisfiable core [2019-12-07 12:54:46,705 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:54:46,950 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 14 treesize of output 10 [2019-12-07 12:54:46,950 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:46,957 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:46,957 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:54:46,958 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-12-07 12:54:47,587 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 12:54:47,588 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:47,590 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:47,590 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 12:54:47,591 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 12:54:47,619 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 21 proven. 192 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 12:54:47,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:54:47,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 25] total 49 [2019-12-07 12:54:47,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959872656] [2019-12-07 12:54:47,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-12-07 12:54:47,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:47,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-12-07 12:54:47,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2219, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 12:54:47,620 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 49 states. [2019-12-07 12:54:48,832 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 25 [2019-12-07 12:54:49,094 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2019-12-07 12:54:51,302 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-12-07 12:54:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:53,476 INFO L93 Difference]: Finished difference Result 206 states and 211 transitions. [2019-12-07 12:54:53,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-07 12:54:53,477 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 113 [2019-12-07 12:54:53,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:53,479 INFO L225 Difference]: With dead ends: 206 [2019-12-07 12:54:53,479 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 12:54:53,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1782 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=508, Invalid=8234, Unknown=0, NotChecked=0, Total=8742 [2019-12-07 12:54:53,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 12:54:53,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 114. [2019-12-07 12:54:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 12:54:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2019-12-07 12:54:53,486 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 113 [2019-12-07 12:54:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:53,486 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2019-12-07 12:54:53,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-12-07 12:54:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2019-12-07 12:54:53,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 12:54:53,488 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:53,488 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:53,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:53,689 INFO L410 AbstractCegarLoop]: === Iteration 46 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:54:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:53,690 INFO L82 PathProgramCache]: Analyzing trace with hash -319778595, now seen corresponding path program 8 times [2019-12-07 12:54:53,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:53,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756943996] [2019-12-07 12:54:53,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 68 proven. 170 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 12:54:53,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756943996] [2019-12-07 12:54:53,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708127736] [2019-12-07 12:54:53,972 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:54,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:54:54,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:54:54,056 INFO L264 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 80 conjunts are in the unsatisfiable core [2019-12-07 12:54:54,057 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:54:54,068 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:54,068 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:54:54,068 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:54,079 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 12:54:54,079 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 12:54:54,079 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 12:54:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 66 proven. 172 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 12:54:54,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:54:54,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 43 [2019-12-07 12:54:54,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125289548] [2019-12-07 12:54:54,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-12-07 12:54:54,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:54,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-12-07 12:54:54,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1699, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 12:54:54,506 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand 44 states. [2019-12-07 12:54:56,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:56,422 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-12-07 12:54:56,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 12:54:56,423 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 113 [2019-12-07 12:54:56,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:56,424 INFO L225 Difference]: With dead ends: 121 [2019-12-07 12:54:56,424 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 12:54:56,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=302, Invalid=2778, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 12:54:56,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 12:54:56,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-12-07 12:54:56,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-07 12:54:56,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 123 transitions. [2019-12-07 12:54:56,428 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 123 transitions. Word has length 113 [2019-12-07 12:54:56,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:56,428 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 123 transitions. [2019-12-07 12:54:56,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-12-07 12:54:56,428 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2019-12-07 12:54:56,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 12:54:56,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:56,429 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:56,629 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:56,629 INFO L410 AbstractCegarLoop]: === Iteration 47 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:54:56,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:56,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1586398189, now seen corresponding path program 9 times [2019-12-07 12:54:56,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:56,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534654370] [2019-12-07 12:54:56,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 156 proven. 102 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 12:54:56,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534654370] [2019-12-07 12:54:56,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508711561] [2019-12-07 12:54:56,913 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:57,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-07 12:54:57,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:54:57,317 INFO L264 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 64 conjunts are in the unsatisfiable core [2019-12-07 12:54:57,319 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:54:57,321 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_37|], 1=[|v_#valid_39|]} [2019-12-07 12:54:57,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:57,324 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:54:57,324 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:57,330 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:57,333 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 10 treesize of output 8 [2019-12-07 12:54:57,333 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:57,339 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:57,339 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:57,340 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 12:54:57,698 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 190 proven. 66 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-07 12:54:57,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:54:57,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 41 [2019-12-07 12:54:57,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071460] [2019-12-07 12:54:57,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-07 12:54:57,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:57,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-07 12:54:57,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1393, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 12:54:57,699 INFO L87 Difference]: Start difference. First operand 120 states and 123 transitions. Second operand 41 states. [2019-12-07 12:54:58,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:58,244 INFO L93 Difference]: Finished difference Result 204 states and 208 transitions. [2019-12-07 12:54:58,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 12:54:58,244 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 119 [2019-12-07 12:54:58,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:58,245 INFO L225 Difference]: With dead ends: 204 [2019-12-07 12:54:58,245 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 12:54:58,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=404, Invalid=2248, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 12:54:58,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 12:54:58,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2019-12-07 12:54:58,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-12-07 12:54:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 127 transitions. [2019-12-07 12:54:58,247 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 127 transitions. Word has length 119 [2019-12-07 12:54:58,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:58,247 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 127 transitions. [2019-12-07 12:54:58,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-07 12:54:58,247 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2019-12-07 12:54:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 12:54:58,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:58,247 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:58,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:58,448 INFO L410 AbstractCegarLoop]: === Iteration 48 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:54:58,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:58,448 INFO L82 PathProgramCache]: Analyzing trace with hash -861151440, now seen corresponding path program 10 times [2019-12-07 12:54:58,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:58,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206754078] [2019-12-07 12:54:58,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 156 proven. 127 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 12:54:58,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206754078] [2019-12-07 12:54:58,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707534158] [2019-12-07 12:54:58,712 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:58,803 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 12:54:58,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:54:58,805 INFO L264 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 69 conjunts are in the unsatisfiable core [2019-12-07 12:54:58,806 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:54:58,808 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_38|], 1=[|v_#valid_40|]} [2019-12-07 12:54:58,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:58,817 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:54:58,818 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:58,823 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:58,825 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 10 treesize of output 8 [2019-12-07 12:54:58,826 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:58,831 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:58,831 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:58,831 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-12-07 12:54:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 185 proven. 98 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 12:54:59,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:54:59,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 44 [2019-12-07 12:54:59,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346208753] [2019-12-07 12:54:59,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-12-07 12:54:59,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:59,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-12-07 12:54:59,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1608, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 12:54:59,248 INFO L87 Difference]: Start difference. First operand 124 states and 127 transitions. Second operand 44 states. [2019-12-07 12:55:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:00,729 INFO L93 Difference]: Finished difference Result 214 states and 218 transitions. [2019-12-07 12:55:00,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 12:55:00,729 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 123 [2019-12-07 12:55:00,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:00,730 INFO L225 Difference]: With dead ends: 214 [2019-12-07 12:55:00,730 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 12:55:00,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=654, Invalid=3252, Unknown=0, NotChecked=0, Total=3906 [2019-12-07 12:55:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 12:55:00,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-12-07 12:55:00,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-07 12:55:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 131 transitions. [2019-12-07 12:55:00,732 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 131 transitions. Word has length 123 [2019-12-07 12:55:00,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:00,733 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 131 transitions. [2019-12-07 12:55:00,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-12-07 12:55:00,733 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 131 transitions. [2019-12-07 12:55:00,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-07 12:55:00,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:00,733 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:00,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:55:00,934 INFO L410 AbstractCegarLoop]: === Iteration 49 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:55:00,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:00,935 INFO L82 PathProgramCache]: Analyzing trace with hash -363601677, now seen corresponding path program 11 times [2019-12-07 12:55:00,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:00,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057754698] [2019-12-07 12:55:00,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 24 proven. 379 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:55:02,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057754698] [2019-12-07 12:55:02,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326012040] [2019-12-07 12:55:02,066 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:55:02,362 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-12-07 12:55:02,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:55:02,366 INFO L264 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 169 conjunts are in the unsatisfiable core [2019-12-07 12:55:02,368 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:55:02,756 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 14 treesize of output 10 [2019-12-07 12:55:02,756 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:02,760 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:02,760 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:55:02,761 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-12-07 12:55:05,153 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:05,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 48 [2019-12-07 12:55:05,154 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:05,162 INFO L614 ElimStorePlain]: treesize reduction 23, result has 30.3 percent of original size [2019-12-07 12:55:05,163 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:55:05,163 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:3 [2019-12-07 12:55:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 24 proven. 259 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-12-07 12:55:05,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:55:05,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 35] total 71 [2019-12-07 12:55:05,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402993911] [2019-12-07 12:55:05,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-12-07 12:55:05,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:05,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-12-07 12:55:05,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=4748, Unknown=0, NotChecked=0, Total=4970 [2019-12-07 12:55:05,204 INFO L87 Difference]: Start difference. First operand 128 states and 131 transitions. Second operand 71 states. [2019-12-07 12:55:09,729 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-12-07 12:55:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:13,291 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2019-12-07 12:55:13,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-07 12:55:13,292 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 127 [2019-12-07 12:55:13,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:13,294 INFO L225 Difference]: With dead ends: 190 [2019-12-07 12:55:13,294 INFO L226 Difference]: Without dead ends: 138 [2019-12-07 12:55:13,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2411 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=517, Invalid=10403, Unknown=0, NotChecked=0, Total=10920 [2019-12-07 12:55:13,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-12-07 12:55:13,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2019-12-07 12:55:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-12-07 12:55:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2019-12-07 12:55:13,299 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 127 [2019-12-07 12:55:13,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:13,299 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2019-12-07 12:55:13,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-12-07 12:55:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2019-12-07 12:55:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-07 12:55:13,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:13,301 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:13,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:55:13,501 INFO L410 AbstractCegarLoop]: === Iteration 50 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:55:13,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:13,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1645665398, now seen corresponding path program 12 times [2019-12-07 12:55:13,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:13,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558898228] [2019-12-07 12:55:13,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 93 proven. 219 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-12-07 12:55:13,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558898228] [2019-12-07 12:55:13,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342824634] [2019-12-07 12:55:13,838 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:55:14,745 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-12-07 12:55:14,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:55:14,749 INFO L264 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 75 conjunts are in the unsatisfiable core [2019-12-07 12:55:14,751 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:55:14,760 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:14,760 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:55:14,760 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:14,770 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 12:55:14,770 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 12:55:14,771 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 12:55:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 91 proven. 221 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-12-07 12:55:15,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:55:15,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 47 [2019-12-07 12:55:15,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439755072] [2019-12-07 12:55:15,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-12-07 12:55:15,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:15,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-12-07 12:55:15,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2003, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 12:55:15,267 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 48 states. [2019-12-07 12:55:17,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:17,335 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-12-07 12:55:17,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 12:55:17,336 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 131 [2019-12-07 12:55:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:17,336 INFO L225 Difference]: With dead ends: 139 [2019-12-07 12:55:17,336 INFO L226 Difference]: Without dead ends: 139 [2019-12-07 12:55:17,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=512, Invalid=4044, Unknown=0, NotChecked=0, Total=4556 [2019-12-07 12:55:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-12-07 12:55:17,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-12-07 12:55:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-12-07 12:55:17,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 141 transitions. [2019-12-07 12:55:17,338 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 141 transitions. Word has length 131 [2019-12-07 12:55:17,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:17,339 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 141 transitions. [2019-12-07 12:55:17,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-12-07 12:55:17,339 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 141 transitions. [2019-12-07 12:55:17,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-12-07 12:55:17,339 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:17,339 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:17,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:55:17,540 INFO L410 AbstractCegarLoop]: === Iteration 51 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:55:17,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:17,540 INFO L82 PathProgramCache]: Analyzing trace with hash -265684794, now seen corresponding path program 13 times [2019-12-07 12:55:17,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:17,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762566339] [2019-12-07 12:55:17,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 202 proven. 161 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-12-07 12:55:17,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762566339] [2019-12-07 12:55:17,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561815867] [2019-12-07 12:55:17,902 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:55:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:17,998 INFO L264 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 76 conjunts are in the unsatisfiable core [2019-12-07 12:55:18,000 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:55:18,001 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_40|], 1=[|v_#valid_41|]} [2019-12-07 12:55:18,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:55:18,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:55:18,004 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:18,009 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:18,011 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 10 treesize of output 8 [2019-12-07 12:55:18,011 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:18,016 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:18,016 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:55:18,016 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-12-07 12:55:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 235 proven. 128 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-12-07 12:55:18,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:55:18,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 49 [2019-12-07 12:55:18,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031184780] [2019-12-07 12:55:18,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-12-07 12:55:18,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:18,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-12-07 12:55:18,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1998, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 12:55:18,510 INFO L87 Difference]: Start difference. First operand 138 states and 141 transitions. Second operand 49 states. [2019-12-07 12:55:19,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:19,488 INFO L93 Difference]: Finished difference Result 238 states and 242 transitions. [2019-12-07 12:55:19,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 12:55:19,489 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 137 [2019-12-07 12:55:19,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:19,489 INFO L225 Difference]: With dead ends: 238 [2019-12-07 12:55:19,489 INFO L226 Difference]: Without dead ends: 145 [2019-12-07 12:55:19,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=800, Invalid=4030, Unknown=0, NotChecked=0, Total=4830 [2019-12-07 12:55:19,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-12-07 12:55:19,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2019-12-07 12:55:19,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-12-07 12:55:19,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 145 transitions. [2019-12-07 12:55:19,491 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 145 transitions. Word has length 137 [2019-12-07 12:55:19,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:19,492 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 145 transitions. [2019-12-07 12:55:19,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-12-07 12:55:19,492 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2019-12-07 12:55:19,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 12:55:19,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:19,492 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:19,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:55:19,693 INFO L410 AbstractCegarLoop]: === Iteration 52 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:55:19,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:19,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1432234313, now seen corresponding path program 14 times [2019-12-07 12:55:19,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:19,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545411230] [2019-12-07 12:55:19,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 27 proven. 489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:55:20,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545411230] [2019-12-07 12:55:20,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339394072] [2019-12-07 12:55:20,762 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:55:20,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:55:20,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:55:20,862 INFO L264 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 179 conjunts are in the unsatisfiable core [2019-12-07 12:55:20,865 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:55:21,145 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 14 treesize of output 10 [2019-12-07 12:55:21,145 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:21,149 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:21,150 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:55:21,150 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-12-07 12:55:22,557 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:22,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 52 [2019-12-07 12:55:22,558 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:22,572 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:22,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:55:22,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:55:22,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:55:22,574 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:55:22,574 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:49, output treesize:54 [2019-12-07 12:55:22,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:55:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 91 proven. 272 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-12-07 12:55:22,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:55:22,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 29] total 70 [2019-12-07 12:55:22,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161919254] [2019-12-07 12:55:22,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-12-07 12:55:22,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:22,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-12-07 12:55:22,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2019-12-07 12:55:22,851 INFO L87 Difference]: Start difference. First operand 142 states and 145 transitions. Second operand 70 states. [2019-12-07 12:55:27,721 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 19 [2019-12-07 12:55:28,415 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 32 [2019-12-07 12:55:44,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:44,643 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-12-07 12:55:44,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-07 12:55:44,643 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 141 [2019-12-07 12:55:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:44,644 INFO L225 Difference]: With dead ends: 214 [2019-12-07 12:55:44,644 INFO L226 Difference]: Without dead ends: 156 [2019-12-07 12:55:44,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3394 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=798, Invalid=15202, Unknown=2, NotChecked=0, Total=16002 [2019-12-07 12:55:44,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-12-07 12:55:44,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2019-12-07 12:55:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 12:55:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 155 transitions. [2019-12-07 12:55:44,647 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 155 transitions. Word has length 141 [2019-12-07 12:55:44,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:44,647 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 155 transitions. [2019-12-07 12:55:44,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-12-07 12:55:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 155 transitions. [2019-12-07 12:55:44,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 12:55:44,648 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:44,648 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:44,848 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:55:44,848 INFO L410 AbstractCegarLoop]: === Iteration 53 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:55:44,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:44,849 INFO L82 PathProgramCache]: Analyzing trace with hash 679728988, now seen corresponding path program 15 times [2019-12-07 12:55:44,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:44,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010894159] [2019-12-07 12:55:44,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:45,231 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 254 proven. 199 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-12-07 12:55:45,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010894159] [2019-12-07 12:55:45,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909198441] [2019-12-07 12:55:45,231 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:55:46,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-12-07 12:55:46,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:55:46,072 INFO L264 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 75 conjunts are in the unsatisfiable core [2019-12-07 12:55:46,074 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:55:46,083 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:46,083 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:55:46,084 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:46,094 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 12:55:46,095 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 12:55:46,095 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 12:55:46,115 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 16 treesize of output 12 [2019-12-07 12:55:46,115 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:46,119 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:46,119 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:55:46,119 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-12-07 12:55:46,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:46,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 56 [2019-12-07 12:55:46,388 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:46,401 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:46,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:55:46,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:55:46,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:55:46,402 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:55:46,402 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:46 [2019-12-07 12:55:46,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:55:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 36 proven. 39 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2019-12-07 12:55:46,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:55:46,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 12] total 40 [2019-12-07 12:55:46,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346274442] [2019-12-07 12:55:46,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 12:55:46,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:46,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 12:55:46,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1374, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 12:55:46,554 INFO L87 Difference]: Start difference. First operand 152 states and 155 transitions. Second operand 40 states. [2019-12-07 12:55:49,064 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-12-07 12:55:50,224 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-12-07 12:55:53,110 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-12-07 12:55:53,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:53,713 INFO L93 Difference]: Finished difference Result 261 states and 265 transitions. [2019-12-07 12:55:53,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-12-07 12:55:53,713 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 151 [2019-12-07 12:55:53,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:53,714 INFO L225 Difference]: With dead ends: 261 [2019-12-07 12:55:53,714 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:55:53,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4252 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1964, Invalid=13786, Unknown=0, NotChecked=0, Total=15750 [2019-12-07 12:55:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:55:53,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:55:53,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:55:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:55:53,716 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 151 [2019-12-07 12:55:53,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:53,716 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:55:53,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 12:55:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:55:53,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:55:53,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:55:53,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:55:53 BoogieIcfgContainer [2019-12-07 12:55:53,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:55:53,923 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:55:53,923 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:55:53,923 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:55:53,923 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:50:47" (3/4) ... [2019-12-07 12:55:53,925 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 12:55:53,929 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 12:55:53,930 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcmp [2019-12-07 12:55:53,930 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 12:55:53,930 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 12:55:53,930 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-12-07 12:55:53,930 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-12-07 12:55:53,930 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 12:55:53,930 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-12-07 12:55:53,933 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-12-07 12:55:53,933 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 12:55:53,934 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 12:55:53,934 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 12:55:53,962 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6c40533d-5f85-42d5-83f6-2d78e3097f2d/bin/uautomizer/witness.graphml [2019-12-07 12:55:53,962 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:55:53,963 INFO L168 Benchmark]: Toolchain (without parser) took 306905.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 935.5 MB in the beginning and 859.9 MB in the end (delta: 75.5 MB). Peak memory consumption was 214.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:55:53,963 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:55:53,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:55:53,964 INFO L168 Benchmark]: Boogie Preprocessor took 36.77 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 12:55:53,964 INFO L168 Benchmark]: RCFGBuilder took 344.98 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: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:55:53,964 INFO L168 Benchmark]: TraceAbstraction took 306185.33 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 36.2 MB). Free memory was 1.0 GB in the beginning and 868.9 MB in the end (delta: 162.7 MB). Peak memory consumption was 198.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:55:53,964 INFO L168 Benchmark]: Witness Printer took 39.62 ms. Allocated memory is still 1.2 GB. Free memory was 868.9 MB in the beginning and 859.9 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:55:53,965 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 295.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.77 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 344.98 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: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 306185.33 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 36.2 MB). Free memory was 1.0 GB in the beginning and 868.9 MB in the end (delta: 162.7 MB). Peak memory consumption was 198.9 MB. Max. memory is 11.5 GB. * Witness Printer took 39.62 ms. Allocated memory is still 1.2 GB. Free memory was 868.9 MB in the beginning and 859.9 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 516]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 516]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 517]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 516]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 517]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 516]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 73 locations, 19 error locations. Result: SAFE, OverallTime: 306.1s, OverallIterations: 53, TraceHistogramMax: 11, AutomataDifference: 258.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1559 SDtfs, 6498 SDslu, 10631 SDs, 0 SdLazy, 50198 SolverSat, 1366 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 49.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4432 GetRequests, 2310 SyntacticMatches, 29 SemanticMatches, 2093 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33659 ImplicationChecksByTransitivity, 232.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 53 MinimizatonAttempts, 349 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 33.4s InterpolantComputationTime, 5712 NumberOfCodeBlocks, 5615 NumberOfCodeBlocksAsserted, 170 NumberOfCheckSat, 5624 ConstructedInterpolants, 378 QuantifiedInterpolants, 6292140 SizeOfPredicates, 671 NumberOfNonLiveVariables, 12072 ConjunctsInSsa, 2244 ConjunctsInUnsatCore, 88 InterpolantComputations, 21 PerfectInterpolantSequences, 5522/11573 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 proved your program to be correct! Received shutdown request...