./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/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_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/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-0cd3be1 [2018-11-28 12:28:04,848 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:28:04,850 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:28:04,858 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:28:04,858 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:28:04,859 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:28:04,860 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:28:04,861 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:28:04,862 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:28:04,862 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:28:04,863 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:28:04,863 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:28:04,864 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:28:04,864 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:28:04,865 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:28:04,865 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:28:04,866 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:28:04,867 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:28:04,868 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:28:04,869 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:28:04,870 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:28:04,870 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:28:04,871 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:28:04,872 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:28:04,872 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:28:04,872 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:28:04,873 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:28:04,873 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:28:04,874 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:28:04,874 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:28:04,874 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:28:04,875 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:28:04,875 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:28:04,875 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:28:04,876 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:28:04,876 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:28:04,876 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 12:28:04,886 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:28:04,886 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:28:04,887 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:28:04,887 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:28:04,887 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:28:04,887 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:28:04,888 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:28:04,888 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:28:04,888 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:28:04,888 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:28:04,888 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:28:04,888 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:28:04,889 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:28:04,889 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 12:28:04,889 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 12:28:04,889 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 12:28:04,889 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:28:04,889 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:28:04,889 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:28:04,889 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:28:04,890 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:28:04,890 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:28:04,890 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:28:04,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:28:04,890 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:28:04,890 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:28:04,890 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:28:04,891 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:28:04,891 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_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/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-11-28 12:28:04,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:28:04,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:28:04,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:28:04,927 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:28:04,927 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:28:04,927 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 12:28:04,972 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/bin-2019/uautomizer/data/c519784e3/25e41aa42b22459f81a818db2a13fcdf/FLAGd2eae8543 [2018-11-28 12:28:05,419 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:28:05,420 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 12:28:05,426 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/bin-2019/uautomizer/data/c519784e3/25e41aa42b22459f81a818db2a13fcdf/FLAGd2eae8543 [2018-11-28 12:28:05,437 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/bin-2019/uautomizer/data/c519784e3/25e41aa42b22459f81a818db2a13fcdf [2018-11-28 12:28:05,439 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:28:05,440 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 12:28:05,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:28:05,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:28:05,444 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:28:05,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:28:05" (1/1) ... [2018-11-28 12:28:05,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7befda7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:05, skipping insertion in model container [2018-11-28 12:28:05,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:28:05" (1/1) ... [2018-11-28 12:28:05,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:28:05,479 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:28:05,673 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:28:05,682 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:28:05,754 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:28:05,784 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:28:05,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:05 WrapperNode [2018-11-28 12:28:05,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:28:05,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:28:05,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:28:05,786 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:28:05,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:05" (1/1) ... [2018-11-28 12:28:05,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:05" (1/1) ... [2018-11-28 12:28:05,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:05" (1/1) ... [2018-11-28 12:28:05,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:05" (1/1) ... [2018-11-28 12:28:05,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:05" (1/1) ... [2018-11-28 12:28:05,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:05" (1/1) ... [2018-11-28 12:28:05,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:05" (1/1) ... [2018-11-28 12:28:05,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:28:05,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:28:05,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:28:05,821 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:28:05,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/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-11-28 12:28:05,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:28:05,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:28:05,858 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 12:28:05,858 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 12:28:05,858 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2018-11-28 12:28:05,858 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:28:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 12:28:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 12:28:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 12:28:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 12:28:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 12:28:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 12:28:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 12:28:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 12:28:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 12:28:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 12:28:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 12:28:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 12:28:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 12:28:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 12:28:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 12:28:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 12:28:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 12:28:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 12:28:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 12:28:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 12:28:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 12:28:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 12:28:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 12:28:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 12:28:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 12:28:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 12:28:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 12:28:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 12:28:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 12:28:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 12:28:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 12:28:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 12:28:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 12:28:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 12:28:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 12:28:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 12:28:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 12:28:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 12:28:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 12:28:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 12:28:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 12:28:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 12:28:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 12:28:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 12:28:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 12:28:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 12:28:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 12:28:05,863 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 12:28:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 12:28:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 12:28:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 12:28:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 12:28:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 12:28:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 12:28:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 12:28:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 12:28:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 12:28:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 12:28:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 12:28:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 12:28:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 12:28:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 12:28:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 12:28:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 12:28:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 12:28:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 12:28:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 12:28:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 12:28:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 12:28:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 12:28:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 12:28:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 12:28:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 12:28:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 12:28:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 12:28:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 12:28:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 12:28:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 12:28:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 12:28:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 12:28:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 12:28:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 12:28:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 12:28:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 12:28:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 12:28:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 12:28:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 12:28:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 12:28:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 12:28:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 12:28:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 12:28:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 12:28:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 12:28:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 12:28:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 12:28:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 12:28:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 12:28:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 12:28:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 12:28:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 12:28:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 12:28:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 12:28:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 12:28:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure cstrlcpy [2018-11-28 12:28:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:28:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:28:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:28:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:28:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:28:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:28:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:28:06,156 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:28:06,156 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 12:28:06,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:28:06 BoogieIcfgContainer [2018-11-28 12:28:06,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:28:06,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:28:06,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:28:06,160 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:28:06,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:28:05" (1/3) ... [2018-11-28 12:28:06,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18695475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:28:06, skipping insertion in model container [2018-11-28 12:28:06,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:28:05" (2/3) ... [2018-11-28 12:28:06,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18695475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:28:06, skipping insertion in model container [2018-11-28 12:28:06,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:28:06" (3/3) ... [2018-11-28 12:28:06,163 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 12:28:06,169 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:28:06,175 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-11-28 12:28:06,187 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-11-28 12:28:06,201 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:28:06,202 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:28:06,202 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 12:28:06,202 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:28:06,202 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:28:06,202 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:28:06,202 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:28:06,202 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:28:06,202 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:28:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-11-28 12:28:06,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 12:28:06,217 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:06,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:28:06,219 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:06,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:06,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1443993176, now seen corresponding path program 1 times [2018-11-28 12:28:06,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:06,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:06,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:06,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:06,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:06,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:06,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:28:06,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:28:06,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:28:06,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:28:06,348 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-11-28 12:28:06,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:06,399 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-28 12:28:06,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:28:06,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 12:28:06,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:06,407 INFO L225 Difference]: With dead ends: 45 [2018-11-28 12:28:06,407 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 12:28:06,408 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-11-28 12:28:06,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 12:28:06,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-28 12:28:06,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 12:28:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-11-28 12:28:06,430 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 10 [2018-11-28 12:28:06,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:06,430 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-28 12:28:06,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:28:06,430 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-28 12:28:06,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 12:28:06,431 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:06,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:28:06,431 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:06,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:06,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1443993175, now seen corresponding path program 1 times [2018-11-28 12:28:06,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:06,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:06,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:06,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:06,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:06,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:06,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:28:06,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:28:06,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:28:06,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:28:06,516 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 4 states. [2018-11-28 12:28:06,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:06,531 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-11-28 12:28:06,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:28:06,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 12:28:06,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:06,532 INFO L225 Difference]: With dead ends: 41 [2018-11-28 12:28:06,532 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 12:28:06,532 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-11-28 12:28:06,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 12:28:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-28 12:28:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 12:28:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-11-28 12:28:06,535 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 10 [2018-11-28 12:28:06,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:06,536 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-11-28 12:28:06,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:28:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-11-28 12:28:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 12:28:06,536 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:06,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:28:06,537 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:06,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:06,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1814115442, now seen corresponding path program 1 times [2018-11-28 12:28:06,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:06,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:06,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:06,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:06,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:06,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:06,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:28:06,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:28:06,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:28:06,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:28:06,559 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 3 states. [2018-11-28 12:28:06,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:06,580 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-28 12:28:06,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:28:06,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 12:28:06,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:06,581 INFO L225 Difference]: With dead ends: 40 [2018-11-28 12:28:06,581 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 12:28:06,582 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-11-28 12:28:06,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 12:28:06,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 12:28:06,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 12:28:06,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-11-28 12:28:06,585 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 11 [2018-11-28 12:28:06,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:06,585 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-11-28 12:28:06,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:28:06,585 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-11-28 12:28:06,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 12:28:06,586 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:06,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:28:06,586 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:06,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:06,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1814115441, now seen corresponding path program 1 times [2018-11-28 12:28:06,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:06,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:06,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:06,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:06,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:06,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:06,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:28:06,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:28:06,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:28:06,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:28:06,644 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 4 states. [2018-11-28 12:28:06,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:06,657 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-28 12:28:06,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:28:06,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 12:28:06,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:06,658 INFO L225 Difference]: With dead ends: 39 [2018-11-28 12:28:06,658 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 12:28:06,659 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-11-28 12:28:06,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 12:28:06,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-28 12:28:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 12:28:06,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-28 12:28:06,662 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 11 [2018-11-28 12:28:06,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:06,662 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-28 12:28:06,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:28:06,662 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-28 12:28:06,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 12:28:06,663 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:06,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:28:06,663 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:06,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:06,664 INFO L82 PathProgramCache]: Analyzing trace with hash 219743670, now seen corresponding path program 1 times [2018-11-28 12:28:06,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:06,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:06,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:06,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:06,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:06,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:06,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:28:06,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:28:06,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:28:06,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:28:06,711 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 6 states. [2018-11-28 12:28:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:06,792 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-28 12:28:06,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:28:06,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-28 12:28:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:06,793 INFO L225 Difference]: With dead ends: 38 [2018-11-28 12:28:06,793 INFO L226 Difference]: Without dead ends: 38 [2018-11-28 12:28:06,793 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-11-28 12:28:06,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-28 12:28:06,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-28 12:28:06,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 12:28:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-28 12:28:06,796 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 17 [2018-11-28 12:28:06,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:06,796 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-28 12:28:06,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:28:06,796 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-28 12:28:06,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 12:28:06,797 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:06,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:28:06,797 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:06,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:06,797 INFO L82 PathProgramCache]: Analyzing trace with hash 219743671, now seen corresponding path program 1 times [2018-11-28 12:28:06,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:06,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:06,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:06,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:06,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:28:06,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 12:28:06,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 12:28:06,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:28:06,859 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 8 states. [2018-11-28 12:28:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:06,985 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-28 12:28:06,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:28:06,986 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-28 12:28:06,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:06,988 INFO L225 Difference]: With dead ends: 54 [2018-11-28 12:28:06,988 INFO L226 Difference]: Without dead ends: 54 [2018-11-28 12:28:06,989 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-11-28 12:28:06,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-28 12:28:06,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2018-11-28 12:28:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 12:28:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-28 12:28:06,993 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 17 [2018-11-28 12:28:06,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:06,994 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-28 12:28:06,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 12:28:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-28 12:28:06,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 12:28:06,994 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:06,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:28:06,995 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:06,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:06,995 INFO L82 PathProgramCache]: Analyzing trace with hash 220542997, now seen corresponding path program 1 times [2018-11-28 12:28:06,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:06,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:06,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:06,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:06,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:07,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:07,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:28:07,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:28:07,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:28:07,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:28:07,041 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 5 states. [2018-11-28 12:28:07,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:07,085 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-28 12:28:07,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:28:07,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-28 12:28:07,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:07,087 INFO L225 Difference]: With dead ends: 40 [2018-11-28 12:28:07,087 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 12:28:07,087 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-11-28 12:28:07,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 12:28:07,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 12:28:07,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 12:28:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-28 12:28:07,090 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 17 [2018-11-28 12:28:07,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:07,090 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-28 12:28:07,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:28:07,091 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-28 12:28:07,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 12:28:07,091 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:07,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:28:07,091 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:07,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:07,092 INFO L82 PathProgramCache]: Analyzing trace with hash 220542998, now seen corresponding path program 1 times [2018-11-28 12:28:07,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:07,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:07,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:07,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:07,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:07,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:07,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:28:07,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:28:07,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:28:07,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:28:07,150 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 5 states. [2018-11-28 12:28:07,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:07,203 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2018-11-28 12:28:07,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:28:07,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-28 12:28:07,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:07,204 INFO L225 Difference]: With dead ends: 72 [2018-11-28 12:28:07,204 INFO L226 Difference]: Without dead ends: 72 [2018-11-28 12:28:07,204 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-11-28 12:28:07,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-28 12:28:07,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2018-11-28 12:28:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-28 12:28:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2018-11-28 12:28:07,209 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 17 [2018-11-28 12:28:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:07,209 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2018-11-28 12:28:07,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:28:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2018-11-28 12:28:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 12:28:07,210 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:07,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:28:07,210 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:07,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:07,211 INFO L82 PathProgramCache]: Analyzing trace with hash -172484012, now seen corresponding path program 1 times [2018-11-28 12:28:07,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:07,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:07,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:07,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:07,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:07,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:07,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:07,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:28:07,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:28:07,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:28:07,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:28:07,267 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand 7 states. [2018-11-28 12:28:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:07,334 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2018-11-28 12:28:07,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:28:07,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-28 12:28:07,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:07,335 INFO L225 Difference]: With dead ends: 83 [2018-11-28 12:28:07,335 INFO L226 Difference]: Without dead ends: 83 [2018-11-28 12:28:07,335 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-11-28 12:28:07,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-28 12:28:07,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2018-11-28 12:28:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 12:28:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2018-11-28 12:28:07,341 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 17 [2018-11-28 12:28:07,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:07,341 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2018-11-28 12:28:07,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:28:07,341 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2018-11-28 12:28:07,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 12:28:07,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:07,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:28:07,342 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:07,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:07,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1777880833, now seen corresponding path program 1 times [2018-11-28 12:28:07,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:07,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:07,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:07,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:07,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:07,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:07,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:28:07,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:28:07,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:28:07,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:28:07,384 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand 6 states. [2018-11-28 12:28:07,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:07,443 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2018-11-28 12:28:07,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:28:07,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-28 12:28:07,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:07,445 INFO L225 Difference]: With dead ends: 68 [2018-11-28 12:28:07,445 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 12:28:07,445 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-11-28 12:28:07,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 12:28:07,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-28 12:28:07,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 12:28:07,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 91 transitions. [2018-11-28 12:28:07,450 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 91 transitions. Word has length 18 [2018-11-28 12:28:07,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:07,450 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 91 transitions. [2018-11-28 12:28:07,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:28:07,450 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 91 transitions. [2018-11-28 12:28:07,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 12:28:07,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:07,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:28:07,451 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:07,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:07,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1777880832, now seen corresponding path program 1 times [2018-11-28 12:28:07,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:07,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:07,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:07,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:07,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:07,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:07,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:07,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:28:07,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 12:28:07,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 12:28:07,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:28:07,580 INFO L87 Difference]: Start difference. First operand 68 states and 91 transitions. Second operand 8 states. [2018-11-28 12:28:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:07,744 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2018-11-28 12:28:07,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:28:07,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-28 12:28:07,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:07,745 INFO L225 Difference]: With dead ends: 86 [2018-11-28 12:28:07,745 INFO L226 Difference]: Without dead ends: 86 [2018-11-28 12:28:07,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:28:07,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-28 12:28:07,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2018-11-28 12:28:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-28 12:28:07,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 93 transitions. [2018-11-28 12:28:07,754 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 93 transitions. Word has length 18 [2018-11-28 12:28:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:07,754 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 93 transitions. [2018-11-28 12:28:07,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 12:28:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2018-11-28 12:28:07,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 12:28:07,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:07,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:28:07,755 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:07,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:07,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1052032004, now seen corresponding path program 1 times [2018-11-28 12:28:07,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:07,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:07,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:07,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:07,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:07,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:07,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:28:07,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:28:07,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:28:07,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:28:07,822 INFO L87 Difference]: Start difference. First operand 70 states and 93 transitions. Second operand 6 states. [2018-11-28 12:28:07,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:07,876 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2018-11-28 12:28:07,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:28:07,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-28 12:28:07,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:07,877 INFO L225 Difference]: With dead ends: 69 [2018-11-28 12:28:07,877 INFO L226 Difference]: Without dead ends: 69 [2018-11-28 12:28:07,877 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-11-28 12:28:07,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-28 12:28:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-28 12:28:07,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 12:28:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2018-11-28 12:28:07,881 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 18 [2018-11-28 12:28:07,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:07,881 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2018-11-28 12:28:07,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:28:07,881 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2018-11-28 12:28:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 12:28:07,882 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:07,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:28:07,882 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:07,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:07,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1052032003, now seen corresponding path program 1 times [2018-11-28 12:28:07,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:07,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:07,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:07,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:07,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:07,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:07,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:07,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:28:07,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 12:28:07,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 12:28:07,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:28:07,959 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand 8 states. [2018-11-28 12:28:08,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:08,018 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2018-11-28 12:28:08,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:28:08,019 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-28 12:28:08,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:08,019 INFO L225 Difference]: With dead ends: 81 [2018-11-28 12:28:08,019 INFO L226 Difference]: Without dead ends: 81 [2018-11-28 12:28:08,019 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-11-28 12:28:08,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-28 12:28:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2018-11-28 12:28:08,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-28 12:28:08,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 95 transitions. [2018-11-28 12:28:08,023 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 95 transitions. Word has length 18 [2018-11-28 12:28:08,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:08,023 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 95 transitions. [2018-11-28 12:28:08,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 12:28:08,023 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2018-11-28 12:28:08,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 12:28:08,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:08,024 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-11-28 12:28:08,024 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:08,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:08,024 INFO L82 PathProgramCache]: Analyzing trace with hash -922088297, now seen corresponding path program 1 times [2018-11-28 12:28:08,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:08,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:08,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:08,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:08,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:08,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:08,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:08,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:28:08,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:28:08,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:28:08,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:28:08,047 INFO L87 Difference]: Start difference. First operand 73 states and 95 transitions. Second operand 3 states. [2018-11-28 12:28:08,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:08,057 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-11-28 12:28:08,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:28:08,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 12:28:08,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:08,058 INFO L225 Difference]: With dead ends: 80 [2018-11-28 12:28:08,058 INFO L226 Difference]: Without dead ends: 80 [2018-11-28 12:28:08,058 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-11-28 12:28:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-28 12:28:08,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-11-28 12:28:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 12:28:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2018-11-28 12:28:08,061 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 20 [2018-11-28 12:28:08,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:08,061 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2018-11-28 12:28:08,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:28:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2018-11-28 12:28:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 12:28:08,062 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:08,062 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-11-28 12:28:08,062 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:08,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:08,062 INFO L82 PathProgramCache]: Analyzing trace with hash -709046688, now seen corresponding path program 1 times [2018-11-28 12:28:08,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:08,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:08,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:08,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:08,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:08,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:28:08,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:08,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:28:08,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:28:08,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:28:08,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:28:08,114 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand 6 states. [2018-11-28 12:28:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:08,138 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2018-11-28 12:28:08,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:28:08,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 12:28:08,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:08,141 INFO L225 Difference]: With dead ends: 73 [2018-11-28 12:28:08,141 INFO L226 Difference]: Without dead ends: 73 [2018-11-28 12:28:08,142 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-11-28 12:28:08,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-28 12:28:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2018-11-28 12:28:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 12:28:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-28 12:28:08,145 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 21 [2018-11-28 12:28:08,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:08,145 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-28 12:28:08,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:28:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-28 12:28:08,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 12:28:08,146 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:08,146 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-11-28 12:28:08,146 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:08,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:08,146 INFO L82 PathProgramCache]: Analyzing trace with hash -567068546, now seen corresponding path program 1 times [2018-11-28 12:28:08,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:08,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:08,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:08,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:08,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:08,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:08,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:28:08,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:28:08,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:28:08,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:28:08,202 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 4 states. [2018-11-28 12:28:08,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:08,239 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-28 12:28:08,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:28:08,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-28 12:28:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:08,239 INFO L225 Difference]: With dead ends: 43 [2018-11-28 12:28:08,239 INFO L226 Difference]: Without dead ends: 38 [2018-11-28 12:28:08,240 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-11-28 12:28:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-28 12:28:08,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-28 12:28:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 12:28:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-28 12:28:08,241 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 22 [2018-11-28 12:28:08,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:08,241 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-28 12:28:08,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:28:08,241 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-28 12:28:08,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 12:28:08,242 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:08,242 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-11-28 12:28:08,242 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:08,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:08,242 INFO L82 PathProgramCache]: Analyzing trace with hash -122260724, now seen corresponding path program 1 times [2018-11-28 12:28:08,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:08,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:08,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:08,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:08,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:08,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:08,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:28:08,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:28:08,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:28:08,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:28:08,371 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 7 states. [2018-11-28 12:28:08,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:08,447 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-28 12:28:08,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:28:08,448 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-28 12:28:08,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:08,448 INFO L225 Difference]: With dead ends: 55 [2018-11-28 12:28:08,448 INFO L226 Difference]: Without dead ends: 55 [2018-11-28 12:28:08,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:28:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-28 12:28:08,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2018-11-28 12:28:08,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 12:28:08,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-28 12:28:08,451 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 22 [2018-11-28 12:28:08,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:08,451 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-28 12:28:08,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:28:08,451 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-28 12:28:08,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 12:28:08,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:08,451 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-11-28 12:28:08,452 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:08,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:08,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1402124402, now seen corresponding path program 1 times [2018-11-28 12:28:08,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:08,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:08,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:08,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:08,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:08,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:08,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:28:08,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 12:28:08,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 12:28:08,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:28:08,622 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 8 states. [2018-11-28 12:28:08,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:08,770 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-28 12:28:08,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:28:08,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-28 12:28:08,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:08,771 INFO L225 Difference]: With dead ends: 56 [2018-11-28 12:28:08,771 INFO L226 Difference]: Without dead ends: 56 [2018-11-28 12:28:08,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:28:08,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-28 12:28:08,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-11-28 12:28:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 12:28:08,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-11-28 12:28:08,773 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-11-28 12:28:08,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:08,773 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-11-28 12:28:08,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 12:28:08,773 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-11-28 12:28:08,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 12:28:08,774 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:08,774 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-11-28 12:28:08,774 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:08,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:08,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1402089581, now seen corresponding path program 1 times [2018-11-28 12:28:08,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:08,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:08,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:08,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:08,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:08,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:08,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:08,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 12:28:08,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 12:28:08,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 12:28:08,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:28:08,843 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-11-28 12:28:08,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:08,921 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-11-28 12:28:08,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:28:08,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-28 12:28:08,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:08,922 INFO L225 Difference]: With dead ends: 84 [2018-11-28 12:28:08,922 INFO L226 Difference]: Without dead ends: 84 [2018-11-28 12:28:08,922 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-11-28 12:28:08,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-28 12:28:08,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 64. [2018-11-28 12:28:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 12:28:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-11-28 12:28:08,925 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 22 [2018-11-28 12:28:08,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:08,925 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-11-28 12:28:08,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 12:28:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-11-28 12:28:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 12:28:08,926 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:08,926 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-11-28 12:28:08,926 INFO L423 AbstractCegarLoop]: === Iteration 20 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:08,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:08,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1871809361, now seen corresponding path program 1 times [2018-11-28 12:28:08,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:08,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:08,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:08,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:08,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:09,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:28:09,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/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-11-28 12:28:09,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:09,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:28:09,136 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-11-28 12:28:09,150 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-11-28 12:28:09,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:28:09,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:28:09,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:09,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-11-28 12:28:09,185 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-11-28 12:28:09,186 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-11-28 12:28:09,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:09,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:09,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:09,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-28 12:28:09,262 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-11-28 12:28:09,273 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-11-28 12:28:09,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:28:09,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:28:09,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:28:09,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-11-28 12:28:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:09,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:28:09,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-11-28 12:28:09,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 12:28:09,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 12:28:09,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-28 12:28:09,332 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 17 states. [2018-11-28 12:28:09,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:09,638 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2018-11-28 12:28:09,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:28:09,638 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2018-11-28 12:28:09,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:09,639 INFO L225 Difference]: With dead ends: 76 [2018-11-28 12:28:09,639 INFO L226 Difference]: Without dead ends: 76 [2018-11-28 12:28:09,639 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-11-28 12:28:09,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-28 12:28:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2018-11-28 12:28:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 12:28:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2018-11-28 12:28:09,641 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 22 [2018-11-28 12:28:09,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:09,642 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2018-11-28 12:28:09,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 12:28:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2018-11-28 12:28:09,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 12:28:09,642 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:09,642 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-11-28 12:28:09,643 INFO L423 AbstractCegarLoop]: === Iteration 21 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:09,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:09,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1706631001, now seen corresponding path program 1 times [2018-11-28 12:28:09,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:09,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:09,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:09,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:09,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:28:09,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:09,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:28:09,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:28:09,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:28:09,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:28:09,694 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 5 states. [2018-11-28 12:28:09,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:09,701 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-11-28 12:28:09,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:28:09,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-28 12:28:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:09,702 INFO L225 Difference]: With dead ends: 65 [2018-11-28 12:28:09,702 INFO L226 Difference]: Without dead ends: 65 [2018-11-28 12:28:09,702 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-11-28 12:28:09,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-28 12:28:09,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-28 12:28:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 12:28:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2018-11-28 12:28:09,704 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 23 [2018-11-28 12:28:09,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:09,705 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2018-11-28 12:28:09,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:28:09,705 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-11-28 12:28:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 12:28:09,705 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:09,705 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-11-28 12:28:09,705 INFO L423 AbstractCegarLoop]: === Iteration 22 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:09,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:09,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2103451994, now seen corresponding path program 1 times [2018-11-28 12:28:09,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:09,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:09,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:09,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:09,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:09,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:28:09,811 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/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-11-28 12:28:09,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:09,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:28:09,867 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-11-28 12:28:09,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:09,872 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-11-28 12:28:09,875 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-11-28 12:28:09,875 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:09,879 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:09,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:09,884 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-11-28 12:28:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:10,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:28:10,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-11-28 12:28:10,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 12:28:10,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 12:28:10,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-11-28 12:28:10,010 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 17 states. [2018-11-28 12:28:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:10,268 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-11-28 12:28:10,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 12:28:10,270 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-28 12:28:10,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:10,270 INFO L225 Difference]: With dead ends: 71 [2018-11-28 12:28:10,271 INFO L226 Difference]: Without dead ends: 71 [2018-11-28 12:28:10,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2018-11-28 12:28:10,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-28 12:28:10,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2018-11-28 12:28:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 12:28:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-11-28 12:28:10,273 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 23 [2018-11-28 12:28:10,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:10,273 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-11-28 12:28:10,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 12:28:10,273 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-28 12:28:10,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 12:28:10,274 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:10,274 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-11-28 12:28:10,274 INFO L423 AbstractCegarLoop]: === Iteration 23 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:10,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:10,274 INFO L82 PathProgramCache]: Analyzing trace with hash 964615599, now seen corresponding path program 1 times [2018-11-28 12:28:10,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:10,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:10,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:10,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:10,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:10,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:10,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 12:28:10,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 12:28:10,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:28:10,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:28:10,352 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 10 states. [2018-11-28 12:28:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:10,418 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-11-28 12:28:10,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:28:10,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-28 12:28:10,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:10,419 INFO L225 Difference]: With dead ends: 80 [2018-11-28 12:28:10,419 INFO L226 Difference]: Without dead ends: 66 [2018-11-28 12:28:10,419 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-11-28 12:28:10,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-28 12:28:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-28 12:28:10,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 12:28:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-11-28 12:28:10,421 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 24 [2018-11-28 12:28:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:10,421 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-11-28 12:28:10,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 12:28:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-11-28 12:28:10,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 12:28:10,422 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:10,422 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-11-28 12:28:10,422 INFO L423 AbstractCegarLoop]: === Iteration 24 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:10,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:10,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1178180239, now seen corresponding path program 1 times [2018-11-28 12:28:10,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:10,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:10,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:10,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:10,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:10,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:28:10,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 12:28:10,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 12:28:10,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:28:10,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:28:10,546 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 10 states. [2018-11-28 12:28:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:10,694 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-11-28 12:28:10,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 12:28:10,694 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-28 12:28:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:10,695 INFO L225 Difference]: With dead ends: 73 [2018-11-28 12:28:10,695 INFO L226 Difference]: Without dead ends: 58 [2018-11-28 12:28:10,695 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-11-28 12:28:10,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-28 12:28:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-11-28 12:28:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-28 12:28:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-11-28 12:28:10,697 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 24 [2018-11-28 12:28:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:10,697 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-11-28 12:28:10,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 12:28:10,697 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-28 12:28:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 12:28:10,698 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:10,698 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-11-28 12:28:10,698 INFO L423 AbstractCegarLoop]: === Iteration 25 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:10,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:10,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1029529107, now seen corresponding path program 1 times [2018-11-28 12:28:10,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:10,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:10,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:10,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:10,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:10,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:28:10,858 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/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-11-28 12:28:10,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:10,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:28:10,898 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-11-28 12:28:10,901 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-11-28 12:28:10,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:10,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:10,911 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-11-28 12:28:10,911 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:10,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:10,916 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:16 [2018-11-28 12:28:10,935 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-11-28 12:28:10,937 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-11-28 12:28:10,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:10,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:10,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:10,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-28 12:28:11,028 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-11-28 12:28:11,031 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-11-28 12:28:11,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:11,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:11,046 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-11-28 12:28:11,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-11-28 12:28:11,111 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-11-28 12:28:11,113 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-11-28 12:28:11,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:11,124 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-11-28 12:28:11,124 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 12:28:11,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:28:11,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:28:11,136 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:46 [2018-11-28 12:28:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:11,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:28:11,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-28 12:28:11,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 12:28:11,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 12:28:11,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-28 12:28:11,242 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 21 states. [2018-11-28 12:28:11,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:11,680 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-11-28 12:28:11,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:28:11,681 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2018-11-28 12:28:11,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:11,681 INFO L225 Difference]: With dead ends: 62 [2018-11-28 12:28:11,681 INFO L226 Difference]: Without dead ends: 62 [2018-11-28 12:28:11,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2018-11-28 12:28:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-28 12:28:11,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2018-11-28 12:28:11,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-28 12:28:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-11-28 12:28:11,684 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 24 [2018-11-28 12:28:11,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:11,684 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-11-28 12:28:11,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 12:28:11,684 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-11-28 12:28:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 12:28:11,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:11,684 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-11-28 12:28:11,685 INFO L423 AbstractCegarLoop]: === Iteration 26 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:11,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:11,685 INFO L82 PathProgramCache]: Analyzing trace with hash -404670552, now seen corresponding path program 1 times [2018-11-28 12:28:11,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:11,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:11,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:11,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:11,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:11,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:11,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:28:11,784 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/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-11-28 12:28:11,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:11,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:28:11,813 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-11-28 12:28:11,825 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-11-28 12:28:11,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:28:11,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:28:11,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:11,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-11-28 12:28:11,858 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-11-28 12:28:11,861 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-11-28 12:28:11,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:11,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:11,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:11,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-28 12:28:11,910 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-11-28 12:28:11,915 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-11-28 12:28:11,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:28:11,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:28:11,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:28:11,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-11-28 12:28:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:11,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:28:11,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-11-28 12:28:11,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 12:28:11,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 12:28:11,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-28 12:28:11,964 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 17 states. [2018-11-28 12:28:12,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:12,227 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-11-28 12:28:12,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:28:12,227 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-11-28 12:28:12,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:12,227 INFO L225 Difference]: With dead ends: 64 [2018-11-28 12:28:12,227 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 12:28:12,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-11-28 12:28:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 12:28:12,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2018-11-28 12:28:12,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-28 12:28:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-11-28 12:28:12,229 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 26 [2018-11-28 12:28:12,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:12,230 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-11-28 12:28:12,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 12:28:12,230 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-11-28 12:28:12,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 12:28:12,230 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:12,230 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-11-28 12:28:12,230 INFO L423 AbstractCegarLoop]: === Iteration 27 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:12,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:12,231 INFO L82 PathProgramCache]: Analyzing trace with hash -340170128, now seen corresponding path program 2 times [2018-11-28 12:28:12,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:12,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:12,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:12,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:12,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:12,425 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:12,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:28:12,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/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-11-28 12:28:12,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:28:12,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:28:12,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:28:12,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:28:12,455 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-11-28 12:28:12,457 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-11-28 12:28:12,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:12,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:12,465 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-11-28 12:28:12,466 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:12,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:12,470 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-11-28 12:28:12,482 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-11-28 12:28:12,484 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-11-28 12:28:12,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:12,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:12,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:12,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-28 12:28:12,534 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-11-28 12:28:12,536 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-11-28 12:28:12,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:12,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:12,543 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-11-28 12:28:12,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2018-11-28 12:28:12,637 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-11-28 12:28:12,639 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-11-28 12:28:12,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:12,646 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-11-28 12:28:12,646 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 12:28:12,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:28:12,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:28:12,654 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-11-28 12:28:12,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:12,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:28:12,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-28 12:28:12,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 12:28:12,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 12:28:12,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-11-28 12:28:12,704 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 22 states. [2018-11-28 12:28:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:13,210 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-28 12:28:13,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 12:28:13,211 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-11-28 12:28:13,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:13,211 INFO L225 Difference]: With dead ends: 63 [2018-11-28 12:28:13,211 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 12:28:13,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 12:28:13,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 12:28:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-28 12:28:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 12:28:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-11-28 12:28:13,212 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 27 [2018-11-28 12:28:13,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:13,213 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-28 12:28:13,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 12:28:13,213 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-28 12:28:13,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 12:28:13,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:13,213 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-11-28 12:28:13,213 INFO L423 AbstractCegarLoop]: === Iteration 28 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:13,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:13,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1553161650, now seen corresponding path program 1 times [2018-11-28 12:28:13,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:13,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:13,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:13,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:28:13,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:13,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:28:13,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/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-11-28 12:28:13,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:13,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:28:13,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:28:13,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 12:28:13,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2018-11-28 12:28:13,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 12:28:13,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 12:28:13,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:28:13,400 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 13 states. [2018-11-28 12:28:13,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:13,710 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-11-28 12:28:13,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 12:28:13,710 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-11-28 12:28:13,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:13,711 INFO L225 Difference]: With dead ends: 55 [2018-11-28 12:28:13,711 INFO L226 Difference]: Without dead ends: 53 [2018-11-28 12:28:13,711 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-11-28 12:28:13,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-28 12:28:13,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-11-28 12:28:13,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 12:28:13,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-11-28 12:28:13,713 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 27 [2018-11-28 12:28:13,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:13,713 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-11-28 12:28:13,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 12:28:13,713 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-28 12:28:13,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 12:28:13,713 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:13,713 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-11-28 12:28:13,714 INFO L423 AbstractCegarLoop]: === Iteration 29 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:13,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:13,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1553196471, now seen corresponding path program 2 times [2018-11-28 12:28:13,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:13,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:13,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:13,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:13,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:13,947 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:13,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:28:13,948 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/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-11-28 12:28:13,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:28:13,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:28:13,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:28:13,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:28:13,996 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-11-28 12:28:13,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:14,001 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-11-28 12:28:14,003 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-11-28 12:28:14,003 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:14,006 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:14,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:14,010 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-11-28 12:28:14,023 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-11-28 12:28:14,025 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-11-28 12:28:14,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:14,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:14,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:14,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-28 12:28:14,115 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-11-28 12:28:14,117 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-11-28 12:28:14,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:14,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:14,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:14,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-11-28 12:28:14,168 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-11-28 12:28:14,177 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-11-28 12:28:14,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:28:14,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:28:14,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:28:14,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-11-28 12:28:14,222 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:14,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:28:14,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-28 12:28:14,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 12:28:14,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 12:28:14,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-11-28 12:28:14,238 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 22 states. [2018-11-28 12:28:14,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:14,769 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-28 12:28:14,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 12:28:14,769 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-11-28 12:28:14,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:14,770 INFO L225 Difference]: With dead ends: 49 [2018-11-28 12:28:14,770 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 12:28:14,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=968, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 12:28:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 12:28:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-28 12:28:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 12:28:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-11-28 12:28:14,772 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 27 [2018-11-28 12:28:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:14,772 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-11-28 12:28:14,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 12:28:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-11-28 12:28:14,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 12:28:14,773 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:14,773 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-11-28 12:28:14,773 INFO L423 AbstractCegarLoop]: === Iteration 30 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:14,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:14,773 INFO L82 PathProgramCache]: Analyzing trace with hash 904450304, now seen corresponding path program 2 times [2018-11-28 12:28:14,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:14,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:14,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:14,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:28:14,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:14,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:28:14,885 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/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-11-28 12:28:14,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:28:14,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:28:14,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:28:14,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:28:14,942 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-11-28 12:28:14,944 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-11-28 12:28:14,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:14,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:14,962 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-11-28 12:28:14,962 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:14,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:14,967 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-11-28 12:28:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:15,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:28:15,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2018-11-28 12:28:15,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 12:28:15,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 12:28:15,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-28 12:28:15,132 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 18 states. [2018-11-28 12:28:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:15,406 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-11-28 12:28:15,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:28:15,406 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-11-28 12:28:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:15,406 INFO L225 Difference]: With dead ends: 55 [2018-11-28 12:28:15,406 INFO L226 Difference]: Without dead ends: 55 [2018-11-28 12:28:15,407 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-11-28 12:28:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-28 12:28:15,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-11-28 12:28:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 12:28:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-11-28 12:28:15,408 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 28 [2018-11-28 12:28:15,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:15,408 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-28 12:28:15,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 12:28:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-28 12:28:15,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 12:28:15,409 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:15,409 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-11-28 12:28:15,409 INFO L423 AbstractCegarLoop]: === Iteration 31 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:15,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:15,409 INFO L82 PathProgramCache]: Analyzing trace with hash 432781013, now seen corresponding path program 1 times [2018-11-28 12:28:15,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:15,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:15,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:15,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:28:15,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:15,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:15,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:28:15,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/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-11-28 12:28:15,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:15,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:28:15,685 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-11-28 12:28:15,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:15,690 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-11-28 12:28:15,692 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-11-28 12:28:15,693 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:15,696 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:15,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:15,701 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-11-28 12:28:15,725 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-11-28 12:28:15,727 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-11-28 12:28:15,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:15,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:15,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:15,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-28 12:28:15,827 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-11-28 12:28:15,829 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-11-28 12:28:15,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:15,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:15,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:15,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-11-28 12:28:15,867 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-11-28 12:28:15,869 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-11-28 12:28:15,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:15,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:15,879 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-11-28 12:28:15,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-11-28 12:28:15,935 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-11-28 12:28:15,937 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-11-28 12:28:15,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:15,946 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-11-28 12:28:15,947 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 12:28:15,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:28:15,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:28:15,957 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-11-28 12:28:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:16,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:28:16,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-11-28 12:28:16,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 12:28:16,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 12:28:16,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-11-28 12:28:16,010 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 24 states. [2018-11-28 12:28:16,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:16,685 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-11-28 12:28:16,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 12:28:16,685 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-11-28 12:28:16,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:16,686 INFO L225 Difference]: With dead ends: 54 [2018-11-28 12:28:16,686 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 12:28:16,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=216, Invalid=1424, Unknown=0, NotChecked=0, Total=1640 [2018-11-28 12:28:16,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 12:28:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 12:28:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 12:28:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-11-28 12:28:16,687 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 29 [2018-11-28 12:28:16,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:16,687 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-11-28 12:28:16,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 12:28:16,687 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-28 12:28:16,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:28:16,687 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:16,687 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-11-28 12:28:16,688 INFO L423 AbstractCegarLoop]: === Iteration 32 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:16,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:16,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2109992718, now seen corresponding path program 2 times [2018-11-28 12:28:16,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:16,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:16,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:16,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:16,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:16,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:28:16,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/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-11-28 12:28:16,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:28:16,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:28:16,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:28:16,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:28:16,961 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-11-28 12:28:16,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:16,966 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-11-28 12:28:16,968 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-11-28 12:28:16,969 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:16,972 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:16,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:16,976 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-11-28 12:28:16,997 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-11-28 12:28:16,999 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-11-28 12:28:16,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:17,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:17,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:17,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-28 12:28:17,096 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-11-28 12:28:17,098 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-11-28 12:28:17,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:17,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:17,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:17,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-11-28 12:28:17,152 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-11-28 12:28:17,158 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-11-28 12:28:17,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:28:17,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:28:17,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:28:17,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-11-28 12:28:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:17,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:28:17,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-28 12:28:17,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 12:28:17,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 12:28:17,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-11-28 12:28:17,234 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 22 states. [2018-11-28 12:28:17,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:17,644 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-28 12:28:17,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 12:28:17,645 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-11-28 12:28:17,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:17,645 INFO L225 Difference]: With dead ends: 43 [2018-11-28 12:28:17,645 INFO L226 Difference]: Without dead ends: 38 [2018-11-28 12:28:17,646 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-11-28 12:28:17,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-28 12:28:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-28 12:28:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 12:28:17,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-28 12:28:17,647 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 31 [2018-11-28 12:28:17,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:17,647 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-28 12:28:17,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 12:28:17,647 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-28 12:28:17,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 12:28:17,647 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:17,647 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-11-28 12:28:17,648 INFO L423 AbstractCegarLoop]: === Iteration 33 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:28:17,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:17,648 INFO L82 PathProgramCache]: Analyzing trace with hash -570734874, now seen corresponding path program 3 times [2018-11-28 12:28:17,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:17,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:17,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:17,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:28:17,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:17,764 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:28:17,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:28:17,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/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-11-28 12:28:17,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 12:28:17,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 12:28:17,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:28:17,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:28:17,828 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-11-28 12:28:17,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:17,834 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-11-28 12:28:17,836 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-11-28 12:28:17,837 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:28:17,841 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:17,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:28:17,845 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-11-28 12:28:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:18,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:28:18,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-11-28 12:28:18,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 12:28:18,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 12:28:18,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-11-28 12:28:18,007 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 20 states. [2018-11-28 12:28:18,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:18,647 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-28 12:28:18,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 12:28:18,647 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-11-28 12:28:18,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:18,648 INFO L225 Difference]: With dead ends: 45 [2018-11-28 12:28:18,648 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 12:28:18,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=1216, Unknown=0, NotChecked=0, Total=1406 [2018-11-28 12:28:18,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 12:28:18,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 12:28:18,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 12:28:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 12:28:18,649 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-11-28 12:28:18,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:18,649 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:28:18,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 12:28:18,649 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:28:18,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 12:28:18,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:28:18 BoogieIcfgContainer [2018-11-28 12:28:18,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:28:18,653 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:28:18,653 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:28:18,653 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:28:18,654 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:28:06" (3/4) ... [2018-11-28 12:28:18,657 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 12:28:18,661 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 12:28:18,661 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrlcpy [2018-11-28 12:28:18,661 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 12:28:18,662 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 12:28:18,662 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 12:28:18,665 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-11-28 12:28:18,665 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 12:28:18,666 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 12:28:18,696 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_66a8a22e-f7af-4be7-8d4e-4ac791b1caaa/bin-2019/uautomizer/witness.graphml [2018-11-28 12:28:18,697 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:28:18,697 INFO L168 Benchmark]: Toolchain (without parser) took 13257.78 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 289.4 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 126.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:28:18,698 INFO L168 Benchmark]: CDTParser took 0.15 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-11-28 12:28:18,699 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-11-28 12:28:18,699 INFO L168 Benchmark]: Boogie Preprocessor took 35.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:28:18,699 INFO L168 Benchmark]: RCFGBuilder took 335.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:28:18,699 INFO L168 Benchmark]: TraceAbstraction took 12495.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -43.0 MB). Peak memory consumption was 114.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:28:18,700 INFO L168 Benchmark]: Witness Printer took 43.48 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 143.7 kB). Peak memory consumption was 143.7 kB. Max. memory is 11.5 GB. [2018-11-28 12:28:18,701 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.15 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 344.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 335.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12495.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -43.0 MB). Peak memory consumption was 114.8 MB. Max. memory is 11.5 GB. * Witness Printer took 43.48 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 143.7 kB). Peak memory consumption was 143.7 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 554]: 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: 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: 548]: 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: 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: 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 - 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.4s OverallTime, 33 OverallIterations, 4 TraceHistogramMax, 6.0s 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.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 694 GetRequests, 241 SyntacticMatches, 10 SemanticMatches, 443 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 7.3s 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.4s SatisfiabilityAnalysisTime, 5.2s 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...