./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/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 1915ee2ae984f6ece38fc0dcbac99e0ba37faddf ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:59:33,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:59:33,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:59:33,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:59:33,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:59:33,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:59:33,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:59:33,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:59:33,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:59:33,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:59:33,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:59:33,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:59:33,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:59:33,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:59:33,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:59:33,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:59:33,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:59:33,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:59:33,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:59:33,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:59:33,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:59:33,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:59:33,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:59:33,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:59:33,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:59:33,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:59:33,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:59:33,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:59:33,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:59:33,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:59:33,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:59:33,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:59:33,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:59:33,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:59:33,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:59:33,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:59:33,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:59:33,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:59:33,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:59:33,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:59:33,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:59:33,370 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 22:59:33,394 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:59:33,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:59:33,396 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:59:33,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:59:33,396 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:59:33,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:59:33,397 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:59:33,397 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:59:33,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:59:33,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:59:33,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:59:33,398 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:59:33,398 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:59:33,399 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 22:59:33,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:59:33,399 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:59:33,399 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:59:33,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:59:33,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:59:33,400 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:59:33,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:59:33,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:59:33,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:59:33,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:59:33,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:59:33,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:59:33,401 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_b082c996-7943-4eda-949f-8d6e2970dc14/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 -> 1915ee2ae984f6ece38fc0dcbac99e0ba37faddf [2019-11-15 22:59:33,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:59:33,459 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:59:33,464 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:59:33,465 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:59:33,465 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:59:33,466 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i [2019-11-15 22:59:33,522 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/data/ca19f3978/fcb9f787f7584ba5b17ccd8c41cfdd34/FLAG5dcc4befb [2019-11-15 22:59:33,959 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:59:33,959 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i [2019-11-15 22:59:33,979 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/data/ca19f3978/fcb9f787f7584ba5b17ccd8c41cfdd34/FLAG5dcc4befb [2019-11-15 22:59:34,344 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/data/ca19f3978/fcb9f787f7584ba5b17ccd8c41cfdd34 [2019-11-15 22:59:34,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:59:34,348 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:59:34,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:59:34,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:59:34,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:59:34,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:59:34" (1/1) ... [2019-11-15 22:59:34,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41f6e854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:34, skipping insertion in model container [2019-11-15 22:59:34,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:59:34" (1/1) ... [2019-11-15 22:59:34,360 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:59:34,408 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:59:34,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:59:34,766 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:59:34,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:59:34,863 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:59:34,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:34 WrapperNode [2019-11-15 22:59:34,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:59:34,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:59:34,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:59:34,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:59:34,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:34" (1/1) ... [2019-11-15 22:59:34,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:34" (1/1) ... [2019-11-15 22:59:34,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:34" (1/1) ... [2019-11-15 22:59:34,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:34" (1/1) ... [2019-11-15 22:59:34,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:34" (1/1) ... [2019-11-15 22:59:34,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:34" (1/1) ... [2019-11-15 22:59:34,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:34" (1/1) ... [2019-11-15 22:59:34,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:59:34,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:59:34,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:59:34,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:59:34,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:59:34,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:59:34,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:59:34,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 22:59:34,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 22:59:34,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-15 22:59:34,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-15 22:59:34,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-15 22:59:34,973 INFO L138 BoogieDeclarations]: Found implementation of procedure strlen_rec [2019-11-15 22:59:34,973 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:59:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:59:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:59:34,974 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:59:34,974 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:59:34,974 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:59:34,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:59:34,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:59:34,975 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:59:34,975 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:59:34,975 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:59:34,977 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:59:34,978 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:59:34,978 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:59:34,978 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:59:34,978 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:59:34,978 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:59:34,978 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 22:59:34,979 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 22:59:34,979 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-15 22:59:34,979 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-15 22:59:34,979 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-15 22:59:34,979 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:59:34,980 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:59:34,980 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:59:34,980 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:59:34,980 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:59:34,980 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:59:34,980 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:59:34,981 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:59:34,981 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:59:34,981 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:59:34,981 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:59:34,981 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:59:34,981 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:59:34,981 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:59:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:59:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:59:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:59:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:59:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:59:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:59:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:59:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:59:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:59:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:59:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:59:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:59:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:59:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:59:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:59:34,985 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:59:34,985 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:59:34,985 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:59:34,985 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:59:34,985 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:59:34,985 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:59:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:59:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:59:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:59:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:59:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:59:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:59:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:59:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:59:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:59:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:59:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:59:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:59:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:59:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:59:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:59:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:59:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:59:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:59:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:59:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:59:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:59:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:59:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:59:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:59:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:59:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:59:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:59:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:59:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:59:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:59:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:59:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:59:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:59:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:59:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:59:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:59:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:59:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:59:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:59:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:59:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:59:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:59:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:59:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:59:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:59:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:59:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:59:34,992 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:59:34,992 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:59:34,992 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:59:34,992 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:59:34,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 22:59:34,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-15 22:59:34,992 INFO L130 BoogieDeclarations]: Found specification of procedure strlen_rec [2019-11-15 22:59:34,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:59:34,992 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:59:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:59:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:59:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:59:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:59:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:59:35,439 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:59:35,440 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-15 22:59:35,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:59:35 BoogieIcfgContainer [2019-11-15 22:59:35,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:59:35,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:59:35,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:59:35,444 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:59:35,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:59:34" (1/3) ... [2019-11-15 22:59:35,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@554bae7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:59:35, skipping insertion in model container [2019-11-15 22:59:35,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:34" (2/3) ... [2019-11-15 22:59:35,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@554bae7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:59:35, skipping insertion in model container [2019-11-15 22:59:35,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:59:35" (3/3) ... [2019-11-15 22:59:35,447 INFO L109 eAbstractionObserver]: Analyzing ICFG rec_strlen-alloca-1.i [2019-11-15 22:59:35,455 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:59:35,462 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-15 22:59:35,471 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-15 22:59:35,488 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:59:35,488 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:59:35,488 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:59:35,488 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:59:35,489 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:59:35,489 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:59:35,489 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:59:35,489 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:59:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-11-15 22:59:35,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:59:35,510 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:35,511 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:35,513 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:35,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:35,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2117754822, now seen corresponding path program 1 times [2019-11-15 22:59:35,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:35,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238405626] [2019-11-15 22:59:35,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:35,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:35,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:35,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238405626] [2019-11-15 22:59:35,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:35,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:59:35,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980963408] [2019-11-15 22:59:35,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:59:35,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:35,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:59:35,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:59:35,708 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 4 states. [2019-11-15 22:59:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:35,815 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-11-15 22:59:35,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:59:35,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 22:59:35,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:35,827 INFO L225 Difference]: With dead ends: 31 [2019-11-15 22:59:35,827 INFO L226 Difference]: Without dead ends: 28 [2019-11-15 22:59:35,831 INFO L600 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-11-15 22:59:35,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-15 22:59:35,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-15 22:59:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 22:59:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-11-15 22:59:35,864 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2019-11-15 22:59:35,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:35,865 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-15 22:59:35,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:59:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-11-15 22:59:35,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:59:35,865 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:35,865 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:35,866 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:35,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:35,866 INFO L82 PathProgramCache]: Analyzing trace with hash -2117754821, now seen corresponding path program 1 times [2019-11-15 22:59:35,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:35,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279660296] [2019-11-15 22:59:35,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:35,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:35,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:35,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279660296] [2019-11-15 22:59:35,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:35,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:59:35,964 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918548657] [2019-11-15 22:59:35,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:59:35,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:35,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:59:35,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:59:35,966 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2019-11-15 22:59:36,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:36,049 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-11-15 22:59:36,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:59:36,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-15 22:59:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:36,050 INFO L225 Difference]: With dead ends: 27 [2019-11-15 22:59:36,051 INFO L226 Difference]: Without dead ends: 27 [2019-11-15 22:59:36,051 INFO L600 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-11-15 22:59:36,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-15 22:59:36,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-15 22:59:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 22:59:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-11-15 22:59:36,055 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2019-11-15 22:59:36,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:36,056 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-15 22:59:36,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:59:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-11-15 22:59:36,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:59:36,057 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:36,057 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:36,057 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:36,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:36,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2117754768, now seen corresponding path program 1 times [2019-11-15 22:59:36,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:36,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177663784] [2019-11-15 22:59:36,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:36,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:36,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:36,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177663784] [2019-11-15 22:59:36,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:36,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:59:36,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214349720] [2019-11-15 22:59:36,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:59:36,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:36,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:59:36,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:59:36,122 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 5 states. [2019-11-15 22:59:36,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:36,202 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-11-15 22:59:36,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:59:36,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-15 22:59:36,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:36,203 INFO L225 Difference]: With dead ends: 34 [2019-11-15 22:59:36,203 INFO L226 Difference]: Without dead ends: 34 [2019-11-15 22:59:36,204 INFO L600 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-11-15 22:59:36,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-15 22:59:36,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2019-11-15 22:59:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-15 22:59:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-11-15 22:59:36,210 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 10 [2019-11-15 22:59:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:36,210 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-11-15 22:59:36,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:59:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-11-15 22:59:36,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:59:36,211 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:36,211 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:36,211 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:36,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:36,212 INFO L82 PathProgramCache]: Analyzing trace with hash -2117695186, now seen corresponding path program 1 times [2019-11-15 22:59:36,212 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:36,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664635013] [2019-11-15 22:59:36,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:36,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:36,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:36,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664635013] [2019-11-15 22:59:36,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:36,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:59:36,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392852828] [2019-11-15 22:59:36,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:59:36,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:36,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:59:36,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:59:36,282 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 5 states. [2019-11-15 22:59:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:36,402 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-11-15 22:59:36,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:59:36,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-15 22:59:36,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:36,403 INFO L225 Difference]: With dead ends: 38 [2019-11-15 22:59:36,403 INFO L226 Difference]: Without dead ends: 38 [2019-11-15 22:59:36,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:59:36,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-15 22:59:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2019-11-15 22:59:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 22:59:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-15 22:59:36,408 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 10 [2019-11-15 22:59:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:36,409 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-15 22:59:36,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:59:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-15 22:59:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 22:59:36,410 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:36,410 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:36,410 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:36,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:36,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1259263901, now seen corresponding path program 1 times [2019-11-15 22:59:36,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:36,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092213111] [2019-11-15 22:59:36,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:36,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:36,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:36,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:36,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092213111] [2019-11-15 22:59:36,484 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:36,484 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:59:36,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209692611] [2019-11-15 22:59:36,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:59:36,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:36,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:59:36,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:59:36,486 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-11-15 22:59:36,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:36,596 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-11-15 22:59:36,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:59:36,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-15 22:59:36,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:36,598 INFO L225 Difference]: With dead ends: 30 [2019-11-15 22:59:36,598 INFO L226 Difference]: Without dead ends: 30 [2019-11-15 22:59:36,598 INFO L600 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-11-15 22:59:36,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-15 22:59:36,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-15 22:59:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 22:59:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-15 22:59:36,602 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 13 [2019-11-15 22:59:36,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:36,603 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-15 22:59:36,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:59:36,603 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-15 22:59:36,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 22:59:36,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:36,604 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:36,604 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:36,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:36,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1259263900, now seen corresponding path program 1 times [2019-11-15 22:59:36,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:36,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208175779] [2019-11-15 22:59:36,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:36,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:36,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:36,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208175779] [2019-11-15 22:59:36,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:36,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:59:36,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198003871] [2019-11-15 22:59:36,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:59:36,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:36,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:59:36,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:59:36,740 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2019-11-15 22:59:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:36,940 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-11-15 22:59:36,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:59:36,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-15 22:59:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:36,942 INFO L225 Difference]: With dead ends: 37 [2019-11-15 22:59:36,942 INFO L226 Difference]: Without dead ends: 37 [2019-11-15 22:59:36,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:59:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-15 22:59:36,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-15 22:59:36,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-15 22:59:36,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-11-15 22:59:36,948 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 13 [2019-11-15 22:59:36,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:36,948 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-11-15 22:59:36,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:59:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2019-11-15 22:59:36,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 22:59:36,949 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:36,949 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:36,950 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:36,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:36,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1143813903, now seen corresponding path program 1 times [2019-11-15 22:59:36,950 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:36,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978279458] [2019-11-15 22:59:36,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:36,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:36,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:37,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:37,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978279458] [2019-11-15 22:59:37,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297582323] [2019-11-15 22:59:37,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:37,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 22:59:37,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:59:37,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:59:37,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:37,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:37,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:37,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 22:59:37,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:37,283 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:59:37,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-11-15 22:59:37,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021871310] [2019-11-15 22:59:37,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:59:37,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:37,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:59:37,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:59:37,284 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 7 states. [2019-11-15 22:59:37,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:37,430 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-11-15 22:59:37,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:59:37,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-15 22:59:37,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:37,431 INFO L225 Difference]: With dead ends: 43 [2019-11-15 22:59:37,432 INFO L226 Difference]: Without dead ends: 43 [2019-11-15 22:59:37,432 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:59:37,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-15 22:59:37,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2019-11-15 22:59:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 22:59:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-15 22:59:37,436 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2019-11-15 22:59:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:37,437 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-15 22:59:37,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:59:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-15 22:59:37,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 22:59:37,438 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:37,438 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:37,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:37,639 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:37,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:37,640 INFO L82 PathProgramCache]: Analyzing trace with hash 228211982, now seen corresponding path program 1 times [2019-11-15 22:59:37,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:37,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012542930] [2019-11-15 22:59:37,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:37,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:37,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:37,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012542930] [2019-11-15 22:59:37,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:37,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:59:37,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890873358] [2019-11-15 22:59:37,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:59:37,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:37,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:59:37,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:59:37,782 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 9 states. [2019-11-15 22:59:38,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:38,003 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-11-15 22:59:38,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:59:38,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-15 22:59:38,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:38,005 INFO L225 Difference]: With dead ends: 44 [2019-11-15 22:59:38,005 INFO L226 Difference]: Without dead ends: 44 [2019-11-15 22:59:38,005 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:59:38,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-15 22:59:38,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-11-15 22:59:38,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-15 22:59:38,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-15 22:59:38,010 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 17 [2019-11-15 22:59:38,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:38,010 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-15 22:59:38,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:59:38,010 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-15 22:59:38,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 22:59:38,011 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:38,011 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:38,011 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:38,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:38,012 INFO L82 PathProgramCache]: Analyzing trace with hash 929276560, now seen corresponding path program 1 times [2019-11-15 22:59:38,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:38,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078147033] [2019-11-15 22:59:38,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:38,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:38,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:38,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:38,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078147033] [2019-11-15 22:59:38,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:38,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 22:59:38,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076801755] [2019-11-15 22:59:38,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:59:38,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:38,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:59:38,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:59:38,196 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 10 states. [2019-11-15 22:59:38,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:38,446 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2019-11-15 22:59:38,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:59:38,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-15 22:59:38,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:38,449 INFO L225 Difference]: With dead ends: 55 [2019-11-15 22:59:38,449 INFO L226 Difference]: Without dead ends: 55 [2019-11-15 22:59:38,450 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:59:38,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-15 22:59:38,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-11-15 22:59:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 22:59:38,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-11-15 22:59:38,455 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 17 [2019-11-15 22:59:38,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:38,455 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-11-15 22:59:38,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:59:38,455 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-11-15 22:59:38,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 22:59:38,456 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:38,456 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:38,456 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:38,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:38,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1516451273, now seen corresponding path program 1 times [2019-11-15 22:59:38,457 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:38,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844439850] [2019-11-15 22:59:38,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:38,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:38,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:38,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844439850] [2019-11-15 22:59:38,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:38,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:59:38,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34361] [2019-11-15 22:59:38,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:59:38,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:38,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:59:38,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:59:38,547 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2019-11-15 22:59:38,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:38,607 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-11-15 22:59:38,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:59:38,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-15 22:59:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:38,608 INFO L225 Difference]: With dead ends: 41 [2019-11-15 22:59:38,608 INFO L226 Difference]: Without dead ends: 24 [2019-11-15 22:59:38,608 INFO L600 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-11-15 22:59:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-15 22:59:38,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-11-15 22:59:38,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 22:59:38,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-11-15 22:59:38,610 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2019-11-15 22:59:38,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:38,610 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-11-15 22:59:38,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:59:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-11-15 22:59:38,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:59:38,611 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:38,611 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:38,611 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:38,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:38,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1650962797, now seen corresponding path program 1 times [2019-11-15 22:59:38,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:38,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150391366] [2019-11-15 22:59:38,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:38,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:38,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:38,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150391366] [2019-11-15 22:59:38,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091301748] [2019-11-15 22:59:38,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:38,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 22:59:38,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:59:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:39,039 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:59:39,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-15 22:59:39,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005011166] [2019-11-15 22:59:39,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 22:59:39,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:39,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 22:59:39,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:59:39,040 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 17 states. [2019-11-15 22:59:39,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:39,339 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-11-15 22:59:39,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:59:39,340 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2019-11-15 22:59:39,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:39,341 INFO L225 Difference]: With dead ends: 28 [2019-11-15 22:59:39,341 INFO L226 Difference]: Without dead ends: 28 [2019-11-15 22:59:39,341 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:59:39,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-15 22:59:39,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-15 22:59:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 22:59:39,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-15 22:59:39,344 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 21 [2019-11-15 22:59:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:39,344 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-15 22:59:39,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 22:59:39,344 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-15 22:59:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 22:59:39,345 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:39,345 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:39,545 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:39,545 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:39,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:39,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1692198505, now seen corresponding path program 2 times [2019-11-15 22:59:39,546 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:39,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466418232] [2019-11-15 22:59:39,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:39,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:39,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:39,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466418232] [2019-11-15 22:59:39,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62982732] [2019-11-15 22:59:39,868 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:39,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:59:39,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:59:39,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 22:59:39,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:59:40,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-15 22:59:40,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:40,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:40,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:59:40,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-11-15 22:59:40,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:59:40,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:40,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:40,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:40,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 22:59:40,273 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:40,274 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:59:40,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2019-11-15 22:59:40,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285886568] [2019-11-15 22:59:40,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 22:59:40,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:40,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 22:59:40,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-11-15 22:59:40,275 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 21 states. [2019-11-15 22:59:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:40,800 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-11-15 22:59:40,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:59:40,800 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2019-11-15 22:59:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:40,801 INFO L225 Difference]: With dead ends: 42 [2019-11-15 22:59:40,801 INFO L226 Difference]: Without dead ends: 33 [2019-11-15 22:59:40,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2019-11-15 22:59:40,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-15 22:59:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-11-15 22:59:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 22:59:40,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-11-15 22:59:40,804 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 25 [2019-11-15 22:59:40,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:40,805 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-11-15 22:59:40,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-15 22:59:40,805 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-11-15 22:59:40,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 22:59:40,805 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:40,805 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:41,006 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:41,006 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:41,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:41,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1062009716, now seen corresponding path program 3 times [2019-11-15 22:59:41,007 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:41,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939646389] [2019-11-15 22:59:41,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:41,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:41,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:41,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939646389] [2019-11-15 22:59:41,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522589341] [2019-11-15 22:59:41,199 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:41,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 22:59:41,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:59:41,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 22:59:41,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:59:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:41,474 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:59:41,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2019-11-15 22:59:41,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008271866] [2019-11-15 22:59:41,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 22:59:41,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:41,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 22:59:41,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-11-15 22:59:41,476 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 20 states. [2019-11-15 22:59:41,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:41,812 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-11-15 22:59:41,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:59:41,813 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2019-11-15 22:59:41,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:41,813 INFO L225 Difference]: With dead ends: 36 [2019-11-15 22:59:41,814 INFO L226 Difference]: Without dead ends: 36 [2019-11-15 22:59:41,814 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2019-11-15 22:59:41,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-15 22:59:41,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-11-15 22:59:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 22:59:41,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-11-15 22:59:41,817 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29 [2019-11-15 22:59:41,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:41,817 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-11-15 22:59:41,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 22:59:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-11-15 22:59:41,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:59:41,818 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:41,818 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:42,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:42,019 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:42,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:42,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1867118562, now seen corresponding path program 4 times [2019-11-15 22:59:42,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:42,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777554873] [2019-11-15 22:59:42,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:42,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:42,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:42,278 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:42,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777554873] [2019-11-15 22:59:42,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725255279] [2019-11-15 22:59:42,279 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:42,401 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:59:42,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:59:42,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-15 22:59:42,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:59:42,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:59:42,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:42,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:42,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:42,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 22:59:42,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-15 22:59:42,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:42,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:42,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:42,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-15 22:59:42,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-11-15 22:59:42,799 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:59:42,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:42,811 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:59:42,812 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:42,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2019-11-15 22:59:42,813 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:42,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:42,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:42,819 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-11-15 22:59:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:42,822 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:59:42,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2019-11-15 22:59:42,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088390365] [2019-11-15 22:59:42,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-15 22:59:42,823 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:42,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 22:59:42,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2019-11-15 22:59:42,823 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 28 states. [2019-11-15 22:59:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:43,552 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-15 22:59:43,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 22:59:43,553 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2019-11-15 22:59:43,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:43,553 INFO L225 Difference]: With dead ends: 54 [2019-11-15 22:59:43,554 INFO L226 Difference]: Without dead ends: 41 [2019-11-15 22:59:43,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=173, Invalid=1467, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 22:59:43,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-15 22:59:43,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-11-15 22:59:43,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 22:59:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-15 22:59:43,557 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 33 [2019-11-15 22:59:43,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:43,558 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-15 22:59:43,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-15 22:59:43,558 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-15 22:59:43,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 22:59:43,559 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:43,559 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:43,762 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:43,763 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:43,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:43,763 INFO L82 PathProgramCache]: Analyzing trace with hash 545438971, now seen corresponding path program 5 times [2019-11-15 22:59:43,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:43,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848199592] [2019-11-15 22:59:43,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:43,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:43,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:43,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848199592] [2019-11-15 22:59:43,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533761633] [2019-11-15 22:59:43,999 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:44,112 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-15 22:59:44,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:59:44,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-15 22:59:44,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:59:44,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:59:44,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:44,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:44,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:44,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 22:59:44,397 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:44,398 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:59:44,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2019-11-15 22:59:44,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006254200] [2019-11-15 22:59:44,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 22:59:44,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:44,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 22:59:44,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2019-11-15 22:59:44,399 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 29 states. [2019-11-15 22:59:44,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:44,962 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-11-15 22:59:44,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 22:59:44,963 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-11-15 22:59:44,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:44,964 INFO L225 Difference]: With dead ends: 44 [2019-11-15 22:59:44,964 INFO L226 Difference]: Without dead ends: 44 [2019-11-15 22:59:44,964 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=1260, Unknown=0, NotChecked=0, Total=1406 [2019-11-15 22:59:44,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-15 22:59:44,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-11-15 22:59:44,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 22:59:44,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-11-15 22:59:44,967 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 37 [2019-11-15 22:59:44,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:44,968 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-11-15 22:59:44,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 22:59:44,968 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-11-15 22:59:44,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 22:59:44,969 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:44,969 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:45,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:45,170 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:45,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:45,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1989258789, now seen corresponding path program 6 times [2019-11-15 22:59:45,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:45,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457358626] [2019-11-15 22:59:45,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:45,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:45,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:45,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457358626] [2019-11-15 22:59:45,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964819112] [2019-11-15 22:59:45,601 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:45,735 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-15 22:59:45,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:59:45,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-15 22:59:45,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:59:45,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-15 22:59:45,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:45,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:45,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:59:45,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-15 22:59:46,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:59:46,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:46,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:46,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:46,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 22:59:46,051 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:46,052 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:59:46,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 28 [2019-11-15 22:59:46,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140105305] [2019-11-15 22:59:46,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-15 22:59:46,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:46,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 22:59:46,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2019-11-15 22:59:46,053 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 28 states. [2019-11-15 22:59:47,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:47,007 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-11-15 22:59:47,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 22:59:47,008 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 41 [2019-11-15 22:59:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:47,008 INFO L225 Difference]: With dead ends: 66 [2019-11-15 22:59:47,009 INFO L226 Difference]: Without dead ends: 49 [2019-11-15 22:59:47,009 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=139, Invalid=1421, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 22:59:47,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-15 22:59:47,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-11-15 22:59:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-15 22:59:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-11-15 22:59:47,012 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 41 [2019-11-15 22:59:47,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:47,013 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-11-15 22:59:47,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-15 22:59:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-11-15 22:59:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 22:59:47,014 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:47,014 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:47,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:47,224 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:47,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:47,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1753336318, now seen corresponding path program 7 times [2019-11-15 22:59:47,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:47,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741631185] [2019-11-15 22:59:47,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:47,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:47,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 17 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:47,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741631185] [2019-11-15 22:59:47,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369649957] [2019-11-15 22:59:47,533 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:47,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-15 22:59:47,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:59:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:47,839 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:59:47,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 28 [2019-11-15 22:59:47,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297865227] [2019-11-15 22:59:47,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 22:59:47,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:47,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 22:59:47,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2019-11-15 22:59:47,841 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 29 states. [2019-11-15 22:59:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:48,467 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2019-11-15 22:59:48,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 22:59:48,467 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 45 [2019-11-15 22:59:48,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:48,468 INFO L225 Difference]: With dead ends: 52 [2019-11-15 22:59:48,468 INFO L226 Difference]: Without dead ends: 52 [2019-11-15 22:59:48,469 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=1401, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 22:59:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-15 22:59:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-11-15 22:59:48,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-15 22:59:48,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-11-15 22:59:48,472 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 45 [2019-11-15 22:59:48,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:48,473 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-11-15 22:59:48,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 22:59:48,473 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-11-15 22:59:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:59:48,474 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:48,474 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:48,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:48,687 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:48,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:48,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1584706644, now seen corresponding path program 8 times [2019-11-15 22:59:48,687 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:48,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436661012] [2019-11-15 22:59:48,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:48,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:48,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:49,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436661012] [2019-11-15 22:59:49,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740692916] [2019-11-15 22:59:49,045 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:49,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:59:49,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:59:49,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-15 22:59:49,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:59:49,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-15 22:59:49,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:49,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:49,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:59:49,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-11-15 22:59:49,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:59:49,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:49,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:49,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:49,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 22:59:49,787 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:49,787 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:59:49,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 40 [2019-11-15 22:59:49,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298295144] [2019-11-15 22:59:49,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-15 22:59:49,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:49,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-15 22:59:49,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1462, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 22:59:49,789 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 40 states. [2019-11-15 22:59:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:50,721 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-11-15 22:59:50,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 22:59:50,721 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 49 [2019-11-15 22:59:50,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:50,722 INFO L225 Difference]: With dead ends: 78 [2019-11-15 22:59:50,722 INFO L226 Difference]: Without dead ends: 57 [2019-11-15 22:59:50,723 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=196, Invalid=2666, Unknown=0, NotChecked=0, Total=2862 [2019-11-15 22:59:50,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-15 22:59:50,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2019-11-15 22:59:50,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-15 22:59:50,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-11-15 22:59:50,726 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 49 [2019-11-15 22:59:50,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:50,727 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-11-15 22:59:50,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-15 22:59:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-11-15 22:59:50,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:59:50,729 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:50,729 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:50,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:50,930 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:50,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:50,930 INFO L82 PathProgramCache]: Analyzing trace with hash 739550857, now seen corresponding path program 9 times [2019-11-15 22:59:50,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:50,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37098843] [2019-11-15 22:59:50,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:50,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:50,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 30 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:51,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37098843] [2019-11-15 22:59:51,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270797510] [2019-11-15 22:59:51,306 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:51,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-15 22:59:51,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:59:51,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-15 22:59:51,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:59:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:51,947 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:59:51,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2019-11-15 22:59:51,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963948689] [2019-11-15 22:59:51,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-15 22:59:51,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:51,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-15 22:59:51,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1612, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 22:59:51,949 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 43 states. [2019-11-15 22:59:52,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:52,603 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-15 22:59:52,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 22:59:52,603 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 53 [2019-11-15 22:59:52,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:52,604 INFO L225 Difference]: With dead ends: 60 [2019-11-15 22:59:52,604 INFO L226 Difference]: Without dead ends: 60 [2019-11-15 22:59:52,605 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=336, Invalid=2744, Unknown=0, NotChecked=0, Total=3080 [2019-11-15 22:59:52,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-15 22:59:52,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-11-15 22:59:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-15 22:59:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-11-15 22:59:52,608 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 53 [2019-11-15 22:59:52,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:52,608 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-11-15 22:59:52,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-15 22:59:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-11-15 22:59:52,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 22:59:52,609 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:52,610 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:52,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:52,812 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:52,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:52,812 INFO L82 PathProgramCache]: Analyzing trace with hash 752361651, now seen corresponding path program 10 times [2019-11-15 22:59:52,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:52,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786546737] [2019-11-15 22:59:52,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:52,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:52,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:53,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786546737] [2019-11-15 22:59:53,218 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571339854] [2019-11-15 22:59:53,218 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:53,341 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:59:53,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:59:53,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-15 22:59:53,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:59:53,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:59:53,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:53,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:53,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:53,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 22:59:53,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-15 22:59:53,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:53,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:53,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:53,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-15 22:59:54,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-11-15 22:59:54,275 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:59:54,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:54,287 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:59:54,288 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:54,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2019-11-15 22:59:54,289 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:54,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:54,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:54,302 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-11-15 22:59:54,310 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 67 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:54,310 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:59:54,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2019-11-15 22:59:54,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909644706] [2019-11-15 22:59:54,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-11-15 22:59:54,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:54,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-11-15 22:59:54,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1929, Unknown=0, NotChecked=0, Total=2070 [2019-11-15 22:59:54,312 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 46 states. [2019-11-15 22:59:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:55,862 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2019-11-15 22:59:55,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 22:59:55,862 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 57 [2019-11-15 22:59:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:55,863 INFO L225 Difference]: With dead ends: 90 [2019-11-15 22:59:55,863 INFO L226 Difference]: Without dead ends: 65 [2019-11-15 22:59:55,864 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=356, Invalid=4200, Unknown=0, NotChecked=0, Total=4556 [2019-11-15 22:59:55,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-15 22:59:55,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2019-11-15 22:59:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-15 22:59:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-11-15 22:59:55,867 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 57 [2019-11-15 22:59:55,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:55,867 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-11-15 22:59:55,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-11-15 22:59:55,867 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-11-15 22:59:55,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 22:59:55,868 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:55,868 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:56,072 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:56,072 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:56,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:56,072 INFO L82 PathProgramCache]: Analyzing trace with hash 746278544, now seen corresponding path program 11 times [2019-11-15 22:59:56,072 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:56,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343541732] [2019-11-15 22:59:56,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:56,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:56,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 47 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:56,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343541732] [2019-11-15 22:59:56,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795412761] [2019-11-15 22:59:56,482 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:56,633 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-15 22:59:56,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:59:56,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-15 22:59:56,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:59:56,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:59:56,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:56,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:56,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:56,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 22:59:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 45 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:57,108 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:59:57,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 37 [2019-11-15 22:59:57,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071525917] [2019-11-15 22:59:57,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-15 22:59:57,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:57,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-15 22:59:57,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-11-15 22:59:57,110 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 38 states. [2019-11-15 22:59:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:58,114 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-11-15 22:59:58,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 22:59:58,115 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 61 [2019-11-15 22:59:58,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:58,115 INFO L225 Difference]: With dead ends: 68 [2019-11-15 22:59:58,115 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 22:59:58,116 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=207, Invalid=2549, Unknown=0, NotChecked=0, Total=2756 [2019-11-15 22:59:58,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 22:59:58,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-15 22:59:58,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-15 22:59:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-11-15 22:59:58,118 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 61 [2019-11-15 22:59:58,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:58,119 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-11-15 22:59:58,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-15 22:59:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-11-15 22:59:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 22:59:58,119 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:58,119 INFO L380 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:58,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:58,320 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 22:59:58,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:58,320 INFO L82 PathProgramCache]: Analyzing trace with hash -905089734, now seen corresponding path program 12 times [2019-11-15 22:59:58,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:58,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204966392] [2019-11-15 22:59:58,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:58,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:58,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:58,779 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:58,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204966392] [2019-11-15 22:59:58,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710734281] [2019-11-15 22:59:58,780 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:58,913 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-15 22:59:58,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:59:58,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 77 conjunts are in the unsatisfiable core [2019-11-15 22:59:58,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:59:59,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-15 22:59:59,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:59,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:59,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:59:59,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-15 22:59:59,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:59:59,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:59,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:59,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:59,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 22:59:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:59,376 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:59:59,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 40 [2019-11-15 22:59:59,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469658190] [2019-11-15 22:59:59,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-15 22:59:59,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:59,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-15 22:59:59,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1468, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 22:59:59,379 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 40 states. [2019-11-15 23:00:01,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:01,110 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2019-11-15 23:00:01,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 23:00:01,112 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 65 [2019-11-15 23:00:01,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:01,112 INFO L225 Difference]: With dead ends: 102 [2019-11-15 23:00:01,112 INFO L226 Difference]: Without dead ends: 73 [2019-11-15 23:00:01,113 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=196, Invalid=3110, Unknown=0, NotChecked=0, Total=3306 [2019-11-15 23:00:01,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-15 23:00:01,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2019-11-15 23:00:01,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-15 23:00:01,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-11-15 23:00:01,115 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 65 [2019-11-15 23:00:01,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:01,115 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-11-15 23:00:01,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-15 23:00:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-11-15 23:00:01,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:00:01,116 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:01,116 INFO L380 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:00:01,321 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:00:01,321 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 23:00:01,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:01,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2101833239, now seen corresponding path program 13 times [2019-11-15 23:00:01,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:01,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722136850] [2019-11-15 23:00:01,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:01,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:01,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 68 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:01,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722136850] [2019-11-15 23:00:01,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818370981] [2019-11-15 23:00:01,886 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:00:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:02,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 73 conjunts are in the unsatisfiable core [2019-11-15 23:00:02,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:00:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:02,308 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:00:02,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 40 [2019-11-15 23:00:02,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267424060] [2019-11-15 23:00:02,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-15 23:00:02,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:02,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-15 23:00:02,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1475, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 23:00:02,310 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 41 states. [2019-11-15 23:00:03,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:03,544 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2019-11-15 23:00:03,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 23:00:03,545 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 69 [2019-11-15 23:00:03,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:03,546 INFO L225 Difference]: With dead ends: 76 [2019-11-15 23:00:03,546 INFO L226 Difference]: Without dead ends: 76 [2019-11-15 23:00:03,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=270, Invalid=3036, Unknown=0, NotChecked=0, Total=3306 [2019-11-15 23:00:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-15 23:00:03,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-11-15 23:00:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-15 23:00:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-11-15 23:00:03,550 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 69 [2019-11-15 23:00:03,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:03,550 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-11-15 23:00:03,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-15 23:00:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-11-15 23:00:03,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 23:00:03,553 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:03,553 INFO L380 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:00:03,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:00:03,756 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 23:00:03,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:03,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1860144831, now seen corresponding path program 14 times [2019-11-15 23:00:03,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:03,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824906679] [2019-11-15 23:00:03,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:03,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:03,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 23 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:04,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824906679] [2019-11-15 23:00:04,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952491108] [2019-11-15 23:00:04,606 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:00:04,763 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:00:04,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:00:04,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 88 conjunts are in the unsatisfiable core [2019-11-15 23:00:04,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:00:05,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-15 23:00:05,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:00:05,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:00:05,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:00:05,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-11-15 23:00:05,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 23:00:05,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:00:05,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:00:05,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:00:05,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 23:00:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 23 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:05,949 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:00:05,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 58 [2019-11-15 23:00:05,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995877469] [2019-11-15 23:00:05,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-11-15 23:00:05,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:05,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-11-15 23:00:05,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=3163, Unknown=0, NotChecked=0, Total=3306 [2019-11-15 23:00:05,951 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 58 states. [2019-11-15 23:00:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:07,769 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2019-11-15 23:00:07,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 23:00:07,769 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 73 [2019-11-15 23:00:07,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:07,770 INFO L225 Difference]: With dead ends: 114 [2019-11-15 23:00:07,770 INFO L226 Difference]: Without dead ends: 81 [2019-11-15 23:00:07,772 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=280, Invalid=5726, Unknown=0, NotChecked=0, Total=6006 [2019-11-15 23:00:07,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-15 23:00:07,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2019-11-15 23:00:07,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-15 23:00:07,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-11-15 23:00:07,774 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 73 [2019-11-15 23:00:07,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:07,775 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-11-15 23:00:07,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-11-15 23:00:07,775 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-11-15 23:00:07,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-15 23:00:07,775 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:07,775 INFO L380 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:00:07,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:00:07,978 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 23:00:07,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:07,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1768834334, now seen corresponding path program 15 times [2019-11-15 23:00:07,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:07,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789374802] [2019-11-15 23:00:07,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:07,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:07,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 93 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:08,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789374802] [2019-11-15 23:00:08,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256457846] [2019-11-15 23:00:08,795 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:00:08,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-11-15 23:00:08,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:00:08,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 72 conjunts are in the unsatisfiable core [2019-11-15 23:00:08,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:00:08,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:00:08,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:00:08,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:00:08,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:00:08,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 23:00:09,970 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 91 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:09,971 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:00:09,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 59 [2019-11-15 23:00:09,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026875561] [2019-11-15 23:00:09,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-11-15 23:00:09,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:09,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-11-15 23:00:09,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=3245, Unknown=0, NotChecked=0, Total=3540 [2019-11-15 23:00:09,973 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 60 states. [2019-11-15 23:00:11,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:11,782 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-11-15 23:00:11,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 23:00:11,782 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 77 [2019-11-15 23:00:11,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:11,783 INFO L225 Difference]: With dead ends: 84 [2019-11-15 23:00:11,783 INFO L226 Difference]: Without dead ends: 84 [2019-11-15 23:00:11,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1436 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=547, Invalid=5615, Unknown=0, NotChecked=0, Total=6162 [2019-11-15 23:00:11,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-15 23:00:11,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-11-15 23:00:11,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-15 23:00:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2019-11-15 23:00:11,788 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 77 [2019-11-15 23:00:11,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:11,788 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2019-11-15 23:00:11,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-11-15 23:00:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2019-11-15 23:00:11,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 23:00:11,789 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:11,789 INFO L380 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:00:11,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:00:11,990 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 23:00:11,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:11,990 INFO L82 PathProgramCache]: Analyzing trace with hash -798593848, now seen corresponding path program 16 times [2019-11-15 23:00:11,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:11,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527968444] [2019-11-15 23:00:11,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:11,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:11,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:12,991 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 26 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:12,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527968444] [2019-11-15 23:00:12,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870768035] [2019-11-15 23:00:12,991 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:00:13,124 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 23:00:13,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:00:13,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 75 conjunts are in the unsatisfiable core [2019-11-15 23:00:13,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:00:13,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:00:13,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:00:13,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:00:13,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:00:13,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 23:00:13,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-15 23:00:13,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:00:13,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:00:13,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:00:13,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-15 23:00:14,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-11-15 23:00:14,813 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:00:14,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:00:14,829 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:00:14,830 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:00:14,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2019-11-15 23:00:14,831 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:00:14,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:00:14,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:00:14,837 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-11-15 23:00:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 154 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:14,855 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:00:14,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 64 [2019-11-15 23:00:14,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571231937] [2019-11-15 23:00:14,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-11-15 23:00:14,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:14,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-11-15 23:00:14,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=3789, Unknown=0, NotChecked=0, Total=4032 [2019-11-15 23:00:14,857 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 64 states. [2019-11-15 23:00:17,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:17,677 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2019-11-15 23:00:17,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-15 23:00:17,679 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 81 [2019-11-15 23:00:17,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:17,680 INFO L225 Difference]: With dead ends: 126 [2019-11-15 23:00:17,680 INFO L226 Difference]: Without dead ends: 89 [2019-11-15 23:00:17,681 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=602, Invalid=8328, Unknown=0, NotChecked=0, Total=8930 [2019-11-15 23:00:17,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-15 23:00:17,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-11-15 23:00:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-15 23:00:17,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-11-15 23:00:17,683 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 81 [2019-11-15 23:00:17,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:17,683 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-11-15 23:00:17,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-11-15 23:00:17,684 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-11-15 23:00:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 23:00:17,684 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:17,685 INFO L380 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:00:17,885 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:00:17,886 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 23:00:17,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:17,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1917129637, now seen corresponding path program 17 times [2019-11-15 23:00:17,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:17,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334710056] [2019-11-15 23:00:17,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:17,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:17,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 122 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:18,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334710056] [2019-11-15 23:00:18,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530929541] [2019-11-15 23:00:18,600 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:00:18,760 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-11-15 23:00:18,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:00:18,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 98 conjunts are in the unsatisfiable core [2019-11-15 23:00:18,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:00:18,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:00:18,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:00:18,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:00:18,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:00:18,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 23:00:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 120 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:19,492 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:00:19,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31] total 52 [2019-11-15 23:00:19,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941339117] [2019-11-15 23:00:19,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-11-15 23:00:19,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:19,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-11-15 23:00:19,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2588, Unknown=0, NotChecked=0, Total=2756 [2019-11-15 23:00:19,493 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 53 states. [2019-11-15 23:00:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:21,154 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2019-11-15 23:00:21,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 23:00:21,155 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 85 [2019-11-15 23:00:21,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:21,156 INFO L225 Difference]: With dead ends: 92 [2019-11-15 23:00:21,156 INFO L226 Difference]: Without dead ends: 92 [2019-11-15 23:00:21,156 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1370 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=309, Invalid=5093, Unknown=0, NotChecked=0, Total=5402 [2019-11-15 23:00:21,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-15 23:00:21,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2019-11-15 23:00:21,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-15 23:00:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2019-11-15 23:00:21,159 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 85 [2019-11-15 23:00:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:21,160 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2019-11-15 23:00:21,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-11-15 23:00:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2019-11-15 23:00:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 23:00:21,161 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:21,161 INFO L380 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:00:21,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:00:21,364 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2019-11-15 23:00:21,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:21,365 INFO L82 PathProgramCache]: Analyzing trace with hash -594239537, now seen corresponding path program 18 times [2019-11-15 23:00:21,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:21,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722092709] [2019-11-15 23:00:21,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:21,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:21,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 29 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:22,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722092709] [2019-11-15 23:00:22,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898355067] [2019-11-15 23:00:22,173 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:00:22,372 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-11-15 23:00:22,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:00:22,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-15 23:00:22,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:00:22,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:00:22,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:00:22,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:00:22,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:00:22,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:00:22,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-15 23:00:22,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:00:22,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:00:22,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:00:22,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-11-15 23:00:22,670 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:00:22,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2019-11-15 23:00:22,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 23:00:22,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:00:22,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:00:22,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:00:22,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:27 [2019-11-15 23:00:22,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:00:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-11-15 23:00:23,006 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:00:23,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 9] total 45 [2019-11-15 23:00:23,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947985991] [2019-11-15 23:00:23,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-15 23:00:23,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:23,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-15 23:00:23,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1891, Unknown=0, NotChecked=0, Total=1980 [2019-11-15 23:00:23,009 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 45 states. [2019-11-15 23:00:28,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:28,436 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2019-11-15 23:00:28,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-11-15 23:00:28,437 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 89 [2019-11-15 23:00:28,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:28,437 INFO L225 Difference]: With dead ends: 137 [2019-11-15 23:00:28,437 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:00:28,438 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=812, Invalid=10318, Unknown=0, NotChecked=0, Total=11130 [2019-11-15 23:00:28,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:00:28,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:00:28,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:00:28,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:00:28,438 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2019-11-15 23:00:28,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:28,439 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:00:28,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-15 23:00:28,439 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:00:28,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:00:28,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:00:28,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:00:28 BoogieIcfgContainer [2019-11-15 23:00:28,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:00:28,643 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:00:28,643 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:00:28,643 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:00:28,644 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:59:35" (3/4) ... [2019-11-15 23:00:28,647 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:00:28,652 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-15 23:00:28,652 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-15 23:00:28,652 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-15 23:00:28,653 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-15 23:00:28,653 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-15 23:00:28,653 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-15 23:00:28,653 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure strlen_rec [2019-11-15 23:00:28,653 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-15 23:00:28,657 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-11-15 23:00:28,657 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 23:00:28,657 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:00:28,694 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b082c996-7943-4eda-949f-8d6e2970dc14/bin/uautomizer/witness.graphml [2019-11-15 23:00:28,694 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:00:28,695 INFO L168 Benchmark]: Toolchain (without parser) took 54347.88 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 540.5 MB). Free memory was 938.0 MB in the beginning and 1.2 GB in the end (delta: -222.2 MB). Peak memory consumption was 318.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:00:28,696 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:00:28,696 INFO L168 Benchmark]: CACSL2BoogieTranslator took 515.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:00:28,697 INFO L168 Benchmark]: Boogie Preprocessor took 47.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:00:28,697 INFO L168 Benchmark]: RCFGBuilder took 528.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:00:28,697 INFO L168 Benchmark]: TraceAbstraction took 53201.65 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 395.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.0 MB). Peak memory consumption was 309.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:00:28,698 INFO L168 Benchmark]: Witness Printer took 51.23 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:00:28,699 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 515.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 528.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53201.65 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 395.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.0 MB). Peak memory consumption was 309.4 MB. Max. memory is 11.5 GB. * Witness Printer took 51.23 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 529]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 515]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 515]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 48 locations, 7 error locations. Result: SAFE, OverallTime: 53.1s, OverallIterations: 28, TraceHistogramMax: 11, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 626 SDtfs, 1767 SDslu, 4645 SDs, 0 SdLazy, 23486 SolverSat, 354 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1846 GetRequests, 774 SyntacticMatches, 24 SemanticMatches, 1048 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11087 ImplicationChecksByTransitivity, 29.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=27, 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, 28 MinimizatonAttempts, 81 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 19.5s InterpolantComputationTime, 2126 NumberOfCodeBlocks, 2108 NumberOfCodeBlocksAsserted, 104 NumberOfCheckSat, 2079 ConstructedInterpolants, 58 QuantifiedInterpolants, 1187907 SizeOfPredicates, 299 NumberOfNonLiveVariables, 3811 ConjunctsInSsa, 1028 ConjunctsInUnsatCore, 47 InterpolantComputations, 9 PerfectInterpolantSequences, 1545/4784 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...