./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/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 7d00aad8dfdafc20547a229a92ab2c2bdb101f8c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 17:03:41,485 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 17:03:41,485 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 17:03:41,494 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 17:03:41,494 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 17:03:41,495 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 17:03:41,495 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 17:03:41,496 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 17:03:41,498 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 17:03:41,498 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 17:03:41,499 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 17:03:41,499 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 17:03:41,500 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 17:03:41,500 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 17:03:41,501 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 17:03:41,502 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 17:03:41,502 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 17:03:41,504 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 17:03:41,505 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 17:03:41,506 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 17:03:41,507 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 17:03:41,508 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 17:03:41,509 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 17:03:41,510 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 17:03:41,510 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 17:03:41,510 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 17:03:41,511 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 17:03:41,512 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 17:03:41,512 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 17:03:41,513 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 17:03:41,513 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 17:03:41,514 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 17:03:41,514 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 17:03:41,514 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 17:03:41,515 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 17:03:41,515 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 17:03:41,516 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-01 17:03:41,526 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 17:03:41,526 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 17:03:41,526 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 17:03:41,527 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 17:03:41,527 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 17:03:41,527 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 17:03:41,527 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 17:03:41,528 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 17:03:41,528 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 17:03:41,528 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 17:03:41,528 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 17:03:41,528 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 17:03:41,528 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 17:03:41,528 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-01 17:03:41,529 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-01 17:03:41,529 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-01 17:03:41,529 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 17:03:41,529 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 17:03:41,529 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 17:03:41,529 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 17:03:41,530 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 17:03:41,530 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 17:03:41,530 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 17:03:41,530 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 17:03:41,530 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 17:03:41,530 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 17:03:41,531 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 17:03:41,531 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 17:03:41,531 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/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 -> 7d00aad8dfdafc20547a229a92ab2c2bdb101f8c [2018-12-01 17:03:41,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 17:03:41,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 17:03:41,563 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 17:03:41,564 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 17:03:41,564 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 17:03:41,564 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-12-01 17:03:41,600 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/data/3916f6fe1/8469818afa8d49d0bb9ac81748df7ffd/FLAG291525885 [2018-12-01 17:03:41,901 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 17:03:41,902 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-12-01 17:03:41,909 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/data/3916f6fe1/8469818afa8d49d0bb9ac81748df7ffd/FLAG291525885 [2018-12-01 17:03:41,918 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/data/3916f6fe1/8469818afa8d49d0bb9ac81748df7ffd [2018-12-01 17:03:41,920 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 17:03:41,921 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-01 17:03:41,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 17:03:41,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 17:03:41,923 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 17:03:41,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:03:41" (1/1) ... [2018-12-01 17:03:41,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30e9e067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:03:41, skipping insertion in model container [2018-12-01 17:03:41,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:03:41" (1/1) ... [2018-12-01 17:03:41,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 17:03:41,948 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 17:03:42,090 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:03:42,096 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 17:03:42,151 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:03:42,171 INFO L195 MainTranslator]: Completed translation [2018-12-01 17:03:42,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:03:42 WrapperNode [2018-12-01 17:03:42,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 17:03:42,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 17:03:42,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 17:03:42,172 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 17:03:42,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:03:42" (1/1) ... [2018-12-01 17:03:42,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:03:42" (1/1) ... [2018-12-01 17:03:42,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:03:42" (1/1) ... [2018-12-01 17:03:42,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:03:42" (1/1) ... [2018-12-01 17:03:42,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:03:42" (1/1) ... [2018-12-01 17:03:42,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:03:42" (1/1) ... [2018-12-01 17:03:42,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:03:42" (1/1) ... [2018-12-01 17:03:42,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 17:03:42,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 17:03:42,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 17:03:42,200 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 17:03:42,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:03:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/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 [2018-12-01 17:03:42,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 17:03:42,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 17:03:42,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-01 17:03:42,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-01 17:03:42,232 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2018-12-01 17:03:42,232 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 17:03:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-01 17:03:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-01 17:03:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-01 17:03:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-01 17:03:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-01 17:03:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-01 17:03:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-01 17:03:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-01 17:03:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-01 17:03:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-01 17:03:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-01 17:03:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-01 17:03:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-01 17:03:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-01 17:03:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-01 17:03:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-01 17:03:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-01 17:03:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-01 17:03:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-01 17:03:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-01 17:03:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-01 17:03:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-01 17:03:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-01 17:03:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-01 17:03:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-01 17:03:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-01 17:03:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-01 17:03:42,235 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-01 17:03:42,235 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-01 17:03:42,235 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-01 17:03:42,235 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-01 17:03:42,235 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-01 17:03:42,235 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-01 17:03:42,235 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-01 17:03:42,235 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-01 17:03:42,235 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-01 17:03:42,235 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-01 17:03:42,236 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-01 17:03:42,236 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-01 17:03:42,236 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-01 17:03:42,236 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-01 17:03:42,236 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-01 17:03:42,236 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-01 17:03:42,236 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-01 17:03:42,236 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-01 17:03:42,236 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-01 17:03:42,236 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-01 17:03:42,236 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-01 17:03:42,237 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-01 17:03:42,237 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-01 17:03:42,237 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-01 17:03:42,237 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-01 17:03:42,237 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-01 17:03:42,237 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-01 17:03:42,237 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-01 17:03:42,237 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-01 17:03:42,237 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-01 17:03:42,237 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-01 17:03:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-01 17:03:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-01 17:03:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-01 17:03:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-01 17:03:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-01 17:03:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-01 17:03:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-01 17:03:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-01 17:03:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-01 17:03:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-01 17:03:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-01 17:03:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-01 17:03:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-01 17:03:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-01 17:03:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-01 17:03:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-01 17:03:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-01 17:03:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-01 17:03:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-01 17:03:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-01 17:03:42,240 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-01 17:03:42,240 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-01 17:03:42,240 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-01 17:03:42,240 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-01 17:03:42,240 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-01 17:03:42,240 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-01 17:03:42,240 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-01 17:03:42,240 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-01 17:03:42,240 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-01 17:03:42,240 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-01 17:03:42,241 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-01 17:03:42,241 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-01 17:03:42,241 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-01 17:03:42,241 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-01 17:03:42,241 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-01 17:03:42,241 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-01 17:03:42,241 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-01 17:03:42,241 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-01 17:03:42,241 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-01 17:03:42,241 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-01 17:03:42,241 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-01 17:03:42,242 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-01 17:03:42,242 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-01 17:03:42,242 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-01 17:03:42,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-01 17:03:42,242 INFO L130 BoogieDeclarations]: Found specification of procedure cstrlcpy [2018-12-01 17:03:42,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 17:03:42,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 17:03:42,242 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 17:03:42,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 17:03:42,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 17:03:42,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 17:03:42,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 17:03:42,461 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 17:03:42,461 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-01 17:03:42,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:03:42 BoogieIcfgContainer [2018-12-01 17:03:42,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 17:03:42,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 17:03:42,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 17:03:42,464 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 17:03:42,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 05:03:41" (1/3) ... [2018-12-01 17:03:42,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65884e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 05:03:42, skipping insertion in model container [2018-12-01 17:03:42,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:03:42" (2/3) ... [2018-12-01 17:03:42,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65884e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 05:03:42, skipping insertion in model container [2018-12-01 17:03:42,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:03:42" (3/3) ... [2018-12-01 17:03:42,466 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-12-01 17:03:42,472 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 17:03:42,477 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-12-01 17:03:42,486 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-12-01 17:03:42,500 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 17:03:42,501 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 17:03:42,501 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-01 17:03:42,501 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 17:03:42,501 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 17:03:42,501 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 17:03:42,501 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 17:03:42,501 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 17:03:42,501 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 17:03:42,509 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-12-01 17:03:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 17:03:42,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:42,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:42,516 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:42,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:42,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1443993176, now seen corresponding path program 1 times [2018-12-01 17:03:42,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:42,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:42,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:42,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:42,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:42,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:42,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 17:03:42,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 17:03:42,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 17:03:42,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 17:03:42,631 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-12-01 17:03:42,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:42,660 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-12-01 17:03:42,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 17:03:42,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-01 17:03:42,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:42,666 INFO L225 Difference]: With dead ends: 45 [2018-12-01 17:03:42,667 INFO L226 Difference]: Without dead ends: 42 [2018-12-01 17:03:42,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 17:03:42,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-01 17:03:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-01 17:03:42,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-01 17:03:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-12-01 17:03:42,688 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 10 [2018-12-01 17:03:42,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:42,688 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-12-01 17:03:42,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 17:03:42,688 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-12-01 17:03:42,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 17:03:42,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:42,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:42,689 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:42,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:42,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1443993175, now seen corresponding path program 1 times [2018-12-01 17:03:42,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:42,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:42,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:42,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:42,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:42,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:42,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 17:03:42,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 17:03:42,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 17:03:42,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 17:03:42,732 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 4 states. [2018-12-01 17:03:42,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:42,748 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-12-01 17:03:42,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 17:03:42,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-01 17:03:42,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:42,749 INFO L225 Difference]: With dead ends: 41 [2018-12-01 17:03:42,749 INFO L226 Difference]: Without dead ends: 41 [2018-12-01 17:03:42,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 17:03:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-01 17:03:42,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-01 17:03:42,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-01 17:03:42,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-12-01 17:03:42,752 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 10 [2018-12-01 17:03:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:42,752 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-12-01 17:03:42,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 17:03:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-12-01 17:03:42,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 17:03:42,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:42,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:42,753 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:42,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:42,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1814115442, now seen corresponding path program 1 times [2018-12-01 17:03:42,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:42,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:42,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:42,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:42,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:42,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:42,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 17:03:42,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 17:03:42,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 17:03:42,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 17:03:42,776 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 3 states. [2018-12-01 17:03:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:42,793 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-12-01 17:03:42,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 17:03:42,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-01 17:03:42,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:42,794 INFO L225 Difference]: With dead ends: 40 [2018-12-01 17:03:42,794 INFO L226 Difference]: Without dead ends: 40 [2018-12-01 17:03:42,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 17:03:42,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-01 17:03:42,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-01 17:03:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-01 17:03:42,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-12-01 17:03:42,796 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 11 [2018-12-01 17:03:42,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:42,796 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-12-01 17:03:42,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 17:03:42,797 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-12-01 17:03:42,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 17:03:42,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:42,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:42,797 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:42,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:42,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1814115441, now seen corresponding path program 1 times [2018-12-01 17:03:42,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:42,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:42,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:42,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:42,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:42,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:42,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 17:03:42,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 17:03:42,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 17:03:42,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 17:03:42,834 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 4 states. [2018-12-01 17:03:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:42,843 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-12-01 17:03:42,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 17:03:42,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-01 17:03:42,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:42,844 INFO L225 Difference]: With dead ends: 39 [2018-12-01 17:03:42,844 INFO L226 Difference]: Without dead ends: 39 [2018-12-01 17:03:42,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 17:03:42,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-01 17:03:42,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-01 17:03:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-01 17:03:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-12-01 17:03:42,847 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 11 [2018-12-01 17:03:42,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:42,847 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-12-01 17:03:42,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 17:03:42,847 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-12-01 17:03:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-01 17:03:42,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:42,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:42,847 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:42,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:42,848 INFO L82 PathProgramCache]: Analyzing trace with hash 219743670, now seen corresponding path program 1 times [2018-12-01 17:03:42,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:42,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:42,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:42,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:42,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:42,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:42,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 17:03:42,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 17:03:42,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 17:03:42,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:03:42,886 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 6 states. [2018-12-01 17:03:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:42,937 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-12-01 17:03:42,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 17:03:42,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-01 17:03:42,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:42,938 INFO L225 Difference]: With dead ends: 38 [2018-12-01 17:03:42,938 INFO L226 Difference]: Without dead ends: 38 [2018-12-01 17:03:42,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 17:03:42,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-01 17:03:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-01 17:03:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-01 17:03:42,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-12-01 17:03:42,940 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 17 [2018-12-01 17:03:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:42,941 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-12-01 17:03:42,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 17:03:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-12-01 17:03:42,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-01 17:03:42,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:42,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:42,941 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:42,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:42,942 INFO L82 PathProgramCache]: Analyzing trace with hash 219743671, now seen corresponding path program 1 times [2018-12-01 17:03:42,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:42,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:42,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:42,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:42,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:43,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:43,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 17:03:43,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 17:03:43,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 17:03:43,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-01 17:03:43,004 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 8 states. [2018-12-01 17:03:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:43,078 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-12-01 17:03:43,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 17:03:43,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-12-01 17:03:43,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:43,080 INFO L225 Difference]: With dead ends: 54 [2018-12-01 17:03:43,080 INFO L226 Difference]: Without dead ends: 54 [2018-12-01 17:03:43,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-01 17:03:43,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-01 17:03:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2018-12-01 17:03:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-01 17:03:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-12-01 17:03:43,083 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 17 [2018-12-01 17:03:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:43,083 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-12-01 17:03:43,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 17:03:43,084 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-12-01 17:03:43,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-01 17:03:43,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:43,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:43,084 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:43,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:43,084 INFO L82 PathProgramCache]: Analyzing trace with hash 220542997, now seen corresponding path program 1 times [2018-12-01 17:03:43,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:43,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:43,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:43,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:43,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:43,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 17:03:43,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:03:43,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:03:43,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:03:43,117 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 5 states. [2018-12-01 17:03:43,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:43,155 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-12-01 17:03:43,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 17:03:43,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-01 17:03:43,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:43,156 INFO L225 Difference]: With dead ends: 40 [2018-12-01 17:03:43,156 INFO L226 Difference]: Without dead ends: 40 [2018-12-01 17:03:43,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:03:43,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-01 17:03:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-01 17:03:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-01 17:03:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-12-01 17:03:43,159 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 17 [2018-12-01 17:03:43,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:43,159 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-12-01 17:03:43,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:03:43,159 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-12-01 17:03:43,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-01 17:03:43,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:43,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:43,160 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:43,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:43,160 INFO L82 PathProgramCache]: Analyzing trace with hash 220542998, now seen corresponding path program 1 times [2018-12-01 17:03:43,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:43,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:43,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:43,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:43,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:43,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 17:03:43,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:03:43,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:03:43,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:03:43,201 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 5 states. [2018-12-01 17:03:43,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:43,226 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2018-12-01 17:03:43,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 17:03:43,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-01 17:03:43,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:43,227 INFO L225 Difference]: With dead ends: 72 [2018-12-01 17:03:43,227 INFO L226 Difference]: Without dead ends: 72 [2018-12-01 17:03:43,227 INFO L631 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 [2018-12-01 17:03:43,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-01 17:03:43,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2018-12-01 17:03:43,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-01 17:03:43,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2018-12-01 17:03:43,231 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 17 [2018-12-01 17:03:43,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:43,231 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2018-12-01 17:03:43,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:03:43,231 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2018-12-01 17:03:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-01 17:03:43,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:43,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:43,232 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:43,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:43,232 INFO L82 PathProgramCache]: Analyzing trace with hash -172484012, now seen corresponding path program 1 times [2018-12-01 17:03:43,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:43,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:43,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:43,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:43,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:43,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 17:03:43,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 17:03:43,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 17:03:43,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:03:43,284 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand 7 states. [2018-12-01 17:03:43,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:43,344 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2018-12-01 17:03:43,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 17:03:43,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-01 17:03:43,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:43,345 INFO L225 Difference]: With dead ends: 83 [2018-12-01 17:03:43,345 INFO L226 Difference]: Without dead ends: 83 [2018-12-01 17:03:43,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-01 17:03:43,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-01 17:03:43,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2018-12-01 17:03:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-01 17:03:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2018-12-01 17:03:43,349 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 17 [2018-12-01 17:03:43,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:43,349 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2018-12-01 17:03:43,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 17:03:43,349 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2018-12-01 17:03:43,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 17:03:43,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:43,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:43,350 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:43,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:43,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1777880833, now seen corresponding path program 1 times [2018-12-01 17:03:43,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:43,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:43,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:43,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:43,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:43,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:43,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 17:03:43,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 17:03:43,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 17:03:43,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:03:43,377 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand 6 states. [2018-12-01 17:03:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:43,424 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2018-12-01 17:03:43,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 17:03:43,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-01 17:03:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:43,425 INFO L225 Difference]: With dead ends: 68 [2018-12-01 17:03:43,425 INFO L226 Difference]: Without dead ends: 68 [2018-12-01 17:03:43,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 17:03:43,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-01 17:03:43,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-01 17:03:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-01 17:03:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 91 transitions. [2018-12-01 17:03:43,430 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 91 transitions. Word has length 18 [2018-12-01 17:03:43,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:43,430 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 91 transitions. [2018-12-01 17:03:43,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 17:03:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 91 transitions. [2018-12-01 17:03:43,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 17:03:43,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:43,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:43,431 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:43,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:43,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1777880832, now seen corresponding path program 1 times [2018-12-01 17:03:43,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:43,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:43,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:43,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:43,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:43,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 17:03:43,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 17:03:43,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 17:03:43,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-01 17:03:43,506 INFO L87 Difference]: Start difference. First operand 68 states and 91 transitions. Second operand 8 states. [2018-12-01 17:03:43,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:43,574 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2018-12-01 17:03:43,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 17:03:43,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-01 17:03:43,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:43,575 INFO L225 Difference]: With dead ends: 86 [2018-12-01 17:03:43,575 INFO L226 Difference]: Without dead ends: 86 [2018-12-01 17:03:43,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-01 17:03:43,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-01 17:03:43,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2018-12-01 17:03:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-01 17:03:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 93 transitions. [2018-12-01 17:03:43,579 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 93 transitions. Word has length 18 [2018-12-01 17:03:43,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:43,579 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 93 transitions. [2018-12-01 17:03:43,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 17:03:43,579 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2018-12-01 17:03:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 17:03:43,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:43,580 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:43,580 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:43,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:43,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1052032004, now seen corresponding path program 1 times [2018-12-01 17:03:43,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:43,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:43,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:43,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:43,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:43,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:43,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 17:03:43,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 17:03:43,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 17:03:43,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:03:43,605 INFO L87 Difference]: Start difference. First operand 70 states and 93 transitions. Second operand 6 states. [2018-12-01 17:03:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:43,660 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2018-12-01 17:03:43,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 17:03:43,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-01 17:03:43,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:43,661 INFO L225 Difference]: With dead ends: 69 [2018-12-01 17:03:43,661 INFO L226 Difference]: Without dead ends: 69 [2018-12-01 17:03:43,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 17:03:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-01 17:03:43,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-01 17:03:43,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-01 17:03:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2018-12-01 17:03:43,664 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 18 [2018-12-01 17:03:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:43,664 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2018-12-01 17:03:43,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 17:03:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2018-12-01 17:03:43,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 17:03:43,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:43,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:43,665 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:43,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:43,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1052032003, now seen corresponding path program 1 times [2018-12-01 17:03:43,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:43,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:43,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:43,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:43,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:43,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:43,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 17:03:43,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 17:03:43,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 17:03:43,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-01 17:03:43,706 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand 8 states. [2018-12-01 17:03:43,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:43,768 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2018-12-01 17:03:43,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 17:03:43,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-01 17:03:43,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:43,769 INFO L225 Difference]: With dead ends: 81 [2018-12-01 17:03:43,769 INFO L226 Difference]: Without dead ends: 81 [2018-12-01 17:03:43,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-01 17:03:43,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-01 17:03:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2018-12-01 17:03:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-01 17:03:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 95 transitions. [2018-12-01 17:03:43,774 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 95 transitions. Word has length 18 [2018-12-01 17:03:43,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:43,774 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 95 transitions. [2018-12-01 17:03:43,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 17:03:43,774 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2018-12-01 17:03:43,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-01 17:03:43,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:43,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:43,775 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:43,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:43,775 INFO L82 PathProgramCache]: Analyzing trace with hash -922088297, now seen corresponding path program 1 times [2018-12-01 17:03:43,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:43,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:43,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:43,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:43,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:43,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 17:03:43,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 17:03:43,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 17:03:43,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 17:03:43,789 INFO L87 Difference]: Start difference. First operand 73 states and 95 transitions. Second operand 3 states. [2018-12-01 17:03:43,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:43,796 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-12-01 17:03:43,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 17:03:43,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-01 17:03:43,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:43,797 INFO L225 Difference]: With dead ends: 80 [2018-12-01 17:03:43,797 INFO L226 Difference]: Without dead ends: 80 [2018-12-01 17:03:43,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 17:03:43,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-01 17:03:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-12-01 17:03:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-01 17:03:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2018-12-01 17:03:43,802 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 20 [2018-12-01 17:03:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:43,802 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2018-12-01 17:03:43,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 17:03:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2018-12-01 17:03:43,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-01 17:03:43,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:43,803 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:43,803 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:43,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:43,803 INFO L82 PathProgramCache]: Analyzing trace with hash -709046688, now seen corresponding path program 1 times [2018-12-01 17:03:43,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:43,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:43,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:43,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-01 17:03:43,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:43,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 17:03:43,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 17:03:43,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 17:03:43,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:03:43,863 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand 6 states. [2018-12-01 17:03:43,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:43,895 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2018-12-01 17:03:43,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 17:03:43,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-01 17:03:43,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:43,896 INFO L225 Difference]: With dead ends: 73 [2018-12-01 17:03:43,896 INFO L226 Difference]: Without dead ends: 73 [2018-12-01 17:03:43,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:03:43,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-01 17:03:43,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2018-12-01 17:03:43,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-01 17:03:43,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-12-01 17:03:43,898 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 21 [2018-12-01 17:03:43,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:43,899 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-12-01 17:03:43,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 17:03:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-12-01 17:03:43,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 17:03:43,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:43,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:43,899 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:43,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:43,900 INFO L82 PathProgramCache]: Analyzing trace with hash -567068546, now seen corresponding path program 1 times [2018-12-01 17:03:43,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:43,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:43,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:43,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:43,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:43,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:43,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 17:03:43,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 17:03:43,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 17:03:43,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 17:03:43,958 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 4 states. [2018-12-01 17:03:43,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:43,995 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-12-01 17:03:43,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 17:03:43,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-01 17:03:43,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:43,996 INFO L225 Difference]: With dead ends: 43 [2018-12-01 17:03:43,996 INFO L226 Difference]: Without dead ends: 38 [2018-12-01 17:03:43,996 INFO L631 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 [2018-12-01 17:03:43,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-01 17:03:43,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-01 17:03:43,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-01 17:03:43,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-12-01 17:03:43,997 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 22 [2018-12-01 17:03:43,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:43,998 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-12-01 17:03:43,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 17:03:43,998 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-12-01 17:03:43,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 17:03:43,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:43,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:43,998 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:43,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:43,998 INFO L82 PathProgramCache]: Analyzing trace with hash -122260724, now seen corresponding path program 1 times [2018-12-01 17:03:43,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:43,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:43,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:43,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:43,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:44,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:44,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 17:03:44,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 17:03:44,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 17:03:44,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:03:44,079 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 7 states. [2018-12-01 17:03:44,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:44,129 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-12-01 17:03:44,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 17:03:44,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-01 17:03:44,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:44,129 INFO L225 Difference]: With dead ends: 55 [2018-12-01 17:03:44,129 INFO L226 Difference]: Without dead ends: 55 [2018-12-01 17:03:44,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-01 17:03:44,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-01 17:03:44,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2018-12-01 17:03:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-01 17:03:44,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-12-01 17:03:44,131 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 22 [2018-12-01 17:03:44,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:44,131 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-12-01 17:03:44,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 17:03:44,131 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-12-01 17:03:44,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 17:03:44,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:44,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:44,131 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:44,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:44,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1402124402, now seen corresponding path program 1 times [2018-12-01 17:03:44,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:44,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:44,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:44,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:44,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:44,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:44,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:44,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 17:03:44,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 17:03:44,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 17:03:44,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-01 17:03:44,235 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 8 states. [2018-12-01 17:03:44,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:44,372 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-12-01 17:03:44,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 17:03:44,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-01 17:03:44,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:44,373 INFO L225 Difference]: With dead ends: 56 [2018-12-01 17:03:44,373 INFO L226 Difference]: Without dead ends: 56 [2018-12-01 17:03:44,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-12-01 17:03:44,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-01 17:03:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-12-01 17:03:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-01 17:03:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-12-01 17:03:44,374 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-12-01 17:03:44,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:44,374 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-12-01 17:03:44,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 17:03:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-12-01 17:03:44,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 17:03:44,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:44,375 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:44,376 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:44,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:44,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1402089581, now seen corresponding path program 1 times [2018-12-01 17:03:44,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:44,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:44,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:44,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:44,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:44,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:44,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 17:03:44,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 17:03:44,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 17:03:44,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-01 17:03:44,465 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-12-01 17:03:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:44,524 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-12-01 17:03:44,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 17:03:44,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-12-01 17:03:44,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:44,525 INFO L225 Difference]: With dead ends: 84 [2018-12-01 17:03:44,525 INFO L226 Difference]: Without dead ends: 84 [2018-12-01 17:03:44,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-01 17:03:44,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-01 17:03:44,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 64. [2018-12-01 17:03:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-01 17:03:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-12-01 17:03:44,527 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 22 [2018-12-01 17:03:44,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:44,527 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-12-01 17:03:44,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 17:03:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-12-01 17:03:44,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 17:03:44,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:44,528 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:44,528 INFO L423 AbstractCegarLoop]: === Iteration 20 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:44,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:44,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1871809361, now seen corresponding path program 1 times [2018-12-01 17:03:44,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:44,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:44,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:44,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:44,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:44,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:03:44,660 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:03:44,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:44,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:03:44,719 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 17:03:44,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 17:03:44,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 17:03:44,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:03:44,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:44,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-01 17:03:44,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-01 17:03:44,771 INFO L478 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 12 treesize of output 11 [2018-12-01 17:03:44,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:44,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:44,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:44,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-01 17:03:44,827 INFO L478 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 21 treesize of output 17 [2018-12-01 17:03:44,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-12-01 17:03:44,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 17:03:44,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:03:44,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:03:44,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-12-01 17:03:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:44,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:03:44,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-12-01 17:03:44,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-01 17:03:44,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-01 17:03:44,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-12-01 17:03:44,896 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 17 states. [2018-12-01 17:03:45,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:45,174 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2018-12-01 17:03:45,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 17:03:45,174 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2018-12-01 17:03:45,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:45,175 INFO L225 Difference]: With dead ends: 76 [2018-12-01 17:03:45,175 INFO L226 Difference]: Without dead ends: 76 [2018-12-01 17:03:45,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-12-01 17:03:45,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-01 17:03:45,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2018-12-01 17:03:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-01 17:03:45,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2018-12-01 17:03:45,177 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 22 [2018-12-01 17:03:45,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:45,177 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2018-12-01 17:03:45,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-01 17:03:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2018-12-01 17:03:45,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 17:03:45,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:45,178 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:45,178 INFO L423 AbstractCegarLoop]: === Iteration 21 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:45,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:45,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1706631001, now seen corresponding path program 1 times [2018-12-01 17:03:45,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:45,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:45,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:45,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:45,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-01 17:03:45,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:45,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 17:03:45,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:03:45,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:03:45,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:03:45,215 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 5 states. [2018-12-01 17:03:45,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:45,220 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-12-01 17:03:45,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 17:03:45,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-01 17:03:45,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:45,221 INFO L225 Difference]: With dead ends: 65 [2018-12-01 17:03:45,221 INFO L226 Difference]: Without dead ends: 65 [2018-12-01 17:03:45,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:03:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-01 17:03:45,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-01 17:03:45,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-01 17:03:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2018-12-01 17:03:45,222 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 23 [2018-12-01 17:03:45,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:45,223 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2018-12-01 17:03:45,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:03:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-12-01 17:03:45,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 17:03:45,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:45,223 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:45,223 INFO L423 AbstractCegarLoop]: === Iteration 22 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:45,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:45,223 INFO L82 PathProgramCache]: Analyzing trace with hash -2103451994, now seen corresponding path program 1 times [2018-12-01 17:03:45,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:45,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:45,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:45,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:45,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:45,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:03:45,317 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:03:45,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:45,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:03:45,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 17:03:45,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:45,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 17:03:45,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 17:03:45,363 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:45,366 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:45,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:45,371 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-01 17:03:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:45,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:03:45,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-12-01 17:03:45,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-01 17:03:45,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-01 17:03:45,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-12-01 17:03:45,483 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 17 states. [2018-12-01 17:03:45,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:45,801 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-12-01 17:03:45,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 17:03:45,802 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-12-01 17:03:45,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:45,802 INFO L225 Difference]: With dead ends: 71 [2018-12-01 17:03:45,802 INFO L226 Difference]: Without dead ends: 71 [2018-12-01 17:03:45,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2018-12-01 17:03:45,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-01 17:03:45,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2018-12-01 17:03:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-01 17:03:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-12-01 17:03:45,804 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 23 [2018-12-01 17:03:45,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:45,804 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-12-01 17:03:45,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-01 17:03:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-12-01 17:03:45,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 17:03:45,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:45,805 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:45,805 INFO L423 AbstractCegarLoop]: === Iteration 23 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:45,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:45,806 INFO L82 PathProgramCache]: Analyzing trace with hash 964615599, now seen corresponding path program 1 times [2018-12-01 17:03:45,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:45,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:45,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:45,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:45,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:45,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:45,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-01 17:03:45,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 17:03:45,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 17:03:45,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-01 17:03:45,884 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 10 states. [2018-12-01 17:03:45,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:45,947 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-12-01 17:03:45,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 17:03:45,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-12-01 17:03:45,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:45,948 INFO L225 Difference]: With dead ends: 80 [2018-12-01 17:03:45,948 INFO L226 Difference]: Without dead ends: 66 [2018-12-01 17:03:45,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-12-01 17:03:45,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-01 17:03:45,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-01 17:03:45,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-01 17:03:45,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-12-01 17:03:45,949 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 24 [2018-12-01 17:03:45,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:45,949 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-12-01 17:03:45,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 17:03:45,949 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-12-01 17:03:45,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 17:03:45,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:45,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:45,950 INFO L423 AbstractCegarLoop]: === Iteration 24 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:45,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:45,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1178180239, now seen corresponding path program 1 times [2018-12-01 17:03:45,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:45,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:45,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:45,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:45,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:46,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:46,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:03:46,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-01 17:03:46,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 17:03:46,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 17:03:46,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-01 17:03:46,060 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 10 states. [2018-12-01 17:03:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:46,186 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-12-01 17:03:46,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 17:03:46,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-12-01 17:03:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:46,187 INFO L225 Difference]: With dead ends: 73 [2018-12-01 17:03:46,187 INFO L226 Difference]: Without dead ends: 58 [2018-12-01 17:03:46,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-01 17:03:46,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-01 17:03:46,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-12-01 17:03:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-01 17:03:46,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-12-01 17:03:46,188 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 24 [2018-12-01 17:03:46,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:46,188 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-12-01 17:03:46,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 17:03:46,188 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-12-01 17:03:46,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 17:03:46,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:46,189 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:46,189 INFO L423 AbstractCegarLoop]: === Iteration 25 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:46,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:46,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1029529107, now seen corresponding path program 1 times [2018-12-01 17:03:46,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:46,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:46,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:46,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:46,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:46,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:46,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:03:46,293 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:03:46,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:46,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:03:46,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 17:03:46,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 17:03:46,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:46,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:46,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 17:03:46,341 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:46,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:46,345 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:16 [2018-12-01 17:03:46,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-01 17:03:46,360 INFO L478 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 13 treesize of output 12 [2018-12-01 17:03:46,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:46,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:46,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:46,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-01 17:03:46,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-12-01 17:03:46,450 INFO L478 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 8 treesize of output 7 [2018-12-01 17:03:46,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:46,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:46,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-01 17:03:46,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-12-01 17:03:46,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-12-01 17:03:46,523 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 17:03:46,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:46,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-12-01 17:03:46,532 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 17:03:46,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:03:46,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:03:46,543 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:46 [2018-12-01 17:03:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:46,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:03:46,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-12-01 17:03:46,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-01 17:03:46,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-01 17:03:46,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-12-01 17:03:46,650 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 21 states. [2018-12-01 17:03:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:47,089 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-12-01 17:03:47,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 17:03:47,089 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2018-12-01 17:03:47,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:47,089 INFO L225 Difference]: With dead ends: 62 [2018-12-01 17:03:47,090 INFO L226 Difference]: Without dead ends: 62 [2018-12-01 17:03:47,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2018-12-01 17:03:47,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-01 17:03:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2018-12-01 17:03:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-01 17:03:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-12-01 17:03:47,091 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 24 [2018-12-01 17:03:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:47,091 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-12-01 17:03:47,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-01 17:03:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-12-01 17:03:47,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 17:03:47,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:47,092 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:47,092 INFO L423 AbstractCegarLoop]: === Iteration 26 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:47,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:47,092 INFO L82 PathProgramCache]: Analyzing trace with hash -404670552, now seen corresponding path program 1 times [2018-12-01 17:03:47,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:47,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:47,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:47,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:47,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:47,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:03:47,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:03:47,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:47,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:03:47,227 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 17:03:47,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 17:03:47,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 17:03:47,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:03:47,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:47,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-01 17:03:47,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-01 17:03:47,264 INFO L478 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 12 treesize of output 11 [2018-12-01 17:03:47,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:47,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:47,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:47,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-01 17:03:47,311 INFO L478 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 21 treesize of output 17 [2018-12-01 17:03:47,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-12-01 17:03:47,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 17:03:47,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:03:47,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:03:47,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-12-01 17:03:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:47,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:03:47,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-12-01 17:03:47,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-01 17:03:47,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-01 17:03:47,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-12-01 17:03:47,365 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 17 states. [2018-12-01 17:03:47,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:47,769 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-12-01 17:03:47,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 17:03:47,770 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-12-01 17:03:47,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:47,771 INFO L225 Difference]: With dead ends: 64 [2018-12-01 17:03:47,771 INFO L226 Difference]: Without dead ends: 64 [2018-12-01 17:03:47,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-12-01 17:03:47,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-01 17:03:47,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2018-12-01 17:03:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-01 17:03:47,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-12-01 17:03:47,774 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 26 [2018-12-01 17:03:47,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:47,775 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-12-01 17:03:47,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-01 17:03:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-12-01 17:03:47,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 17:03:47,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:47,776 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:47,776 INFO L423 AbstractCegarLoop]: === Iteration 27 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:47,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:47,777 INFO L82 PathProgramCache]: Analyzing trace with hash -340170128, now seen corresponding path program 2 times [2018-12-01 17:03:47,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:47,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:47,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:47,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:47,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:47,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:03:47,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:03:47,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 17:03:47,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 17:03:47,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 17:03:48,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:03:48,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 17:03:48,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 17:03:48,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:48,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:48,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 17:03:48,020 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:48,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:48,024 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-01 17:03:48,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-01 17:03:48,039 INFO L478 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 12 treesize of output 11 [2018-12-01 17:03:48,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:48,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:48,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:48,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-01 17:03:48,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-01 17:03:48,089 INFO L478 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 8 treesize of output 7 [2018-12-01 17:03:48,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:48,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:48,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 17:03:48,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2018-12-01 17:03:48,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-01 17:03:48,192 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 17:03:48,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:48,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-12-01 17:03:48,204 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 17:03:48,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:03:48,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:03:48,219 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-12-01 17:03:48,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:48,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:03:48,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-12-01 17:03:48,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-01 17:03:48,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-01 17:03:48,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-12-01 17:03:48,272 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 22 states. [2018-12-01 17:03:49,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:49,073 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-12-01 17:03:49,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 17:03:49,074 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-12-01 17:03:49,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:49,074 INFO L225 Difference]: With dead ends: 63 [2018-12-01 17:03:49,074 INFO L226 Difference]: Without dead ends: 43 [2018-12-01 17:03:49,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2018-12-01 17:03:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-01 17:03:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-01 17:03:49,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-01 17:03:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-12-01 17:03:49,077 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 27 [2018-12-01 17:03:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:49,077 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-12-01 17:03:49,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-01 17:03:49,077 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-12-01 17:03:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 17:03:49,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:49,078 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:49,078 INFO L423 AbstractCegarLoop]: === Iteration 28 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:49,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:49,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1553161650, now seen corresponding path program 1 times [2018-12-01 17:03:49,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:49,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:49,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:49,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:03:49,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:49,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:03:49,186 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:03:49,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:49,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:03:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 17:03:49,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 17:03:49,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2018-12-01 17:03:49,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-01 17:03:49,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-01 17:03:49,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-12-01 17:03:49,258 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 13 states. [2018-12-01 17:03:49,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:49,561 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-12-01 17:03:49,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-01 17:03:49,561 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-12-01 17:03:49,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:49,562 INFO L225 Difference]: With dead ends: 55 [2018-12-01 17:03:49,562 INFO L226 Difference]: Without dead ends: 53 [2018-12-01 17:03:49,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2018-12-01 17:03:49,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-01 17:03:49,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-12-01 17:03:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-01 17:03:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-12-01 17:03:49,563 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 27 [2018-12-01 17:03:49,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:49,563 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-12-01 17:03:49,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-01 17:03:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-12-01 17:03:49,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 17:03:49,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:49,563 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:49,564 INFO L423 AbstractCegarLoop]: === Iteration 29 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:49,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:49,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1553196471, now seen corresponding path program 2 times [2018-12-01 17:03:49,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:49,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:49,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:49,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:49,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:49,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:03:49,746 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:03:49,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 17:03:49,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 17:03:49,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 17:03:49,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:03:49,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 17:03:49,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:49,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 17:03:49,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 17:03:49,782 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:49,785 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:49,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:49,788 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-01 17:03:49,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-01 17:03:49,803 INFO L478 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 12 treesize of output 11 [2018-12-01 17:03:49,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:49,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:49,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:49,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-01 17:03:49,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-01 17:03:49,891 INFO L478 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 8 treesize of output 7 [2018-12-01 17:03:49,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:49,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:49,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:49,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-12-01 17:03:49,933 INFO L478 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 21 treesize of output 17 [2018-12-01 17:03:49,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-12-01 17:03:49,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 17:03:49,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:03:49,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:03:49,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-12-01 17:03:49,978 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:49,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:03:49,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-12-01 17:03:49,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-01 17:03:49,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-01 17:03:49,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-12-01 17:03:49,994 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 22 states. [2018-12-01 17:03:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:50,482 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-12-01 17:03:50,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 17:03:50,482 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-12-01 17:03:50,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:50,482 INFO L225 Difference]: With dead ends: 49 [2018-12-01 17:03:50,482 INFO L226 Difference]: Without dead ends: 49 [2018-12-01 17:03:50,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=968, Unknown=0, NotChecked=0, Total=1122 [2018-12-01 17:03:50,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-01 17:03:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-12-01 17:03:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-01 17:03:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-12-01 17:03:50,484 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 27 [2018-12-01 17:03:50,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:50,484 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-12-01 17:03:50,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-01 17:03:50,484 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-12-01 17:03:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 17:03:50,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:50,484 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:50,484 INFO L423 AbstractCegarLoop]: === Iteration 30 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:50,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:50,485 INFO L82 PathProgramCache]: Analyzing trace with hash 904450304, now seen corresponding path program 2 times [2018-12-01 17:03:50,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:50,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:50,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:50,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:03:50,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:50,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:03:50,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:03:50,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 17:03:50,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 17:03:50,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 17:03:50,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:03:50,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 17:03:50,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 17:03:50,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:50,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:50,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 17:03:50,649 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:50,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:50,653 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-01 17:03:50,753 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:50,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:03:50,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2018-12-01 17:03:50,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-01 17:03:50,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-01 17:03:50,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-01 17:03:50,768 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 18 states. [2018-12-01 17:03:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:51,065 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-12-01 17:03:51,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 17:03:51,065 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-12-01 17:03:51,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:51,065 INFO L225 Difference]: With dead ends: 55 [2018-12-01 17:03:51,065 INFO L226 Difference]: Without dead ends: 55 [2018-12-01 17:03:51,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-12-01 17:03:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-01 17:03:51,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-12-01 17:03:51,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-01 17:03:51,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-12-01 17:03:51,067 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 28 [2018-12-01 17:03:51,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:51,067 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-12-01 17:03:51,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-01 17:03:51,067 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-12-01 17:03:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 17:03:51,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:51,067 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:51,068 INFO L423 AbstractCegarLoop]: === Iteration 31 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:51,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:51,068 INFO L82 PathProgramCache]: Analyzing trace with hash 432781013, now seen corresponding path program 1 times [2018-12-01 17:03:51,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:51,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:51,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:51,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:03:51,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:51,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:03:51,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:03:51,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:51,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:03:51,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 17:03:51,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:51,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 17:03:51,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 17:03:51,351 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:51,356 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:51,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:51,366 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-01 17:03:51,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-01 17:03:51,384 INFO L478 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 12 treesize of output 11 [2018-12-01 17:03:51,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:51,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:51,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:51,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-01 17:03:51,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-01 17:03:51,465 INFO L478 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 8 treesize of output 7 [2018-12-01 17:03:51,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:51,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:51,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:51,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-12-01 17:03:51,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-01 17:03:51,495 INFO L478 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 8 treesize of output 7 [2018-12-01 17:03:51,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:51,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:51,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 17:03:51,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-12-01 17:03:51,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-01 17:03:51,552 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 17:03:51,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:51,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-12-01 17:03:51,560 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 17:03:51,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:03:51,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:03:51,568 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-12-01 17:03:51,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:51,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:03:51,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-12-01 17:03:51,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-01 17:03:51,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-01 17:03:51,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-12-01 17:03:51,617 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 24 states. [2018-12-01 17:03:53,095 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2018-12-01 17:03:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:53,115 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-12-01 17:03:53,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-01 17:03:53,116 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-12-01 17:03:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:53,116 INFO L225 Difference]: With dead ends: 54 [2018-12-01 17:03:53,116 INFO L226 Difference]: Without dead ends: 44 [2018-12-01 17:03:53,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=216, Invalid=1424, Unknown=0, NotChecked=0, Total=1640 [2018-12-01 17:03:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-01 17:03:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-01 17:03:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-01 17:03:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-12-01 17:03:53,118 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 29 [2018-12-01 17:03:53,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:53,119 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-12-01 17:03:53,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-01 17:03:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-12-01 17:03:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 17:03:53,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:53,119 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:53,120 INFO L423 AbstractCegarLoop]: === Iteration 32 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:53,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:53,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2109992718, now seen corresponding path program 2 times [2018-12-01 17:03:53,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:53,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:53,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:53,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:03:53,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:53,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:03:53,317 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:03:53,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 17:03:53,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 17:03:53,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 17:03:53,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:03:53,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 17:03:53,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:53,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 17:03:53,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 17:03:53,363 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:53,366 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:53,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:53,370 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-01 17:03:53,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-01 17:03:53,386 INFO L478 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 12 treesize of output 11 [2018-12-01 17:03:53,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:53,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:53,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:53,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-01 17:03:53,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-01 17:03:53,468 INFO L478 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 8 treesize of output 7 [2018-12-01 17:03:53,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:53,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:53,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:53,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-12-01 17:03:53,513 INFO L478 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 21 treesize of output 17 [2018-12-01 17:03:53,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-12-01 17:03:53,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 17:03:53,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:03:53,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:03:53,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-12-01 17:03:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:53,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:03:53,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-12-01 17:03:53,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-01 17:03:53,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-01 17:03:53,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-12-01 17:03:53,571 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 22 states. [2018-12-01 17:03:54,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:54,032 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-01 17:03:54,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 17:03:54,032 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-12-01 17:03:54,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:54,033 INFO L225 Difference]: With dead ends: 43 [2018-12-01 17:03:54,033 INFO L226 Difference]: Without dead ends: 38 [2018-12-01 17:03:54,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2018-12-01 17:03:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-01 17:03:54,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-01 17:03:54,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-01 17:03:54,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-01 17:03:54,037 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 31 [2018-12-01 17:03:54,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:54,037 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-01 17:03:54,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-01 17:03:54,038 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-01 17:03:54,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 17:03:54,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:03:54,038 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:03:54,039 INFO L423 AbstractCegarLoop]: === Iteration 33 === [cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 17:03:54,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:54,039 INFO L82 PathProgramCache]: Analyzing trace with hash -570734874, now seen corresponding path program 3 times [2018-12-01 17:03:54,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:54,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:54,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:54,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:03:54,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:54,176 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-01 17:03:54,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:03:54,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:03:54,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-01 17:03:54,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-01 17:03:54,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 17:03:54,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:03:54,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 17:03:54,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:54,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 17:03:54,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 17:03:54,259 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:54,262 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:54,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:54,266 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-01 17:03:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:03:54,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:03:54,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-12-01 17:03:54,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-01 17:03:54,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-01 17:03:54,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-12-01 17:03:54,427 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 20 states. [2018-12-01 17:03:55,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:03:55,121 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-01 17:03:55,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-01 17:03:55,121 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-12-01 17:03:55,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:03:55,121 INFO L225 Difference]: With dead ends: 45 [2018-12-01 17:03:55,122 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 17:03:55,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=1216, Unknown=0, NotChecked=0, Total=1406 [2018-12-01 17:03:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 17:03:55,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 17:03:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 17:03:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 17:03:55,122 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-12-01 17:03:55,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:03:55,122 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 17:03:55,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-01 17:03:55,122 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 17:03:55,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 17:03:55,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 05:03:55 BoogieIcfgContainer [2018-12-01 17:03:55,125 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 17:03:55,126 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 17:03:55,126 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 17:03:55,126 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 17:03:55,126 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:03:42" (3/4) ... [2018-12-01 17:03:55,128 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 17:03:55,133 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 17:03:55,133 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrlcpy [2018-12-01 17:03:55,133 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-01 17:03:55,133 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-01 17:03:55,133 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 17:03:55,136 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-01 17:03:55,136 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-01 17:03:55,136 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-01 17:03:55,159 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7aa86dfb-31f2-4bb9-a1f6-7c81c5eeb888/bin-2019/uautomizer/witness.graphml [2018-12-01 17:03:55,159 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 17:03:55,160 INFO L168 Benchmark]: Toolchain (without parser) took 13239.92 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 422.6 MB). Free memory was 950.6 MB in the beginning and 1.4 GB in the end (delta: -425.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:03:55,160 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:03:55,160 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-01 17:03:55,161 INFO L168 Benchmark]: Boogie Preprocessor took 28.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:03:55,161 INFO L168 Benchmark]: RCFGBuilder took 261.62 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: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. [2018-12-01 17:03:55,161 INFO L168 Benchmark]: TraceAbstraction took 12663.28 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 280.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -297.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:03:55,161 INFO L168 Benchmark]: Witness Printer took 33.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 476.6 kB). Peak memory consumption was 476.6 kB. Max. memory is 11.5 GB. [2018-12-01 17:03:55,162 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 250.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 261.62 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: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12663.28 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 280.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -297.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 33.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 476.6 kB). Peak memory consumption was 476.6 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 52 locations, 13 error locations. SAFE Result, 12.6s OverallTime, 33 OverallIterations, 4 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 953 SDtfs, 1331 SDslu, 4147 SDs, 0 SdLazy, 4110 SolverSat, 357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 694 GetRequests, 241 SyntacticMatches, 10 SemanticMatches, 443 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 170 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 993 NumberOfCodeBlocks, 993 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 949 ConstructedInterpolants, 30 QuantifiedInterpolants, 233369 SizeOfPredicates, 161 NumberOfNonLiveVariables, 1907 ConjunctsInSsa, 489 ConjunctsInUnsatCore, 44 InterpolantComputations, 23 PerfectInterpolantSequences, 20/183 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...