./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.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_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/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 5cff20f2f9db1407772cc4ac909fa32770d83e71 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:38:15,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:38:15,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:38:15,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:38:15,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:38:15,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:38:15,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:38:15,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:38:15,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:38:15,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:38:15,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:38:15,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:38:15,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:38:15,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:38:15,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:38:15,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:38:15,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:38:15,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:38:15,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:38:15,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:38:15,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:38:15,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:38:15,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:38:15,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:38:15,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:38:15,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:38:15,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:38:15,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:38:15,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:38:15,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:38:15,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:38:15,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:38:15,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:38:15,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:38:15,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:38:15,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:38:15,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:38:15,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:38:15,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:38:15,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:38:15,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:38:15,515 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 12:38:15,524 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:38:15,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:38:15,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:38:15,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:38:15,525 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:38:15,525 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:38:15,525 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:38:15,525 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 12:38:15,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:38:15,526 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:38:15,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:38:15,526 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 12:38:15,526 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 12:38:15,526 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 12:38:15,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:38:15,526 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:38:15,527 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:38:15,527 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:38:15,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:38:15,527 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:38:15,527 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:38:15,527 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:38:15,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:38:15,527 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:38:15,528 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:38:15,528 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:38:15,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:38:15,528 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:38:15,528 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_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/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 -> 5cff20f2f9db1407772cc4ac909fa32770d83e71 [2019-12-07 12:38:15,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:38:15,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:38:15,636 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:38:15,637 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:38:15,637 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:38:15,638 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2019-12-07 12:38:15,676 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/bin/uautomizer/data/b7e455064/aefd9550465b4edba9efa0d392aaf47e/FLAG8f26fd740 [2019-12-07 12:38:16,044 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:38:16,044 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2019-12-07 12:38:16,055 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/bin/uautomizer/data/b7e455064/aefd9550465b4edba9efa0d392aaf47e/FLAG8f26fd740 [2019-12-07 12:38:16,067 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/bin/uautomizer/data/b7e455064/aefd9550465b4edba9efa0d392aaf47e [2019-12-07 12:38:16,069 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:38:16,070 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 12:38:16,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:38:16,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:38:16,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:38:16,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:38:16" (1/1) ... [2019-12-07 12:38:16,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62699726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:16, skipping insertion in model container [2019-12-07 12:38:16,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:38:16" (1/1) ... [2019-12-07 12:38:16,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:38:16,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:38:16,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:38:16,308 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:38:16,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:38:16,364 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:38:16,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:16 WrapperNode [2019-12-07 12:38:16,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:38:16,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:38:16,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:38:16,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:38:16,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:16" (1/1) ... [2019-12-07 12:38:16,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:16" (1/1) ... [2019-12-07 12:38:16,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:16" (1/1) ... [2019-12-07 12:38:16,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:16" (1/1) ... [2019-12-07 12:38:16,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:16" (1/1) ... [2019-12-07 12:38:16,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:16" (1/1) ... [2019-12-07 12:38:16,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:16" (1/1) ... [2019-12-07 12:38:16,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:38:16,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:38:16,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:38:16,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:38:16,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/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:38:16,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 12:38:16,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:38:16,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 12:38:16,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 12:38:16,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 12:38:16,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 12:38:16,444 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 12:38:16,444 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2019-12-07 12:38:16,444 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 12:38:16,444 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 12:38:16,444 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 12:38:16,444 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 12:38:16,444 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 12:38:16,444 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 12:38:16,444 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 12:38:16,444 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 12:38:16,444 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 12:38:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 12:38:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 12:38:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 12:38:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 12:38:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 12:38:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 12:38:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 12:38:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 12:38:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 12:38:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 12:38:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 12:38:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 12:38:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 12:38:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 12:38:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 12:38:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 12:38:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 12:38:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 12:38:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 12:38:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 12:38:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 12:38:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 12:38:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 12:38:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 12:38:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 12:38:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 12:38:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 12:38:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 12:38:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 12:38:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 12:38:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 12:38:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 12:38:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 12:38:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 12:38:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 12:38:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 12:38:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 12:38:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 12:38:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 12:38:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 12:38:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 12:38:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 12:38:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 12:38:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 12:38:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 12:38:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 12:38:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 12:38:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 12:38:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 12:38:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 12:38:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 12:38:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 12:38:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 12:38:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 12:38:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 12:38:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 12:38:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 12:38:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 12:38:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 12:38:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 12:38:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 12:38:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 12:38:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 12:38:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 12:38:16,450 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 12:38:16,450 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 12:38:16,450 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 12:38:16,450 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 12:38:16,450 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 12:38:16,450 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 12:38:16,450 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 12:38:16,450 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 12:38:16,450 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 12:38:16,450 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 12:38:16,451 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 12:38:16,451 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 12:38:16,451 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 12:38:16,451 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 12:38:16,451 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 12:38:16,451 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 12:38:16,451 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 12:38:16,451 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 12:38:16,451 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 12:38:16,451 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 12:38:16,451 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 12:38:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 12:38:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 12:38:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 12:38:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 12:38:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 12:38:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 12:38:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 12:38:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 12:38:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 12:38:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 12:38:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 12:38:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 12:38:16,453 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 12:38:16,453 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 12:38:16,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 12:38:16,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-12-07 12:38:16,453 INFO L130 BoogieDeclarations]: Found specification of procedure cstrpbrk [2019-12-07 12:38:16,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 12:38:16,453 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 12:38:16,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:38:16,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:38:16,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:38:16,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 12:38:16,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:38:16,724 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:38:16,724 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 12:38:16,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:38:16 BoogieIcfgContainer [2019-12-07 12:38:16,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:38:16,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:38:16,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:38:16,728 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:38:16,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:38:16" (1/3) ... [2019-12-07 12:38:16,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb04516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:38:16, skipping insertion in model container [2019-12-07 12:38:16,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:16" (2/3) ... [2019-12-07 12:38:16,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb04516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:38:16, skipping insertion in model container [2019-12-07 12:38:16,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:38:16" (3/3) ... [2019-12-07 12:38:16,730 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca-2.i [2019-12-07 12:38:16,736 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:38:16,742 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-12-07 12:38:16,750 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-12-07 12:38:16,764 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:38:16,764 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 12:38:16,764 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:38:16,764 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:38:16,764 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:38:16,765 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:38:16,765 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:38:16,765 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:38:16,777 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-12-07 12:38:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:38:16,783 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:16,784 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:16,784 INFO L410 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:16,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:16,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1363313202, now seen corresponding path program 1 times [2019-12-07 12:38:16,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:16,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079393780] [2019-12-07 12:38:16,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:16,939 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:38:16,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079393780] [2019-12-07 12:38:16,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:16,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:38:16,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854416463] [2019-12-07 12:38:16,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:38:16,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:16,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:38:16,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:38:16,954 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2019-12-07 12:38:17,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:17,089 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2019-12-07 12:38:17,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:38:17,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 12:38:17,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:17,098 INFO L225 Difference]: With dead ends: 83 [2019-12-07 12:38:17,098 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 12:38:17,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:38:17,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 12:38:17,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 62. [2019-12-07 12:38:17,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 12:38:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2019-12-07 12:38:17,129 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 11 [2019-12-07 12:38:17,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:17,129 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2019-12-07 12:38:17,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:38:17,129 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2019-12-07 12:38:17,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:38:17,130 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:17,130 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:17,130 INFO L410 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:17,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:17,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1361466160, now seen corresponding path program 1 times [2019-12-07 12:38:17,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:17,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239392109] [2019-12-07 12:38:17,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:17,177 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:38:17,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239392109] [2019-12-07 12:38:17,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:17,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:38:17,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716573090] [2019-12-07 12:38:17,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:38:17,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:17,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:38:17,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:38:17,179 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 4 states. [2019-12-07 12:38:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:17,249 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-12-07 12:38:17,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:38:17,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:38:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:17,251 INFO L225 Difference]: With dead ends: 60 [2019-12-07 12:38:17,251 INFO L226 Difference]: Without dead ends: 60 [2019-12-07 12:38:17,251 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:38:17,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-07 12:38:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-12-07 12:38:17,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 12:38:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2019-12-07 12:38:17,256 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 11 [2019-12-07 12:38:17,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:17,257 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2019-12-07 12:38:17,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:38:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2019-12-07 12:38:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:38:17,257 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:17,257 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:17,258 INFO L410 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:17,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:17,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1361466159, now seen corresponding path program 1 times [2019-12-07 12:38:17,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:17,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417946382] [2019-12-07 12:38:17,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:17,308 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:38:17,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417946382] [2019-12-07 12:38:17,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:17,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:38:17,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141112832] [2019-12-07 12:38:17,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:38:17,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:17,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:38:17,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:38:17,309 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 5 states. [2019-12-07 12:38:17,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:17,426 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2019-12-07 12:38:17,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:38:17,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 12:38:17,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:17,427 INFO L225 Difference]: With dead ends: 80 [2019-12-07 12:38:17,427 INFO L226 Difference]: Without dead ends: 80 [2019-12-07 12:38:17,427 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:38:17,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-07 12:38:17,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 62. [2019-12-07 12:38:17,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 12:38:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2019-12-07 12:38:17,433 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 11 [2019-12-07 12:38:17,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:17,433 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2019-12-07 12:38:17,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:38:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2019-12-07 12:38:17,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:38:17,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:17,434 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:17,434 INFO L410 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:17,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:17,434 INFO L82 PathProgramCache]: Analyzing trace with hash -179010490, now seen corresponding path program 1 times [2019-12-07 12:38:17,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:17,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637695958] [2019-12-07 12:38:17,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:17,490 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:38:17,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637695958] [2019-12-07 12:38:17,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:17,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:38:17,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489620622] [2019-12-07 12:38:17,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:38:17,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:17,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:38:17,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:38:17,491 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 5 states. [2019-12-07 12:38:17,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:17,572 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2019-12-07 12:38:17,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:38:17,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 12:38:17,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:17,573 INFO L225 Difference]: With dead ends: 61 [2019-12-07 12:38:17,573 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 12:38:17,574 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:38:17,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 12:38:17,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-12-07 12:38:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 12:38:17,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-12-07 12:38:17,578 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 13 [2019-12-07 12:38:17,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:17,578 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-12-07 12:38:17,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:38:17,578 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-12-07 12:38:17,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:38:17,579 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:17,579 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:17,579 INFO L410 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:17,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:17,579 INFO L82 PathProgramCache]: Analyzing trace with hash -179010438, now seen corresponding path program 1 times [2019-12-07 12:38:17,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:17,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322805881] [2019-12-07 12:38:17,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:17,607 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:38:17,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322805881] [2019-12-07 12:38:17,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:17,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:38:17,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095091993] [2019-12-07 12:38:17,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:38:17,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:17,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:38:17,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:38:17,609 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 4 states. [2019-12-07 12:38:17,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:17,683 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2019-12-07 12:38:17,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:38:17,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 12:38:17,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:17,684 INFO L225 Difference]: With dead ends: 59 [2019-12-07 12:38:17,684 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 12:38:17,684 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:38:17,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 12:38:17,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-12-07 12:38:17,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 12:38:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-12-07 12:38:17,688 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 13 [2019-12-07 12:38:17,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:17,689 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-12-07 12:38:17,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:38:17,689 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-12-07 12:38:17,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:38:17,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:17,689 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:17,690 INFO L410 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:17,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:17,690 INFO L82 PathProgramCache]: Analyzing trace with hash -179010437, now seen corresponding path program 1 times [2019-12-07 12:38:17,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:17,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836583034] [2019-12-07 12:38:17,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:17,729 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:38:17,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836583034] [2019-12-07 12:38:17,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:17,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:38:17,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126798999] [2019-12-07 12:38:17,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:38:17,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:17,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:38:17,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:38:17,730 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 5 states. [2019-12-07 12:38:17,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:17,810 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2019-12-07 12:38:17,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:38:17,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 12:38:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:17,811 INFO L225 Difference]: With dead ends: 78 [2019-12-07 12:38:17,811 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 12:38:17,812 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:38:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 12:38:17,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2019-12-07 12:38:17,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 12:38:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2019-12-07 12:38:17,816 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 13 [2019-12-07 12:38:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:17,816 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-12-07 12:38:17,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:38:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2019-12-07 12:38:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:38:17,817 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:17,817 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:17,817 INFO L410 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:17,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:17,818 INFO L82 PathProgramCache]: Analyzing trace with hash -121752135, now seen corresponding path program 1 times [2019-12-07 12:38:17,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:17,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786273602] [2019-12-07 12:38:17,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:17,861 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:38:17,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786273602] [2019-12-07 12:38:17,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:17,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:38:17,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760062888] [2019-12-07 12:38:17,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:38:17,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:17,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:38:17,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:38:17,868 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 6 states. [2019-12-07 12:38:17,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:17,969 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2019-12-07 12:38:17,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:38:17,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-12-07 12:38:17,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:17,970 INFO L225 Difference]: With dead ends: 81 [2019-12-07 12:38:17,970 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 12:38:17,970 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:38:17,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 12:38:17,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2019-12-07 12:38:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 12:38:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2019-12-07 12:38:17,974 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 13 [2019-12-07 12:38:17,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:17,974 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2019-12-07 12:38:17,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:38:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2019-12-07 12:38:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:38:17,975 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:17,975 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:17,975 INFO L410 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:17,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:17,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1254357838, now seen corresponding path program 1 times [2019-12-07 12:38:17,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:17,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101401568] [2019-12-07 12:38:17,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:18,006 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:38:18,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101401568] [2019-12-07 12:38:18,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:18,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:38:18,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676713365] [2019-12-07 12:38:18,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:38:18,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:18,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:38:18,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:38:18,007 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 5 states. [2019-12-07 12:38:18,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:18,070 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2019-12-07 12:38:18,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:38:18,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 12:38:18,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:18,071 INFO L225 Difference]: With dead ends: 71 [2019-12-07 12:38:18,071 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 12:38:18,071 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:38:18,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 12:38:18,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-12-07 12:38:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 12:38:18,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2019-12-07 12:38:18,076 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 14 [2019-12-07 12:38:18,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:18,077 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2019-12-07 12:38:18,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:38:18,077 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2019-12-07 12:38:18,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:38:18,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:18,078 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:18,078 INFO L410 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:18,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:18,078 INFO L82 PathProgramCache]: Analyzing trace with hash 498238100, now seen corresponding path program 1 times [2019-12-07 12:38:18,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:18,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292537800] [2019-12-07 12:38:18,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:18,131 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:38:18,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292537800] [2019-12-07 12:38:18,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054123322] [2019-12-07 12:38:18,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/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:38:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:18,188 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 12:38:18,191 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:38:18,219 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_33|]} [2019-12-07 12:38:18,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:38:18,231 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:38:18,231 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:38:18,240 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:38:18,244 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:38:18,244 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:38:18,251 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:38:18,251 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:38:18,251 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 12:38:18,261 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:38:18,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:38:18,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-12-07 12:38:18,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679888008] [2019-12-07 12:38:18,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:38:18,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:18,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:38:18,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:38:18,262 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand 7 states. [2019-12-07 12:38:18,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:18,388 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2019-12-07 12:38:18,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:38:18,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-07 12:38:18,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:18,389 INFO L225 Difference]: With dead ends: 90 [2019-12-07 12:38:18,389 INFO L226 Difference]: Without dead ends: 90 [2019-12-07 12:38:18,389 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:38:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-07 12:38:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2019-12-07 12:38:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 12:38:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2019-12-07 12:38:18,393 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 15 [2019-12-07 12:38:18,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:18,393 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2019-12-07 12:38:18,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:38:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2019-12-07 12:38:18,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:38:18,394 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:18,394 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:38:18,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:38:18,596 INFO L410 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:18,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:18,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1936156247, now seen corresponding path program 1 times [2019-12-07 12:38:18,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:18,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286385604] [2019-12-07 12:38:18,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:18,650 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:38:18,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286385604] [2019-12-07 12:38:18,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:18,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:38:18,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062720634] [2019-12-07 12:38:18,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:38:18,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:18,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:38:18,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:38:18,651 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 6 states. [2019-12-07 12:38:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:18,733 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-12-07 12:38:18,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:38:18,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-07 12:38:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:18,734 INFO L225 Difference]: With dead ends: 64 [2019-12-07 12:38:18,734 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 12:38:18,734 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:38:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 12:38:18,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-12-07 12:38:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 12:38:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-12-07 12:38:18,737 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 17 [2019-12-07 12:38:18,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:18,737 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-12-07 12:38:18,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:38:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2019-12-07 12:38:18,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:38:18,738 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:18,738 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:38:18,738 INFO L410 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:18,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:18,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1936156248, now seen corresponding path program 1 times [2019-12-07 12:38:18,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:18,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601806641] [2019-12-07 12:38:18,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:18,790 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:38:18,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601806641] [2019-12-07 12:38:18,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:18,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:38:18,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146307384] [2019-12-07 12:38:18,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:38:18,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:18,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:38:18,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:38:18,791 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 8 states. [2019-12-07 12:38:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:18,938 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2019-12-07 12:38:18,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:38:18,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-07 12:38:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:18,940 INFO L225 Difference]: With dead ends: 86 [2019-12-07 12:38:18,940 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 12:38:18,941 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:38:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 12:38:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2019-12-07 12:38:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 12:38:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2019-12-07 12:38:18,943 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 17 [2019-12-07 12:38:18,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:18,944 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2019-12-07 12:38:18,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:38:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2019-12-07 12:38:18,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:38:18,944 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:18,944 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:38:18,944 INFO L410 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:18,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:18,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1591790588, now seen corresponding path program 1 times [2019-12-07 12:38:18,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:18,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973614486] [2019-12-07 12:38:18,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:18,997 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:38:18,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973614486] [2019-12-07 12:38:18,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370961520] [2019-12-07 12:38:18,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/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:38:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:19,058 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 12:38:19,059 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:38:19,071 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:38:19,072 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:38:19,072 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:38:19,087 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 12:38:19,087 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:38:19,087 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 12:38:19,098 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:38:19,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:38:19,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-12-07 12:38:19,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865252342] [2019-12-07 12:38:19,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:38:19,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:19,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:38:19,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:38:19,099 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 7 states. [2019-12-07 12:38:19,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:19,217 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-12-07 12:38:19,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:38:19,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 12:38:19,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:19,218 INFO L225 Difference]: With dead ends: 74 [2019-12-07 12:38:19,218 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 12:38:19,218 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:38:19,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 12:38:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2019-12-07 12:38:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 12:38:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-12-07 12:38:19,221 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 17 [2019-12-07 12:38:19,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:19,221 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-12-07 12:38:19,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:38:19,221 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2019-12-07 12:38:19,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:38:19,222 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:19,222 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:38:19,423 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:38:19,423 INFO L410 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:19,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:19,424 INFO L82 PathProgramCache]: Analyzing trace with hash 168377437, now seen corresponding path program 1 times [2019-12-07 12:38:19,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:19,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027590241] [2019-12-07 12:38:19,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:19,503 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:38:19,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027590241] [2019-12-07 12:38:19,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:19,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:38:19,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688187585] [2019-12-07 12:38:19,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:38:19,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:19,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:38:19,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:38:19,505 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 7 states. [2019-12-07 12:38:19,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:19,709 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-12-07 12:38:19,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:38:19,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-12-07 12:38:19,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:19,710 INFO L225 Difference]: With dead ends: 64 [2019-12-07 12:38:19,710 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 12:38:19,710 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:38:19,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 12:38:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-12-07 12:38:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 12:38:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-12-07 12:38:19,713 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 21 [2019-12-07 12:38:19,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:19,713 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-12-07 12:38:19,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:38:19,714 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2019-12-07 12:38:19,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:38:19,714 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:19,714 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:38:19,715 INFO L410 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:19,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:19,715 INFO L82 PathProgramCache]: Analyzing trace with hash 168377438, now seen corresponding path program 1 times [2019-12-07 12:38:19,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:19,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170781769] [2019-12-07 12:38:19,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:19,786 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:38:19,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170781769] [2019-12-07 12:38:19,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:19,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:38:19,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762570478] [2019-12-07 12:38:19,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:38:19,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:19,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:38:19,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:38:19,787 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 9 states. [2019-12-07 12:38:19,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:19,950 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2019-12-07 12:38:19,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:38:19,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-07 12:38:19,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:19,951 INFO L225 Difference]: With dead ends: 76 [2019-12-07 12:38:19,951 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 12:38:19,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:38:19,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 12:38:19,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2019-12-07 12:38:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 12:38:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2019-12-07 12:38:19,953 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 21 [2019-12-07 12:38:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:19,953 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2019-12-07 12:38:19,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:38:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2019-12-07 12:38:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:38:19,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:19,954 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:38:19,954 INFO L410 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:19,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:19,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1415217207, now seen corresponding path program 1 times [2019-12-07 12:38:19,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:19,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238170258] [2019-12-07 12:38:19,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:19,993 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:38:19,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238170258] [2019-12-07 12:38:19,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:19,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:38:19,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927032465] [2019-12-07 12:38:19,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:38:19,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:19,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:38:19,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:38:19,995 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 5 states. [2019-12-07 12:38:20,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:20,051 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-12-07 12:38:20,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:38:20,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 12:38:20,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:20,052 INFO L225 Difference]: With dead ends: 67 [2019-12-07 12:38:20,052 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 12:38:20,053 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:38:20,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 12:38:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 12:38:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 12:38:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2019-12-07 12:38:20,054 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 23 [2019-12-07 12:38:20,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:20,054 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2019-12-07 12:38:20,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:38:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2019-12-07 12:38:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:38:20,055 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:20,055 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:20,055 INFO L410 AbstractCegarLoop]: === Iteration 16 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:20,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:20,055 INFO L82 PathProgramCache]: Analyzing trace with hash 808083893, now seen corresponding path program 1 times [2019-12-07 12:38:20,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:20,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446024365] [2019-12-07 12:38:20,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:20,076 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:38:20,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446024365] [2019-12-07 12:38:20,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:20,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:38:20,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946897989] [2019-12-07 12:38:20,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:38:20,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:20,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:38:20,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:38:20,077 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 4 states. [2019-12-07 12:38:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:20,118 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-12-07 12:38:20,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:38:20,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 12:38:20,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:20,119 INFO L225 Difference]: With dead ends: 64 [2019-12-07 12:38:20,119 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 12:38:20,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:38:20,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 12:38:20,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-12-07 12:38:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 12:38:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-12-07 12:38:20,121 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 25 [2019-12-07 12:38:20,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:20,121 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-12-07 12:38:20,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:38:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2019-12-07 12:38:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:38:20,122 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:20,122 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:38:20,122 INFO L410 AbstractCegarLoop]: === Iteration 17 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:20,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:20,122 INFO L82 PathProgramCache]: Analyzing trace with hash -826319086, now seen corresponding path program 1 times [2019-12-07 12:38:20,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:20,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578302307] [2019-12-07 12:38:20,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:20,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:38:20,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578302307] [2019-12-07 12:38:20,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:20,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:38:20,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283632922] [2019-12-07 12:38:20,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:38:20,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:20,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:38:20,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:38:20,212 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 9 states. [2019-12-07 12:38:20,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:20,361 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2019-12-07 12:38:20,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:38:20,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-12-07 12:38:20,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:20,362 INFO L225 Difference]: With dead ends: 77 [2019-12-07 12:38:20,362 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 12:38:20,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:38:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 12:38:20,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-12-07 12:38:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 12:38:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2019-12-07 12:38:20,364 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 27 [2019-12-07 12:38:20,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:20,364 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-12-07 12:38:20,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:38:20,365 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2019-12-07 12:38:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:38:20,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:20,365 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:38:20,365 INFO L410 AbstractCegarLoop]: === Iteration 18 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:20,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:20,366 INFO L82 PathProgramCache]: Analyzing trace with hash -403617260, now seen corresponding path program 1 times [2019-12-07 12:38:20,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:20,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016858011] [2019-12-07 12:38:20,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:20,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:38:20,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016858011] [2019-12-07 12:38:20,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:20,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 12:38:20,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707942666] [2019-12-07 12:38:20,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:38:20,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:20,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:38:20,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:38:20,480 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 10 states. [2019-12-07 12:38:20,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:20,649 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2019-12-07 12:38:20,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:38:20,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-12-07 12:38:20,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:20,650 INFO L225 Difference]: With dead ends: 80 [2019-12-07 12:38:20,650 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 12:38:20,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:38:20,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 12:38:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2019-12-07 12:38:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 12:38:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2019-12-07 12:38:20,652 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 27 [2019-12-07 12:38:20,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:20,652 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2019-12-07 12:38:20,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:38:20,652 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2019-12-07 12:38:20,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 12:38:20,653 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:20,653 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:20,653 INFO L410 AbstractCegarLoop]: === Iteration 19 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:20,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:20,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1843673559, now seen corresponding path program 1 times [2019-12-07 12:38:20,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:20,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767356871] [2019-12-07 12:38:20,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:20,762 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:38:20,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767356871] [2019-12-07 12:38:20,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:20,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 12:38:20,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486795581] [2019-12-07 12:38:20,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:38:20,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:20,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:38:20,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:38:20,763 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 11 states. [2019-12-07 12:38:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:21,021 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2019-12-07 12:38:21,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:38:21,021 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2019-12-07 12:38:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:21,022 INFO L225 Difference]: With dead ends: 81 [2019-12-07 12:38:21,022 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 12:38:21,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-07 12:38:21,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 12:38:21,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-12-07 12:38:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 12:38:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-12-07 12:38:21,024 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 31 [2019-12-07 12:38:21,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:21,024 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-12-07 12:38:21,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:38:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-12-07 12:38:21,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 12:38:21,025 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:21,025 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:21,025 INFO L410 AbstractCegarLoop]: === Iteration 20 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:21,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:21,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1709660053, now seen corresponding path program 1 times [2019-12-07 12:38:21,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:21,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166628331] [2019-12-07 12:38:21,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:21,145 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:38:21,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166628331] [2019-12-07 12:38:21,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:21,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 12:38:21,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91999888] [2019-12-07 12:38:21,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 12:38:21,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:21,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 12:38:21,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:38:21,146 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 13 states. [2019-12-07 12:38:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:21,366 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2019-12-07 12:38:21,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 12:38:21,367 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-12-07 12:38:21,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:21,367 INFO L225 Difference]: With dead ends: 103 [2019-12-07 12:38:21,367 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 12:38:21,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-12-07 12:38:21,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 12:38:21,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 80. [2019-12-07 12:38:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 12:38:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2019-12-07 12:38:21,370 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 31 [2019-12-07 12:38:21,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:21,371 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2019-12-07 12:38:21,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 12:38:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2019-12-07 12:38:21,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 12:38:21,371 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:21,371 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:21,371 INFO L410 AbstractCegarLoop]: === Iteration 21 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:21,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:21,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1499760060, now seen corresponding path program 1 times [2019-12-07 12:38:21,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:21,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200541870] [2019-12-07 12:38:21,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:21,441 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:38:21,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200541870] [2019-12-07 12:38:21,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:21,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 12:38:21,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637850189] [2019-12-07 12:38:21,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:38:21,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:21,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:38:21,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:38:21,442 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 11 states. [2019-12-07 12:38:21,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:21,665 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2019-12-07 12:38:21,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 12:38:21,665 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2019-12-07 12:38:21,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:21,665 INFO L225 Difference]: With dead ends: 81 [2019-12-07 12:38:21,666 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 12:38:21,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-12-07 12:38:21,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 12:38:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-12-07 12:38:21,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 12:38:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2019-12-07 12:38:21,668 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 32 [2019-12-07 12:38:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:21,668 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2019-12-07 12:38:21,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:38:21,668 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2019-12-07 12:38:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 12:38:21,668 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:21,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:21,669 INFO L410 AbstractCegarLoop]: === Iteration 22 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:21,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:21,669 INFO L82 PathProgramCache]: Analyzing trace with hash 385012248, now seen corresponding path program 1 times [2019-12-07 12:38:21,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:21,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678657524] [2019-12-07 12:38:21,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:38:21,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678657524] [2019-12-07 12:38:21,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078008486] [2019-12-07 12:38:21,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/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:38:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:21,833 INFO L264 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 12:38:21,836 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:38:21,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:38:21,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:38:21,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-12-07 12:38:21,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496831715] [2019-12-07 12:38:21,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 12:38:21,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:21,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 12:38:21,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-07 12:38:21,907 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 18 states. [2019-12-07 12:38:22,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:22,161 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-12-07 12:38:22,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:38:22,161 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-12-07 12:38:22,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:22,162 INFO L225 Difference]: With dead ends: 73 [2019-12-07 12:38:22,162 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 12:38:22,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2019-12-07 12:38:22,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 12:38:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2019-12-07 12:38:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 12:38:22,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-12-07 12:38:22,164 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 35 [2019-12-07 12:38:22,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:22,164 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-12-07 12:38:22,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 12:38:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-12-07 12:38:22,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 12:38:22,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:22,165 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:22,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:38:22,366 INFO L410 AbstractCegarLoop]: === Iteration 23 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:22,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1958963042, now seen corresponding path program 1 times [2019-12-07 12:38:22,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:22,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191609206] [2019-12-07 12:38:22,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:38:22,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191609206] [2019-12-07 12:38:22,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655015203] [2019-12-07 12:38:22,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/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:38:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:22,517 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 12:38:22,518 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:38:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:38:22,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:38:22,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-12-07 12:38:22,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736339523] [2019-12-07 12:38:22,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 12:38:22,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:22,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 12:38:22,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-07 12:38:22,584 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 16 states. [2019-12-07 12:38:22,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:22,826 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2019-12-07 12:38:22,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:38:22,826 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-12-07 12:38:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:22,827 INFO L225 Difference]: With dead ends: 119 [2019-12-07 12:38:22,827 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 12:38:22,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-07 12:38:22,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 12:38:22,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 86. [2019-12-07 12:38:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 12:38:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2019-12-07 12:38:22,829 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 38 [2019-12-07 12:38:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:22,829 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2019-12-07 12:38:22,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 12:38:22,829 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2019-12-07 12:38:22,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 12:38:22,829 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:22,829 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, 1, 1, 1, 1] [2019-12-07 12:38:23,030 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:38:23,031 INFO L410 AbstractCegarLoop]: === Iteration 24 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:23,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:23,031 INFO L82 PathProgramCache]: Analyzing trace with hash 950813004, now seen corresponding path program 2 times [2019-12-07 12:38:23,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:23,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927246439] [2019-12-07 12:38:23,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:23,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:38:23,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927246439] [2019-12-07 12:38:23,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315542974] [2019-12-07 12:38:23,257 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/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:38:23,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:38:23,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:38:23,322 INFO L264 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 12:38:23,324 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:38:23,373 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:38:23,373 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:38:23,377 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:38:23,377 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:38:23,377 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-12-07 12:38:23,506 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:38:23,506 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 18 treesize of output 18 [2019-12-07 12:38:23,506 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 12:38:23,514 INFO L614 ElimStorePlain]: treesize reduction 8, result has 55.6 percent of original size [2019-12-07 12:38:23,515 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:38:23,515 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:3 [2019-12-07 12:38:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:38:23,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:38:23,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2019-12-07 12:38:23,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275015324] [2019-12-07 12:38:23,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 12:38:23,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:23,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 12:38:23,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2019-12-07 12:38:23,547 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 26 states. [2019-12-07 12:38:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:24,128 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2019-12-07 12:38:24,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 12:38:24,129 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 41 [2019-12-07 12:38:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:24,130 INFO L225 Difference]: With dead ends: 134 [2019-12-07 12:38:24,130 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 12:38:24,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=1222, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 12:38:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 12:38:24,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2019-12-07 12:38:24,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-07 12:38:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2019-12-07 12:38:24,133 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 41 [2019-12-07 12:38:24,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:24,133 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2019-12-07 12:38:24,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 12:38:24,133 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2019-12-07 12:38:24,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 12:38:24,134 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:24,134 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:24,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:38:24,335 INFO L410 AbstractCegarLoop]: === Iteration 25 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:24,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:24,336 INFO L82 PathProgramCache]: Analyzing trace with hash -2043759601, now seen corresponding path program 3 times [2019-12-07 12:38:24,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:24,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921572628] [2019-12-07 12:38:24,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:38:24,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921572628] [2019-12-07 12:38:24,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466747200] [2019-12-07 12:38:24,477 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/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:38:24,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 12:38:24,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:38:24,559 INFO L264 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 12:38:24,562 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:38:24,573 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:38:24,574 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:38:24,574 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:38:24,586 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 12:38:24,587 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:38:24,587 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 12:38:24,602 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:38:24,602 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:38:24,606 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:38:24,606 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:38:24,607 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-12-07 12:38:24,687 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:38:24,687 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 20 treesize of output 20 [2019-12-07 12:38:24,688 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 12:38:24,694 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:38:24,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:24,697 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 12:38:24,697 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-12-07 12:38:24,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:24,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:38:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 12:38:24,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:38:24,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2019-12-07 12:38:24,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701603181] [2019-12-07 12:38:24,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 12:38:24,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:24,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 12:38:24,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-12-07 12:38:24,813 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand 23 states. [2019-12-07 12:38:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:25,947 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2019-12-07 12:38:25,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 12:38:25,947 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2019-12-07 12:38:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:25,948 INFO L225 Difference]: With dead ends: 142 [2019-12-07 12:38:25,948 INFO L226 Difference]: Without dead ends: 140 [2019-12-07 12:38:25,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=306, Invalid=1334, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 12:38:25,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-12-07 12:38:25,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 92. [2019-12-07 12:38:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 12:38:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2019-12-07 12:38:25,951 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 45 [2019-12-07 12:38:25,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:25,952 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2019-12-07 12:38:25,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 12:38:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2019-12-07 12:38:25,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 12:38:25,952 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:25,952 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:26,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:38:26,154 INFO L410 AbstractCegarLoop]: === Iteration 26 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:26,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:26,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1906876194, now seen corresponding path program 2 times [2019-12-07 12:38:26,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:26,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481160057] [2019-12-07 12:38:26,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:38:26,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481160057] [2019-12-07 12:38:26,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726970216] [2019-12-07 12:38:26,380 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/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:38:26,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:38:26,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:38:26,447 INFO L264 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 61 conjunts are in the unsatisfiable core [2019-12-07 12:38:26,450 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:38:26,453 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:38:26,454 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:38:26,457 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:38:26,457 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:38:26,457 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 12:38:26,519 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:38:26,519 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:38:26,525 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:38:26,526 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:38:26,526 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-12-07 12:38:26,550 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:38:26,550 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:38:26,558 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:38:26,559 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 12:38:26,559 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2019-12-07 12:38:27,054 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:38:27,055 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 38 [2019-12-07 12:38:27,055 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:38:27,071 INFO L614 ElimStorePlain]: treesize reduction 12, result has 66.7 percent of original size [2019-12-07 12:38:27,071 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:38:27,071 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:52, output treesize:8 [2019-12-07 12:38:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:38:27,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:38:27,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 29 [2019-12-07 12:38:27,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218254747] [2019-12-07 12:38:27,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 12:38:27,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:27,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 12:38:27,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=745, Unknown=0, NotChecked=0, Total=812 [2019-12-07 12:38:27,112 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 29 states. [2019-12-07 12:38:28,174 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-12-07 12:38:28,706 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-12-07 12:38:28,884 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-12-07 12:38:29,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:29,973 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2019-12-07 12:38:29,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 12:38:29,974 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2019-12-07 12:38:29,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:29,974 INFO L225 Difference]: With dead ends: 158 [2019-12-07 12:38:29,974 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 12:38:29,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=281, Invalid=2071, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 12:38:29,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 12:38:29,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-12-07 12:38:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 12:38:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2019-12-07 12:38:29,977 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 51 [2019-12-07 12:38:29,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:29,977 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2019-12-07 12:38:29,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 12:38:29,977 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2019-12-07 12:38:29,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 12:38:29,978 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:29,978 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1] [2019-12-07 12:38:30,178 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:38:30,179 INFO L410 AbstractCegarLoop]: === Iteration 27 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-12-07 12:38:30,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:30,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1800116063, now seen corresponding path program 3 times [2019-12-07 12:38:30,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:30,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605424720] [2019-12-07 12:38:30,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:38:30,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605424720] [2019-12-07 12:38:30,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078992555] [2019-12-07 12:38:30,276 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/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:38:30,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 12:38:30,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:38:30,344 INFO L264 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-07 12:38:30,346 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:38:30,350 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:38:30,350 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:38:30,353 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:38:30,353 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:38:30,353 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-12-07 12:38:30,377 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:38:30,377 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:38:30,382 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:38:30,382 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:38:30,383 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-12-07 12:38:30,404 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:38:30,405 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:38:30,412 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:38:30,413 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:38:30,413 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-12-07 12:38:31,500 WARN L192 SmtUtils]: Spent 706.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-12-07 12:38:31,617 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:38:31,617 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 70 [2019-12-07 12:38:31,618 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:38:31,666 INFO L614 ElimStorePlain]: treesize reduction 6, result has 92.5 percent of original size [2019-12-07 12:38:31,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:38:31,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:38:31,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,678 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:38:31,678 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:65, output treesize:66 [2019-12-07 12:38:31,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:38:31,789 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 12:38:31,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:38:31,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 26 [2019-12-07 12:38:31,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312626822] [2019-12-07 12:38:31,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 12:38:31,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:31,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 12:38:31,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2019-12-07 12:38:31,795 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 27 states. [2019-12-07 12:38:33,288 WARN L192 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-12-07 12:38:35,007 WARN L192 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-12-07 12:38:36,161 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-12-07 12:38:43,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:43,970 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2019-12-07 12:38:43,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 12:38:43,970 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 55 [2019-12-07 12:38:43,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:43,971 INFO L225 Difference]: With dead ends: 114 [2019-12-07 12:38:43,971 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:38:43,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=517, Invalid=3388, Unknown=1, NotChecked=0, Total=3906 [2019-12-07 12:38:43,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:38:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:38:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:38:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:38:43,972 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2019-12-07 12:38:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:43,972 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:38:43,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 12:38:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:38:43,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:38:44,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:38:44,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:38:44 BoogieIcfgContainer [2019-12-07 12:38:44,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:38:44,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:38:44,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:38:44,181 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:38:44,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:38:16" (3/4) ... [2019-12-07 12:38:44,187 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 12:38:44,194 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 12:38:44,194 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrpbrk [2019-12-07 12:38:44,194 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 12:38:44,194 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 12:38:44,194 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-12-07 12:38:44,194 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-12-07 12:38:44,194 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 12:38:44,194 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-12-07 12:38:44,198 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-12-07 12:38:44,198 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 12:38:44,198 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 12:38:44,198 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 12:38:44,231 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fd1372ee-ca56-4f75-8229-2924bc3ad2b8/bin/uautomizer/witness.graphml [2019-12-07 12:38:44,232 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:38:44,233 INFO L168 Benchmark]: Toolchain (without parser) took 28162.94 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 265.3 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -205.5 MB). Peak memory consumption was 59.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:38:44,233 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:38:44,233 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -156.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:38:44,234 INFO L168 Benchmark]: Boogie Preprocessor took 37.94 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:38:44,234 INFO L168 Benchmark]: RCFGBuilder took 321.80 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:38:44,234 INFO L168 Benchmark]: TraceAbstraction took 27453.62 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 153.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -120.5 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:38:44,235 INFO L168 Benchmark]: Witness Printer took 51.67 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:38:44,236 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 294.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -156.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.94 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 321.80 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 27453.62 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 153.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -120.5 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Witness Printer took 51.67 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 522]: 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: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: 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: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: 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, 77 locations, 19 error locations. Result: SAFE, OverallTime: 27.4s, OverallIterations: 27, TraceHistogramMax: 2, AutomataDifference: 19.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 978 SDtfs, 2806 SDslu, 1584 SDs, 0 SdLazy, 6383 SolverSat, 358 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 689 GetRequests, 285 SyntacticMatches, 11 SemanticMatches, 393 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2093 ImplicationChecksByTransitivity, 16.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 249 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 965 NumberOfCodeBlocks, 965 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 930 ConstructedInterpolants, 80 QuantifiedInterpolants, 338164 SizeOfPredicates, 86 NumberOfNonLiveVariables, 1301 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 35 InterpolantComputations, 19 PerfectInterpolantSequences, 70/157 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...